./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.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/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.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 a7eb970df9460734baa401f9be0d88efb243a90e1dffe6744cd9f9a47afa0217 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:26:53,824 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:26:53,826 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:26:53,853 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:26:53,856 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:26:53,859 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:26:53,861 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:26:53,864 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:26:53,866 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:26:53,870 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:26:53,871 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:26:53,873 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:26:53,873 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:26:53,875 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:26:53,877 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:26:53,879 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:26:53,880 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:26:53,881 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:26:53,884 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:26:53,890 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:26:53,891 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:26:53,892 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:26:53,894 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:26:53,894 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:26:53,901 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:26:53,901 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:26:53,901 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:26:53,903 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:26:53,904 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:26:53,904 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:26:53,905 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:26:53,906 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:26:53,908 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:26:53,909 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:26:53,910 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:26:53,911 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:26:53,911 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:26:53,911 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:26:53,912 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:26:53,912 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:26:53,913 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:26:53,914 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:26:53,949 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:26:53,950 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:26:53,950 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:26:53,951 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:26:53,952 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:26:53,952 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:26:53,952 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:26:53,952 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:26:53,953 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:26:53,953 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:26:53,954 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:26:53,954 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:26:53,954 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:26:53,954 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:26:53,955 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:26:53,955 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:26:53,955 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:26:53,955 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:26:53,955 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:26:53,955 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:26:53,956 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:26:53,956 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:26:53,956 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:26:53,956 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:26:53,956 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:26:53,957 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:26:53,957 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:26:53,957 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:26:53,957 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:26:53,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:26:53,958 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:26:53,958 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:26:53,958 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:26:53,958 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 -> a7eb970df9460734baa401f9be0d88efb243a90e1dffe6744cd9f9a47afa0217 [2022-02-20 18:26:54,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:26:54,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:26:54,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:26:54,208 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:26:54,208 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:26:54,209 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2022-02-20 18:26:54,293 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/925ff7c47/91c1bead38b3426babf5a67d6120c852/FLAGc710c345f [2022-02-20 18:26:54,680 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:26:54,681 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2022-02-20 18:26:54,688 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/925ff7c47/91c1bead38b3426babf5a67d6120c852/FLAGc710c345f [2022-02-20 18:26:54,698 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/925ff7c47/91c1bead38b3426babf5a67d6120c852 [2022-02-20 18:26:54,700 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:26:54,701 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:26:54,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:26:54,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:26:54,709 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:26:54,710 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:26:54" (1/1) ... [2022-02-20 18:26:54,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d592dfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:26:54, skipping insertion in model container [2022-02-20 18:26:54,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:26:54" (1/1) ... [2022-02-20 18:26:54,717 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:26:54,738 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:26:54,934 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/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c[6691,6704] [2022-02-20 18:26:54,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:26:54,945 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:26:54,980 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/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c[6691,6704] [2022-02-20 18:26:54,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:26:54,994 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:26:54,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:26:54 WrapperNode [2022-02-20 18:26:54,995 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:26:54,996 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:26:54,996 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:26:54,996 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:26:55,002 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:26:54" (1/1) ... [2022-02-20 18:26:55,019 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:26:54" (1/1) ... [2022-02-20 18:26:55,058 INFO L137 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 246 [2022-02-20 18:26:55,058 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:26:55,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:26:55,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:26:55,059 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:26:55,065 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:26:54" (1/1) ... [2022-02-20 18:26:55,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:26:54" (1/1) ... [2022-02-20 18:26:55,068 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:26:54" (1/1) ... [2022-02-20 18:26:55,068 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:26:54" (1/1) ... [2022-02-20 18:26:55,078 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:26:54" (1/1) ... [2022-02-20 18:26:55,084 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:26:54" (1/1) ... [2022-02-20 18:26:55,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:26:54" (1/1) ... [2022-02-20 18:26:55,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:26:55,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:26:55,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:26:55,097 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:26:55,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:26:54" (1/1) ... [2022-02-20 18:26:55,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:26:55,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:26:55,134 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:26:55,136 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:26:55,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:26:55,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:26:55,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:26:55,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:26:55,241 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:26:55,243 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:26:55,693 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:26:55,702 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:26:55,702 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:26:55,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:26:55 BoogieIcfgContainer [2022-02-20 18:26:55,704 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:26:55,706 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:26:55,706 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:26:55,708 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:26:55,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:26:54" (1/3) ... [2022-02-20 18:26:55,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4913cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:26:55, skipping insertion in model container [2022-02-20 18:26:55,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:26:54" (2/3) ... [2022-02-20 18:26:55,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4913cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:26:55, skipping insertion in model container [2022-02-20 18:26:55,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:26:55" (3/3) ... [2022-02-20 18:26:55,711 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2022-02-20 18:26:55,716 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:26:55,716 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:26:55,753 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:26:55,759 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:26:55,759 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:26:55,775 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 74 states have (on average 1.6756756756756757) internal successors, (124), 75 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:55,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 18:26:55,781 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:26:55,781 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] [2022-02-20 18:26:55,782 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:26:55,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:26:55,786 INFO L85 PathProgramCache]: Analyzing trace with hash 88399749, now seen corresponding path program 1 times [2022-02-20 18:26:55,794 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:26:55,794 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550211403] [2022-02-20 18:26:55,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:26:55,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:26:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:26:55,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {79#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; {79#true} is VALID [2022-02-20 18:26:55,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {79#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_#t~post27#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {79#true} is VALID [2022-02-20 18:26:55,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {79#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {81#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 18:26:55,976 INFO L290 TraceCheckUtils]: 3: Hoare triple {81#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {82#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:26:55,976 INFO L290 TraceCheckUtils]: 4: Hoare triple {82#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {83#(= |ULTIMATE.start_main_~i2~0#1| 0)} is VALID [2022-02-20 18:26:55,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {83#(= |ULTIMATE.start_main_~i2~0#1| 0)} assume !(0 == main_~i2~0#1); {80#false} is VALID [2022-02-20 18:26:55,977 INFO L290 TraceCheckUtils]: 6: Hoare triple {80#false} ~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_~i2~0#1 := 0; {80#false} is VALID [2022-02-20 18:26:55,977 INFO L290 TraceCheckUtils]: 7: Hoare triple {80#false} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {80#false} is VALID [2022-02-20 18:26:55,978 INFO L290 TraceCheckUtils]: 8: Hoare triple {80#false} assume !(0 != ~mode1~0 % 256); {80#false} is VALID [2022-02-20 18:26:55,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {80#false} assume !(0 != ~alive1~0 % 256); {80#false} is VALID [2022-02-20 18:26:55,978 INFO L290 TraceCheckUtils]: 10: Hoare triple {80#false} ~mode1~0 := 1; {80#false} is VALID [2022-02-20 18:26:55,978 INFO L290 TraceCheckUtils]: 11: Hoare triple {80#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {80#false} is VALID [2022-02-20 18:26:55,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {80#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {80#false} is VALID [2022-02-20 18:26:55,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {80#false} assume !(node2_~m2~0#1 != ~nomsg~0); {80#false} is VALID [2022-02-20 18:26:55,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {80#false} ~mode2~0 := 0; {80#false} is VALID [2022-02-20 18:26:55,979 INFO L290 TraceCheckUtils]: 15: Hoare triple {80#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {80#false} is VALID [2022-02-20 18:26:55,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {80#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {80#false} is VALID [2022-02-20 18:26:55,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {80#false} assume !(node3_~m3~0#1 != ~nomsg~0); {80#false} is VALID [2022-02-20 18:26:55,980 INFO L290 TraceCheckUtils]: 18: Hoare triple {80#false} ~mode3~0 := 0; {80#false} is VALID [2022-02-20 18:26:55,981 INFO L290 TraceCheckUtils]: 19: Hoare triple {80#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {80#false} is VALID [2022-02-20 18:26:55,981 INFO L290 TraceCheckUtils]: 20: Hoare triple {80#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {80#false} is VALID [2022-02-20 18:26:55,981 INFO L290 TraceCheckUtils]: 21: Hoare triple {80#false} check_#res#1 := check_~tmp~1#1; {80#false} is VALID [2022-02-20 18:26:55,981 INFO L290 TraceCheckUtils]: 22: Hoare triple {80#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {80#false} is VALID [2022-02-20 18:26:55,982 INFO L290 TraceCheckUtils]: 23: Hoare triple {80#false} assume 0 == assert_~arg#1 % 256; {80#false} is VALID [2022-02-20 18:26:55,982 INFO L290 TraceCheckUtils]: 24: Hoare triple {80#false} assume !false; {80#false} is VALID [2022-02-20 18:26:55,983 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:26:55,984 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:26:55,984 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550211403] [2022-02-20 18:26:55,984 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550211403] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:26:55,985 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:26:55,985 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:26:55,986 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679443995] [2022-02-20 18:26:55,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:26:55,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-02-20 18:26:55,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:26:55,996 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:56,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:26:56,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:26:56,020 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:26:56,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:26:56,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:26:56,041 INFO L87 Difference]: Start difference. First operand has 76 states, 74 states have (on average 1.6756756756756757) internal successors, (124), 75 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:56,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:56,443 INFO L93 Difference]: Finished difference Result 182 states and 292 transitions. [2022-02-20 18:26:56,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:26:56,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-02-20 18:26:56,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:26:56,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:56,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 292 transitions. [2022-02-20 18:26:56,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:56,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 292 transitions. [2022-02-20 18:26:56,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 292 transitions. [2022-02-20 18:26:56,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 292 edges. 292 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:26:56,718 INFO L225 Difference]: With dead ends: 182 [2022-02-20 18:26:56,719 INFO L226 Difference]: Without dead ends: 121 [2022-02-20 18:26:56,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:26:56,728 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 79 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:26:56,729 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 445 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:26:56,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-02-20 18:26:56,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 72. [2022-02-20 18:26:56,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:26:56,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 72 states, 71 states have (on average 1.408450704225352) internal successors, (100), 71 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:56,770 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 72 states, 71 states have (on average 1.408450704225352) internal successors, (100), 71 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:56,772 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 72 states, 71 states have (on average 1.408450704225352) internal successors, (100), 71 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:56,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:56,783 INFO L93 Difference]: Finished difference Result 121 states and 177 transitions. [2022-02-20 18:26:56,784 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 177 transitions. [2022-02-20 18:26:56,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:26:56,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:26:56,786 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 71 states have (on average 1.408450704225352) internal successors, (100), 71 states have internal predecessors, (100), 0 states have call successors, (0), 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 121 states. [2022-02-20 18:26:56,787 INFO L87 Difference]: Start difference. First operand has 72 states, 71 states have (on average 1.408450704225352) internal successors, (100), 71 states have internal predecessors, (100), 0 states have call successors, (0), 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 121 states. [2022-02-20 18:26:56,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:56,799 INFO L93 Difference]: Finished difference Result 121 states and 177 transitions. [2022-02-20 18:26:56,803 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 177 transitions. [2022-02-20 18:26:56,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:26:56,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:26:56,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:26:56,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:26:56,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.408450704225352) internal successors, (100), 71 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:56,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 100 transitions. [2022-02-20 18:26:56,814 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 100 transitions. Word has length 25 [2022-02-20 18:26:56,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:26:56,815 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 100 transitions. [2022-02-20 18:26:56,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:56,816 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 100 transitions. [2022-02-20 18:26:56,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 18:26:56,820 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:26:56,821 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:26:56,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:26:56,822 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:26:56,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:26:56,825 INFO L85 PathProgramCache]: Analyzing trace with hash 36726459, now seen corresponding path program 1 times [2022-02-20 18:26:56,826 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:26:56,826 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880180202] [2022-02-20 18:26:56,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:26:56,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:26:56,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:26:56,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {611#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; {611#true} is VALID [2022-02-20 18:26:56,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {611#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_#t~post27#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {611#true} is VALID [2022-02-20 18:26:56,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {611#true} assume 0 == ~r1~0; {611#true} is VALID [2022-02-20 18:26:56,983 INFO L290 TraceCheckUtils]: 3: Hoare triple {611#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {611#true} is VALID [2022-02-20 18:26:56,983 INFO L290 TraceCheckUtils]: 4: Hoare triple {611#true} assume ~id1~0 >= 0; {611#true} is VALID [2022-02-20 18:26:56,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {611#true} assume 0 == ~st1~0; {611#true} is VALID [2022-02-20 18:26:56,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {611#true} assume ~send1~0 == ~id1~0; {611#true} is VALID [2022-02-20 18:26:56,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {611#true} assume 0 == ~mode1~0 % 256; {611#true} is VALID [2022-02-20 18:26:56,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {611#true} assume ~id2~0 >= 0; {611#true} is VALID [2022-02-20 18:26:56,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {611#true} assume 0 == ~st2~0; {611#true} is VALID [2022-02-20 18:26:56,985 INFO L290 TraceCheckUtils]: 10: Hoare triple {611#true} assume ~send2~0 == ~id2~0; {611#true} is VALID [2022-02-20 18:26:56,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {611#true} assume 0 == ~mode2~0 % 256; {613#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:56,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {613#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {613#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:56,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {613#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {613#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:56,987 INFO L290 TraceCheckUtils]: 14: Hoare triple {613#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {613#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:56,988 INFO L290 TraceCheckUtils]: 15: Hoare triple {613#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {613#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:56,989 INFO L290 TraceCheckUtils]: 16: Hoare triple {613#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {613#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:56,989 INFO L290 TraceCheckUtils]: 17: Hoare triple {613#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {613#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:56,990 INFO L290 TraceCheckUtils]: 18: Hoare triple {613#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {613#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:56,991 INFO L290 TraceCheckUtils]: 19: Hoare triple {613#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {613#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:56,991 INFO L290 TraceCheckUtils]: 20: Hoare triple {613#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {613#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:56,992 INFO L290 TraceCheckUtils]: 21: Hoare triple {613#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == main_~i2~0#1); {613#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:56,993 INFO L290 TraceCheckUtils]: 22: Hoare triple {613#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~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_~i2~0#1 := 0; {613#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:56,993 INFO L290 TraceCheckUtils]: 23: Hoare triple {613#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {613#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:56,997 INFO L290 TraceCheckUtils]: 24: Hoare triple {613#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {613#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:56,998 INFO L290 TraceCheckUtils]: 25: Hoare triple {613#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~alive1~0 % 256); {613#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:56,999 INFO L290 TraceCheckUtils]: 26: Hoare triple {613#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {613#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:57,000 INFO L290 TraceCheckUtils]: 27: Hoare triple {613#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {613#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:26:57,003 INFO L290 TraceCheckUtils]: 28: Hoare triple {613#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {612#false} is VALID [2022-02-20 18:26:57,003 INFO L290 TraceCheckUtils]: 29: Hoare triple {612#false} assume !(node2_~m2~0#1 != ~nomsg~0); {612#false} is VALID [2022-02-20 18:26:57,004 INFO L290 TraceCheckUtils]: 30: Hoare triple {612#false} ~mode2~0 := 0; {612#false} is VALID [2022-02-20 18:26:57,004 INFO L290 TraceCheckUtils]: 31: Hoare triple {612#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {612#false} is VALID [2022-02-20 18:26:57,004 INFO L290 TraceCheckUtils]: 32: Hoare triple {612#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {612#false} is VALID [2022-02-20 18:26:57,004 INFO L290 TraceCheckUtils]: 33: Hoare triple {612#false} assume !(node3_~m3~0#1 != ~nomsg~0); {612#false} is VALID [2022-02-20 18:26:57,005 INFO L290 TraceCheckUtils]: 34: Hoare triple {612#false} ~mode3~0 := 0; {612#false} is VALID [2022-02-20 18:26:57,005 INFO L290 TraceCheckUtils]: 35: Hoare triple {612#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {612#false} is VALID [2022-02-20 18:26:57,005 INFO L290 TraceCheckUtils]: 36: Hoare triple {612#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {612#false} is VALID [2022-02-20 18:26:57,005 INFO L290 TraceCheckUtils]: 37: Hoare triple {612#false} check_#res#1 := check_~tmp~1#1; {612#false} is VALID [2022-02-20 18:26:57,006 INFO L290 TraceCheckUtils]: 38: Hoare triple {612#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {612#false} is VALID [2022-02-20 18:26:57,006 INFO L290 TraceCheckUtils]: 39: Hoare triple {612#false} assume 0 == assert_~arg#1 % 256; {612#false} is VALID [2022-02-20 18:26:57,006 INFO L290 TraceCheckUtils]: 40: Hoare triple {612#false} assume !false; {612#false} is VALID [2022-02-20 18:26:57,007 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:26:57,007 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:26:57,008 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880180202] [2022-02-20 18:26:57,008 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880180202] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:26:57,008 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:26:57,009 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:26:57,009 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678800862] [2022-02-20 18:26:57,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:26:57,011 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:26:57,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:26:57,012 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:26:57,049 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:26:57,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:26:57,051 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:26:57,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:26:57,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:26:57,053 INFO L87 Difference]: Start difference. First operand 72 states and 100 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:26:57,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:57,216 INFO L93 Difference]: Finished difference Result 158 states and 234 transitions. [2022-02-20 18:26:57,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:26:57,217 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:26:57,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:26:57,219 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:26:57,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 234 transitions. [2022-02-20 18:26:57,222 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:26:57,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 234 transitions. [2022-02-20 18:26:57,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 234 transitions. [2022-02-20 18:26:57,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:26:57,413 INFO L225 Difference]: With dead ends: 158 [2022-02-20 18:26:57,413 INFO L226 Difference]: Without dead ends: 109 [2022-02-20 18:26:57,413 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:26:57,414 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 61 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 207 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:26:57,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 207 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:26:57,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-02-20 18:26:57,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2022-02-20 18:26:57,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:26:57,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 107 states, 106 states have (on average 1.4622641509433962) internal successors, (155), 106 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:57,425 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 107 states, 106 states have (on average 1.4622641509433962) internal successors, (155), 106 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:57,426 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 107 states, 106 states have (on average 1.4622641509433962) internal successors, (155), 106 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:57,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:57,429 INFO L93 Difference]: Finished difference Result 109 states and 156 transitions. [2022-02-20 18:26:57,429 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2022-02-20 18:26:57,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:26:57,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:26:57,430 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 106 states have (on average 1.4622641509433962) internal successors, (155), 106 states have internal predecessors, (155), 0 states have call successors, (0), 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 109 states. [2022-02-20 18:26:57,430 INFO L87 Difference]: Start difference. First operand has 107 states, 106 states have (on average 1.4622641509433962) internal successors, (155), 106 states have internal predecessors, (155), 0 states have call successors, (0), 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 109 states. [2022-02-20 18:26:57,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:57,433 INFO L93 Difference]: Finished difference Result 109 states and 156 transitions. [2022-02-20 18:26:57,433 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2022-02-20 18:26:57,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:26:57,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:26:57,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:26:57,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:26:57,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.4622641509433962) internal successors, (155), 106 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:57,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2022-02-20 18:26:57,437 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 41 [2022-02-20 18:26:57,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:26:57,438 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2022-02-20 18:26:57,438 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:26:57,438 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2022-02-20 18:26:57,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 18:26:57,439 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:26:57,443 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:26:57,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:26:57,444 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:26:57,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:26:57,445 INFO L85 PathProgramCache]: Analyzing trace with hash 941880883, now seen corresponding path program 1 times [2022-02-20 18:26:57,445 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:26:57,445 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599678595] [2022-02-20 18:26:57,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:26:57,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:26:57,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:26:57,586 INFO L290 TraceCheckUtils]: 0: Hoare triple {1126#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; {1126#true} is VALID [2022-02-20 18:26:57,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {1126#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_#t~post27#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1126#true} is VALID [2022-02-20 18:26:57,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {1126#true} assume 0 == ~r1~0; {1126#true} is VALID [2022-02-20 18:26:57,587 INFO L290 TraceCheckUtils]: 3: Hoare triple {1126#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {1126#true} is VALID [2022-02-20 18:26:57,587 INFO L290 TraceCheckUtils]: 4: Hoare triple {1126#true} assume ~id1~0 >= 0; {1126#true} is VALID [2022-02-20 18:26:57,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {1126#true} assume 0 == ~st1~0; {1126#true} is VALID [2022-02-20 18:26:57,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {1126#true} assume ~send1~0 == ~id1~0; {1126#true} is VALID [2022-02-20 18:26:57,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {1126#true} assume 0 == ~mode1~0 % 256; {1126#true} is VALID [2022-02-20 18:26:57,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {1126#true} assume ~id2~0 >= 0; {1126#true} is VALID [2022-02-20 18:26:57,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {1126#true} assume 0 == ~st2~0; {1126#true} is VALID [2022-02-20 18:26:57,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {1126#true} assume ~send2~0 == ~id2~0; {1126#true} is VALID [2022-02-20 18:26:57,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {1126#true} assume 0 == ~mode2~0 % 256; {1126#true} is VALID [2022-02-20 18:26:57,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {1126#true} assume ~id3~0 >= 0; {1126#true} is VALID [2022-02-20 18:26:57,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {1126#true} assume 0 == ~st3~0; {1126#true} is VALID [2022-02-20 18:26:57,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {1126#true} assume ~send3~0 == ~id3~0; {1126#true} is VALID [2022-02-20 18:26:57,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {1126#true} assume 0 == ~mode3~0 % 256; {1128#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:57,591 INFO L290 TraceCheckUtils]: 16: Hoare triple {1128#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {1128#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:57,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {1128#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {1128#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:57,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {1128#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {1128#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:57,593 INFO L290 TraceCheckUtils]: 19: Hoare triple {1128#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {1128#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:57,593 INFO L290 TraceCheckUtils]: 20: Hoare triple {1128#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {1128#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:57,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {1128#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == main_~i2~0#1); {1128#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:57,594 INFO L290 TraceCheckUtils]: 22: Hoare triple {1128#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~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_~i2~0#1 := 0; {1128#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:57,595 INFO L290 TraceCheckUtils]: 23: Hoare triple {1128#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1128#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:57,596 INFO L290 TraceCheckUtils]: 24: Hoare triple {1128#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {1128#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:57,596 INFO L290 TraceCheckUtils]: 25: Hoare triple {1128#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~alive1~0 % 256); {1128#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:57,597 INFO L290 TraceCheckUtils]: 26: Hoare triple {1128#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {1128#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:57,597 INFO L290 TraceCheckUtils]: 27: Hoare triple {1128#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1128#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:57,598 INFO L290 TraceCheckUtils]: 28: Hoare triple {1128#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {1128#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:57,598 INFO L290 TraceCheckUtils]: 29: Hoare triple {1128#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~alive2~0 % 256); {1128#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:57,599 INFO L290 TraceCheckUtils]: 30: Hoare triple {1128#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~id2~0); {1128#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:57,600 INFO L290 TraceCheckUtils]: 31: Hoare triple {1128#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {1128#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:57,600 INFO L290 TraceCheckUtils]: 32: Hoare triple {1128#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1128#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:26:57,601 INFO L290 TraceCheckUtils]: 33: Hoare triple {1128#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1127#false} is VALID [2022-02-20 18:26:57,601 INFO L290 TraceCheckUtils]: 34: Hoare triple {1127#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1127#false} is VALID [2022-02-20 18:26:57,601 INFO L290 TraceCheckUtils]: 35: Hoare triple {1127#false} ~mode3~0 := 0; {1127#false} is VALID [2022-02-20 18:26:57,602 INFO L290 TraceCheckUtils]: 36: Hoare triple {1127#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1127#false} is VALID [2022-02-20 18:26:57,602 INFO L290 TraceCheckUtils]: 37: Hoare triple {1127#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {1127#false} is VALID [2022-02-20 18:26:57,602 INFO L290 TraceCheckUtils]: 38: Hoare triple {1127#false} check_#res#1 := check_~tmp~1#1; {1127#false} is VALID [2022-02-20 18:26:57,602 INFO L290 TraceCheckUtils]: 39: Hoare triple {1127#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1127#false} is VALID [2022-02-20 18:26:57,603 INFO L290 TraceCheckUtils]: 40: Hoare triple {1127#false} assume 0 == assert_~arg#1 % 256; {1127#false} is VALID [2022-02-20 18:26:57,603 INFO L290 TraceCheckUtils]: 41: Hoare triple {1127#false} assume !false; {1127#false} is VALID [2022-02-20 18:26:57,603 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:26:57,604 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:26:57,604 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599678595] [2022-02-20 18:26:57,604 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599678595] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:26:57,604 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:26:57,604 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:26:57,605 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135168208] [2022-02-20 18:26:57,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:26:57,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 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:26:57,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:26:57,606 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 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:26:57,639 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:26:57,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:26:57,640 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:26:57,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:26:57,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:26:57,641 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 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:26:57,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:57,782 INFO L93 Difference]: Finished difference Result 251 states and 379 transitions. [2022-02-20 18:26:57,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:26:57,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 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:26:57,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:26:57,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 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:26:57,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 234 transitions. [2022-02-20 18:26:57,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 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:26:57,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 234 transitions. [2022-02-20 18:26:57,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 234 transitions. [2022-02-20 18:26:57,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:26:57,967 INFO L225 Difference]: With dead ends: 251 [2022-02-20 18:26:57,967 INFO L226 Difference]: Without dead ends: 167 [2022-02-20 18:26:57,968 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:26:57,969 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 56 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 198 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:26:57,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 198 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:26:57,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-02-20 18:26:57,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2022-02-20 18:26:57,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:26:57,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand has 165 states, 164 states have (on average 1.4878048780487805) internal successors, (244), 164 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:57,981 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand has 165 states, 164 states have (on average 1.4878048780487805) internal successors, (244), 164 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:57,982 INFO L87 Difference]: Start difference. First operand 167 states. Second operand has 165 states, 164 states have (on average 1.4878048780487805) internal successors, (244), 164 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:57,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:57,987 INFO L93 Difference]: Finished difference Result 167 states and 245 transitions. [2022-02-20 18:26:57,987 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 245 transitions. [2022-02-20 18:26:57,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:26:57,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:26:57,988 INFO L74 IsIncluded]: Start isIncluded. First operand has 165 states, 164 states have (on average 1.4878048780487805) internal successors, (244), 164 states have internal predecessors, (244), 0 states have call successors, (0), 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 167 states. [2022-02-20 18:26:57,989 INFO L87 Difference]: Start difference. First operand has 165 states, 164 states have (on average 1.4878048780487805) internal successors, (244), 164 states have internal predecessors, (244), 0 states have call successors, (0), 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 167 states. [2022-02-20 18:26:57,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:57,994 INFO L93 Difference]: Finished difference Result 167 states and 245 transitions. [2022-02-20 18:26:57,994 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 245 transitions. [2022-02-20 18:26:57,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:26:57,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:26:57,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:26:57,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:26:57,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.4878048780487805) internal successors, (244), 164 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:58,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 244 transitions. [2022-02-20 18:26:58,000 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 244 transitions. Word has length 42 [2022-02-20 18:26:58,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:26:58,001 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 244 transitions. [2022-02-20 18:26:58,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 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:26:58,001 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2022-02-20 18:26:58,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 18:26:58,002 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:26:58,002 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:26:58,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:26:58,002 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:26:58,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:26:58,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1294438837, now seen corresponding path program 1 times [2022-02-20 18:26:58,003 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:26:58,003 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433652046] [2022-02-20 18:26:58,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:26:58,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:26:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:26:58,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {1933#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; {1933#true} is VALID [2022-02-20 18:26:58,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {1933#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_#t~post27#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1933#true} is VALID [2022-02-20 18:26:58,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {1933#true} assume 0 == ~r1~0; {1933#true} is VALID [2022-02-20 18:26:58,092 INFO L290 TraceCheckUtils]: 3: Hoare triple {1933#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {1933#true} is VALID [2022-02-20 18:26:58,092 INFO L290 TraceCheckUtils]: 4: Hoare triple {1933#true} assume ~id1~0 >= 0; {1933#true} is VALID [2022-02-20 18:26:58,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {1933#true} assume 0 == ~st1~0; {1935#(<= ~st1~0 0)} is VALID [2022-02-20 18:26:58,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {1935#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {1935#(<= ~st1~0 0)} is VALID [2022-02-20 18:26:58,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {1935#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {1935#(<= ~st1~0 0)} is VALID [2022-02-20 18:26:58,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {1935#(<= ~st1~0 0)} assume ~id2~0 >= 0; {1935#(<= ~st1~0 0)} is VALID [2022-02-20 18:26:58,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {1935#(<= ~st1~0 0)} assume 0 == ~st2~0; {1936#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:58,094 INFO L290 TraceCheckUtils]: 10: Hoare triple {1936#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {1936#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:58,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {1936#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {1936#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:58,095 INFO L290 TraceCheckUtils]: 12: Hoare triple {1936#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {1936#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:58,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {1936#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:58,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:58,096 INFO L290 TraceCheckUtils]: 15: Hoare triple {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:58,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:58,097 INFO L290 TraceCheckUtils]: 17: Hoare triple {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:58,097 INFO L290 TraceCheckUtils]: 18: Hoare triple {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:58,098 INFO L290 TraceCheckUtils]: 19: Hoare triple {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:58,098 INFO L290 TraceCheckUtils]: 20: Hoare triple {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:58,098 INFO L290 TraceCheckUtils]: 21: Hoare triple {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~i2~0#1); {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:58,099 INFO L290 TraceCheckUtils]: 22: Hoare triple {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~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_~i2~0#1 := 0; {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:58,099 INFO L290 TraceCheckUtils]: 23: Hoare triple {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:58,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:58,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive1~0 % 256); {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:58,100 INFO L290 TraceCheckUtils]: 26: Hoare triple {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:58,101 INFO L290 TraceCheckUtils]: 27: Hoare triple {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:58,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:58,102 INFO L290 TraceCheckUtils]: 29: Hoare triple {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive2~0 % 256); {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:58,102 INFO L290 TraceCheckUtils]: 30: Hoare triple {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:58,102 INFO L290 TraceCheckUtils]: 31: Hoare triple {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:58,103 INFO L290 TraceCheckUtils]: 32: Hoare triple {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:58,103 INFO L290 TraceCheckUtils]: 33: Hoare triple {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:58,104 INFO L290 TraceCheckUtils]: 34: Hoare triple {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive3~0 % 256); {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:58,104 INFO L290 TraceCheckUtils]: 35: Hoare triple {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:58,104 INFO L290 TraceCheckUtils]: 36: Hoare triple {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:58,105 INFO L290 TraceCheckUtils]: 37: Hoare triple {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:26:58,105 INFO L290 TraceCheckUtils]: 38: Hoare triple {1937#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {1934#false} is VALID [2022-02-20 18:26:58,106 INFO L290 TraceCheckUtils]: 39: Hoare triple {1934#false} check_#res#1 := check_~tmp~1#1; {1934#false} is VALID [2022-02-20 18:26:58,106 INFO L290 TraceCheckUtils]: 40: Hoare triple {1934#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1934#false} is VALID [2022-02-20 18:26:58,106 INFO L290 TraceCheckUtils]: 41: Hoare triple {1934#false} assume 0 == assert_~arg#1 % 256; {1934#false} is VALID [2022-02-20 18:26:58,106 INFO L290 TraceCheckUtils]: 42: Hoare triple {1934#false} assume !false; {1934#false} is VALID [2022-02-20 18:26:58,107 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:26:58,107 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:26:58,107 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433652046] [2022-02-20 18:26:58,107 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433652046] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:26:58,107 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:26:58,108 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:26:58,108 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024971039] [2022-02-20 18:26:58,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:26:58,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 18:26:58,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:26:58,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:58,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:26:58,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:26:58,146 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:26:58,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:26:58,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:26:58,147 INFO L87 Difference]: Start difference. First operand 165 states and 244 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:58,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:58,702 INFO L93 Difference]: Finished difference Result 733 states and 1128 transitions. [2022-02-20 18:26:58,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:26:58,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 18:26:58,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:26:58,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:58,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 408 transitions. [2022-02-20 18:26:58,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:58,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 408 transitions. [2022-02-20 18:26:58,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 408 transitions. [2022-02-20 18:26:59,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 408 edges. 408 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:26:59,041 INFO L225 Difference]: With dead ends: 733 [2022-02-20 18:26:59,042 INFO L226 Difference]: Without dead ends: 591 [2022-02-20 18:26:59,045 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:26:59,053 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 432 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:26:59,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [432 Valid, 492 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:26:59,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2022-02-20 18:26:59,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 305. [2022-02-20 18:26:59,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:26:59,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 591 states. Second operand has 305 states, 304 states have (on average 1.5) internal successors, (456), 304 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:59,140 INFO L74 IsIncluded]: Start isIncluded. First operand 591 states. Second operand has 305 states, 304 states have (on average 1.5) internal successors, (456), 304 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:59,141 INFO L87 Difference]: Start difference. First operand 591 states. Second operand has 305 states, 304 states have (on average 1.5) internal successors, (456), 304 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:59,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:59,164 INFO L93 Difference]: Finished difference Result 591 states and 899 transitions. [2022-02-20 18:26:59,164 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 899 transitions. [2022-02-20 18:26:59,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:26:59,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:26:59,166 INFO L74 IsIncluded]: Start isIncluded. First operand has 305 states, 304 states have (on average 1.5) internal successors, (456), 304 states have internal predecessors, (456), 0 states have call successors, (0), 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 591 states. [2022-02-20 18:26:59,167 INFO L87 Difference]: Start difference. First operand has 305 states, 304 states have (on average 1.5) internal successors, (456), 304 states have internal predecessors, (456), 0 states have call successors, (0), 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 591 states. [2022-02-20 18:26:59,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:26:59,191 INFO L93 Difference]: Finished difference Result 591 states and 899 transitions. [2022-02-20 18:26:59,191 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 899 transitions. [2022-02-20 18:26:59,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:26:59,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:26:59,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:26:59,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:26:59,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 1.5) internal successors, (456), 304 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:59,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 456 transitions. [2022-02-20 18:26:59,202 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 456 transitions. Word has length 43 [2022-02-20 18:26:59,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:26:59,203 INFO L470 AbstractCegarLoop]: Abstraction has 305 states and 456 transitions. [2022-02-20 18:26:59,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:59,203 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 456 transitions. [2022-02-20 18:26:59,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 18:26:59,204 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:26:59,204 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:26:59,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:26:59,204 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:26:59,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:26:59,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1856221715, now seen corresponding path program 1 times [2022-02-20 18:26:59,205 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:26:59,205 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44705508] [2022-02-20 18:26:59,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:26:59,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:26:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:26:59,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {4307#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; {4307#true} is VALID [2022-02-20 18:26:59,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {4307#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_#t~post27#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {4307#true} is VALID [2022-02-20 18:26:59,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {4307#true} assume 0 == ~r1~0; {4307#true} is VALID [2022-02-20 18:26:59,292 INFO L290 TraceCheckUtils]: 3: Hoare triple {4307#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:59,292 INFO L290 TraceCheckUtils]: 4: Hoare triple {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 >= 0; {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:59,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st1~0; {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:59,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send1~0 == ~id1~0; {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:59,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode1~0 % 256; {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:59,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 >= 0; {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:59,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st2~0; {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:59,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send2~0 == ~id2~0; {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:59,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode2~0 % 256; {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:59,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 >= 0; {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:59,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st3~0; {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:59,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send3~0 == ~id3~0; {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:59,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode3~0 % 256; {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:59,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id2~0; {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:59,307 INFO L290 TraceCheckUtils]: 17: Hoare triple {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id3~0; {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:59,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:59,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} init_#res#1 := init_~tmp~0#1; {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:59,309 INFO L290 TraceCheckUtils]: 20: Hoare triple {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:59,309 INFO L290 TraceCheckUtils]: 21: Hoare triple {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume !(0 == main_~i2~0#1); {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:59,310 INFO L290 TraceCheckUtils]: 22: Hoare triple {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} ~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_~i2~0#1 := 0; {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:59,310 INFO L290 TraceCheckUtils]: 23: Hoare triple {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:59,311 INFO L290 TraceCheckUtils]: 24: Hoare triple {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume !(0 != ~mode1~0 % 256); {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:26:59,312 INFO L290 TraceCheckUtils]: 25: Hoare triple {4309#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume !(0 != ~alive1~0 % 256); {4310#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:26:59,312 INFO L290 TraceCheckUtils]: 26: Hoare triple {4310#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} ~mode1~0 := 1; {4310#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:26:59,313 INFO L290 TraceCheckUtils]: 27: Hoare triple {4310#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {4310#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:26:59,313 INFO L290 TraceCheckUtils]: 28: Hoare triple {4310#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} assume !(0 != ~mode2~0 % 256); {4310#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:26:59,314 INFO L290 TraceCheckUtils]: 29: Hoare triple {4310#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} assume !(0 != ~alive2~0 % 256); {4311#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} is VALID [2022-02-20 18:26:59,314 INFO L290 TraceCheckUtils]: 30: Hoare triple {4311#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} assume !(~send2~0 != ~id2~0); {4311#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} is VALID [2022-02-20 18:26:59,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {4311#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} ~mode2~0 := 1; {4311#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} is VALID [2022-02-20 18:26:59,315 INFO L290 TraceCheckUtils]: 32: Hoare triple {4311#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {4311#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} is VALID [2022-02-20 18:26:59,316 INFO L290 TraceCheckUtils]: 33: Hoare triple {4311#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} assume !(0 != ~mode3~0 % 256); {4311#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} is VALID [2022-02-20 18:26:59,316 INFO L290 TraceCheckUtils]: 34: Hoare triple {4311#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} assume !(0 != ~alive3~0 % 256); {4308#false} is VALID [2022-02-20 18:26:59,316 INFO L290 TraceCheckUtils]: 35: Hoare triple {4308#false} assume !(~send3~0 != ~id3~0); {4308#false} is VALID [2022-02-20 18:26:59,316 INFO L290 TraceCheckUtils]: 36: Hoare triple {4308#false} ~mode3~0 := 1; {4308#false} is VALID [2022-02-20 18:26:59,317 INFO L290 TraceCheckUtils]: 37: Hoare triple {4308#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {4308#false} is VALID [2022-02-20 18:26:59,317 INFO L290 TraceCheckUtils]: 38: Hoare triple {4308#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {4308#false} is VALID [2022-02-20 18:26:59,317 INFO L290 TraceCheckUtils]: 39: Hoare triple {4308#false} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {4308#false} is VALID [2022-02-20 18:26:59,317 INFO L290 TraceCheckUtils]: 40: Hoare triple {4308#false} check_#res#1 := check_~tmp~1#1; {4308#false} is VALID [2022-02-20 18:26:59,317 INFO L290 TraceCheckUtils]: 41: Hoare triple {4308#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {4308#false} is VALID [2022-02-20 18:26:59,318 INFO L290 TraceCheckUtils]: 42: Hoare triple {4308#false} assume 0 == assert_~arg#1 % 256; {4308#false} is VALID [2022-02-20 18:26:59,318 INFO L290 TraceCheckUtils]: 43: Hoare triple {4308#false} assume !false; {4308#false} is VALID [2022-02-20 18:26:59,318 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:26:59,318 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:26:59,319 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44705508] [2022-02-20 18:26:59,319 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44705508] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:26:59,319 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:26:59,319 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:26:59,319 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536172319] [2022-02-20 18:26:59,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:26:59,320 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-02-20 18:26:59,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:26:59,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:26:59,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:26:59,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:26:59,361 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:26:59,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:26:59,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:26:59,362 INFO L87 Difference]: Start difference. First operand 305 states and 456 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:00,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:00,004 INFO L93 Difference]: Finished difference Result 1079 states and 1631 transitions. [2022-02-20 18:27:00,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:27:00,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-02-20 18:27:00,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:00,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:00,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 300 transitions. [2022-02-20 18:27:00,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:00,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 300 transitions. [2022-02-20 18:27:00,009 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 300 transitions. [2022-02-20 18:27:00,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 300 edges. 300 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:00,296 INFO L225 Difference]: With dead ends: 1079 [2022-02-20 18:27:00,296 INFO L226 Difference]: Without dead ends: 797 [2022-02-20 18:27:00,297 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:27:00,298 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 225 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:27:00,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 276 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:00,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2022-02-20 18:27:00,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 793. [2022-02-20 18:27:00,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:00,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 797 states. Second operand has 793 states, 792 states have (on average 1.5) internal successors, (1188), 792 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:00,530 INFO L74 IsIncluded]: Start isIncluded. First operand 797 states. Second operand has 793 states, 792 states have (on average 1.5) internal successors, (1188), 792 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:00,531 INFO L87 Difference]: Start difference. First operand 797 states. Second operand has 793 states, 792 states have (on average 1.5) internal successors, (1188), 792 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:00,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:00,565 INFO L93 Difference]: Finished difference Result 797 states and 1190 transitions. [2022-02-20 18:27:00,565 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1190 transitions. [2022-02-20 18:27:00,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:00,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:00,569 INFO L74 IsIncluded]: Start isIncluded. First operand has 793 states, 792 states have (on average 1.5) internal successors, (1188), 792 states have internal predecessors, (1188), 0 states have call successors, (0), 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 797 states. [2022-02-20 18:27:00,570 INFO L87 Difference]: Start difference. First operand has 793 states, 792 states have (on average 1.5) internal successors, (1188), 792 states have internal predecessors, (1188), 0 states have call successors, (0), 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 797 states. [2022-02-20 18:27:00,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:00,603 INFO L93 Difference]: Finished difference Result 797 states and 1190 transitions. [2022-02-20 18:27:00,603 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1190 transitions. [2022-02-20 18:27:00,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:00,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:00,605 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:00,605 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:00,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 792 states have (on average 1.5) internal successors, (1188), 792 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:00,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1188 transitions. [2022-02-20 18:27:00,642 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1188 transitions. Word has length 44 [2022-02-20 18:27:00,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:00,643 INFO L470 AbstractCegarLoop]: Abstraction has 793 states and 1188 transitions. [2022-02-20 18:27:00,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:00,643 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1188 transitions. [2022-02-20 18:27:00,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 18:27:00,644 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:00,644 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:27:00,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:27:00,644 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:00,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:00,645 INFO L85 PathProgramCache]: Analyzing trace with hash -416789945, now seen corresponding path program 1 times [2022-02-20 18:27:00,645 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:00,645 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789130155] [2022-02-20 18:27:00,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:00,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:00,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {8062#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; {8062#true} is VALID [2022-02-20 18:27:00,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {8062#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_#t~post27#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {8062#true} is VALID [2022-02-20 18:27:00,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {8062#true} assume 0 == ~r1~0; {8062#true} is VALID [2022-02-20 18:27:00,689 INFO L290 TraceCheckUtils]: 3: Hoare triple {8062#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {8062#true} is VALID [2022-02-20 18:27:00,689 INFO L290 TraceCheckUtils]: 4: Hoare triple {8062#true} assume ~id1~0 >= 0; {8062#true} is VALID [2022-02-20 18:27:00,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {8062#true} assume 0 == ~st1~0; {8062#true} is VALID [2022-02-20 18:27:00,689 INFO L290 TraceCheckUtils]: 6: Hoare triple {8062#true} assume ~send1~0 == ~id1~0; {8062#true} is VALID [2022-02-20 18:27:00,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {8062#true} assume 0 == ~mode1~0 % 256; {8064#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:00,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {8064#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {8064#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:00,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {8064#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {8064#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:00,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {8064#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {8064#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:00,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {8064#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {8064#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:00,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {8064#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {8064#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:00,693 INFO L290 TraceCheckUtils]: 13: Hoare triple {8064#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {8064#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:00,693 INFO L290 TraceCheckUtils]: 14: Hoare triple {8064#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {8064#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:00,693 INFO L290 TraceCheckUtils]: 15: Hoare triple {8064#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {8064#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:00,694 INFO L290 TraceCheckUtils]: 16: Hoare triple {8064#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {8064#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:00,694 INFO L290 TraceCheckUtils]: 17: Hoare triple {8064#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {8064#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:00,695 INFO L290 TraceCheckUtils]: 18: Hoare triple {8064#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {8064#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:00,695 INFO L290 TraceCheckUtils]: 19: Hoare triple {8064#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {8064#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:00,696 INFO L290 TraceCheckUtils]: 20: Hoare triple {8064#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {8064#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:00,696 INFO L290 TraceCheckUtils]: 21: Hoare triple {8064#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == main_~i2~0#1); {8064#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:00,696 INFO L290 TraceCheckUtils]: 22: Hoare triple {8064#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} ~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_~i2~0#1 := 0; {8064#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:00,697 INFO L290 TraceCheckUtils]: 23: Hoare triple {8064#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {8064#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:00,698 INFO L290 TraceCheckUtils]: 24: Hoare triple {8064#(= (+ (* (- 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);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {8063#false} is VALID [2022-02-20 18:27:00,698 INFO L290 TraceCheckUtils]: 25: Hoare triple {8063#false} assume !(node1_~m1~0#1 != ~nomsg~0); {8063#false} is VALID [2022-02-20 18:27:00,698 INFO L290 TraceCheckUtils]: 26: Hoare triple {8063#false} ~mode1~0 := 0; {8063#false} is VALID [2022-02-20 18:27:00,698 INFO L290 TraceCheckUtils]: 27: Hoare triple {8063#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {8063#false} is VALID [2022-02-20 18:27:00,698 INFO L290 TraceCheckUtils]: 28: Hoare triple {8063#false} assume !(0 != ~mode2~0 % 256); {8063#false} is VALID [2022-02-20 18:27:00,698 INFO L290 TraceCheckUtils]: 29: Hoare triple {8063#false} assume !(0 != ~alive2~0 % 256); {8063#false} is VALID [2022-02-20 18:27:00,699 INFO L290 TraceCheckUtils]: 30: Hoare triple {8063#false} assume !(~send2~0 != ~id2~0); {8063#false} is VALID [2022-02-20 18:27:00,699 INFO L290 TraceCheckUtils]: 31: Hoare triple {8063#false} ~mode2~0 := 1; {8063#false} is VALID [2022-02-20 18:27:00,699 INFO L290 TraceCheckUtils]: 32: Hoare triple {8063#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {8063#false} is VALID [2022-02-20 18:27:00,699 INFO L290 TraceCheckUtils]: 33: Hoare triple {8063#false} assume !(0 != ~mode3~0 % 256); {8063#false} is VALID [2022-02-20 18:27:00,699 INFO L290 TraceCheckUtils]: 34: Hoare triple {8063#false} assume !(0 != ~alive3~0 % 256); {8063#false} is VALID [2022-02-20 18:27:00,700 INFO L290 TraceCheckUtils]: 35: Hoare triple {8063#false} assume !(~send3~0 != ~id3~0); {8063#false} is VALID [2022-02-20 18:27:00,700 INFO L290 TraceCheckUtils]: 36: Hoare triple {8063#false} ~mode3~0 := 1; {8063#false} is VALID [2022-02-20 18:27:00,700 INFO L290 TraceCheckUtils]: 37: Hoare triple {8063#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {8063#false} is VALID [2022-02-20 18:27:00,700 INFO L290 TraceCheckUtils]: 38: Hoare triple {8063#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {8063#false} is VALID [2022-02-20 18:27:00,700 INFO L290 TraceCheckUtils]: 39: Hoare triple {8063#false} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {8063#false} is VALID [2022-02-20 18:27:00,700 INFO L290 TraceCheckUtils]: 40: Hoare triple {8063#false} check_#res#1 := check_~tmp~1#1; {8063#false} is VALID [2022-02-20 18:27:00,700 INFO L290 TraceCheckUtils]: 41: Hoare triple {8063#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {8063#false} is VALID [2022-02-20 18:27:00,701 INFO L290 TraceCheckUtils]: 42: Hoare triple {8063#false} assume 0 == assert_~arg#1 % 256; {8063#false} is VALID [2022-02-20 18:27:00,701 INFO L290 TraceCheckUtils]: 43: Hoare triple {8063#false} assume !false; {8063#false} is VALID [2022-02-20 18:27:00,701 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:27:00,701 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:00,701 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789130155] [2022-02-20 18:27:00,702 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789130155] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:00,702 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:00,702 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:27:00,702 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572100672] [2022-02-20 18:27:00,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:00,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-02-20 18:27:00,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:00,703 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:00,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:00,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:27:00,749 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:00,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:27:00,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:27:00,751 INFO L87 Difference]: Start difference. First operand 793 states and 1188 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:01,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:01,608 INFO L93 Difference]: Finished difference Result 2117 states and 3158 transitions. [2022-02-20 18:27:01,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:27:01,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-02-20 18:27:01,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:01,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:01,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 239 transitions. [2022-02-20 18:27:01,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:01,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 239 transitions. [2022-02-20 18:27:01,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 239 transitions. [2022-02-20 18:27:01,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 239 edges. 239 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:01,875 INFO L225 Difference]: With dead ends: 2117 [2022-02-20 18:27:01,876 INFO L226 Difference]: Without dead ends: 1347 [2022-02-20 18:27:01,877 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:27:01,878 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 65 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 231 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:27:01,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 231 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:01,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2022-02-20 18:27:02,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1345. [2022-02-20 18:27:02,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:02,343 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1347 states. Second operand has 1345 states, 1344 states have (on average 1.4642857142857142) internal successors, (1968), 1344 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:02,346 INFO L74 IsIncluded]: Start isIncluded. First operand 1347 states. Second operand has 1345 states, 1344 states have (on average 1.4642857142857142) internal successors, (1968), 1344 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:02,349 INFO L87 Difference]: Start difference. First operand 1347 states. Second operand has 1345 states, 1344 states have (on average 1.4642857142857142) internal successors, (1968), 1344 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:02,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:02,416 INFO L93 Difference]: Finished difference Result 1347 states and 1969 transitions. [2022-02-20 18:27:02,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1969 transitions. [2022-02-20 18:27:02,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:02,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:02,421 INFO L74 IsIncluded]: Start isIncluded. First operand has 1345 states, 1344 states have (on average 1.4642857142857142) internal successors, (1968), 1344 states have internal predecessors, (1968), 0 states have call successors, (0), 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 1347 states. [2022-02-20 18:27:02,424 INFO L87 Difference]: Start difference. First operand has 1345 states, 1344 states have (on average 1.4642857142857142) internal successors, (1968), 1344 states have internal predecessors, (1968), 0 states have call successors, (0), 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 1347 states. [2022-02-20 18:27:02,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:02,503 INFO L93 Difference]: Finished difference Result 1347 states and 1969 transitions. [2022-02-20 18:27:02,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1969 transitions. [2022-02-20 18:27:02,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:02,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:02,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:02,506 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:02,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1345 states, 1344 states have (on average 1.4642857142857142) internal successors, (1968), 1344 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:02,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1968 transitions. [2022-02-20 18:27:02,605 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1968 transitions. Word has length 44 [2022-02-20 18:27:02,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:02,606 INFO L470 AbstractCegarLoop]: Abstraction has 1345 states and 1968 transitions. [2022-02-20 18:27:02,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:02,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1968 transitions. [2022-02-20 18:27:02,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 18:27:02,607 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:02,607 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:27:02,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:27:02,607 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:02,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:02,608 INFO L85 PathProgramCache]: Analyzing trace with hash 278098778, now seen corresponding path program 1 times [2022-02-20 18:27:02,608 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:02,608 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747430848] [2022-02-20 18:27:02,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:02,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:02,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {14825#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; {14825#true} is VALID [2022-02-20 18:27:02,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {14825#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_#t~post27#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {14825#true} is VALID [2022-02-20 18:27:02,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {14825#true} assume 0 == ~r1~0; {14825#true} is VALID [2022-02-20 18:27:02,748 INFO L290 TraceCheckUtils]: 3: Hoare triple {14825#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {14825#true} is VALID [2022-02-20 18:27:02,748 INFO L290 TraceCheckUtils]: 4: Hoare triple {14825#true} assume ~id1~0 >= 0; {14825#true} is VALID [2022-02-20 18:27:02,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {14825#true} assume 0 == ~st1~0; {14825#true} is VALID [2022-02-20 18:27:02,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {14825#true} assume ~send1~0 == ~id1~0; {14825#true} is VALID [2022-02-20 18:27:02,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {14825#true} assume 0 == ~mode1~0 % 256; {14825#true} is VALID [2022-02-20 18:27:02,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {14825#true} assume ~id2~0 >= 0; {14825#true} is VALID [2022-02-20 18:27:02,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {14825#true} assume 0 == ~st2~0; {14825#true} is VALID [2022-02-20 18:27:02,748 INFO L290 TraceCheckUtils]: 10: Hoare triple {14825#true} assume ~send2~0 == ~id2~0; {14825#true} is VALID [2022-02-20 18:27:02,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {14825#true} assume 0 == ~mode2~0 % 256; {14825#true} is VALID [2022-02-20 18:27:02,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {14825#true} assume ~id3~0 >= 0; {14825#true} is VALID [2022-02-20 18:27:02,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {14825#true} assume 0 == ~st3~0; {14825#true} is VALID [2022-02-20 18:27:02,749 INFO L290 TraceCheckUtils]: 14: Hoare triple {14825#true} assume ~send3~0 == ~id3~0; {14825#true} is VALID [2022-02-20 18:27:02,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {14825#true} assume 0 == ~mode3~0 % 256; {14825#true} is VALID [2022-02-20 18:27:02,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {14825#true} assume ~id1~0 != ~id2~0; {14825#true} is VALID [2022-02-20 18:27:02,749 INFO L290 TraceCheckUtils]: 17: Hoare triple {14825#true} assume ~id1~0 != ~id3~0; {14825#true} is VALID [2022-02-20 18:27:02,751 INFO L290 TraceCheckUtils]: 18: Hoare triple {14825#true} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {14827#(= |ULTIMATE.start_init_~tmp~0#1| 1)} is VALID [2022-02-20 18:27:02,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {14827#(= |ULTIMATE.start_init_~tmp~0#1| 1)} init_#res#1 := init_~tmp~0#1; {14828#(= |ULTIMATE.start_init_#res#1| 1)} is VALID [2022-02-20 18:27:02,752 INFO L290 TraceCheckUtils]: 20: Hoare triple {14828#(= |ULTIMATE.start_init_#res#1| 1)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {14829#(= |ULTIMATE.start_main_~i2~0#1| 1)} is VALID [2022-02-20 18:27:02,752 INFO L290 TraceCheckUtils]: 21: Hoare triple {14829#(= |ULTIMATE.start_main_~i2~0#1| 1)} assume !(0 == main_~i2~0#1); {14825#true} is VALID [2022-02-20 18:27:02,752 INFO L290 TraceCheckUtils]: 22: Hoare triple {14825#true} ~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_~i2~0#1 := 0; {14825#true} is VALID [2022-02-20 18:27:02,752 INFO L290 TraceCheckUtils]: 23: Hoare triple {14825#true} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {14825#true} is VALID [2022-02-20 18:27:02,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {14825#true} assume !(0 != ~mode1~0 % 256); {14825#true} is VALID [2022-02-20 18:27:02,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {14825#true} assume !(0 != ~alive1~0 % 256); {14825#true} is VALID [2022-02-20 18:27:02,753 INFO L290 TraceCheckUtils]: 26: Hoare triple {14825#true} ~mode1~0 := 1; {14825#true} is VALID [2022-02-20 18:27:02,753 INFO L290 TraceCheckUtils]: 27: Hoare triple {14825#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {14825#true} is VALID [2022-02-20 18:27:02,753 INFO L290 TraceCheckUtils]: 28: Hoare triple {14825#true} assume !(0 != ~mode2~0 % 256); {14825#true} is VALID [2022-02-20 18:27:02,753 INFO L290 TraceCheckUtils]: 29: Hoare triple {14825#true} assume !(0 != ~alive2~0 % 256); {14825#true} is VALID [2022-02-20 18:27:02,753 INFO L290 TraceCheckUtils]: 30: Hoare triple {14825#true} assume !(~send2~0 != ~id2~0); {14825#true} is VALID [2022-02-20 18:27:02,753 INFO L290 TraceCheckUtils]: 31: Hoare triple {14825#true} ~mode2~0 := 1; {14825#true} is VALID [2022-02-20 18:27:02,754 INFO L290 TraceCheckUtils]: 32: Hoare triple {14825#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {14825#true} is VALID [2022-02-20 18:27:02,754 INFO L290 TraceCheckUtils]: 33: Hoare triple {14825#true} assume !(0 != ~mode3~0 % 256); {14825#true} is VALID [2022-02-20 18:27:02,754 INFO L290 TraceCheckUtils]: 34: Hoare triple {14825#true} assume 0 != ~alive3~0 % 256; {14825#true} is VALID [2022-02-20 18:27:02,754 INFO L290 TraceCheckUtils]: 35: Hoare triple {14825#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {14825#true} is VALID [2022-02-20 18:27:02,754 INFO L290 TraceCheckUtils]: 36: Hoare triple {14825#true} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1; {14825#true} is VALID [2022-02-20 18:27:02,754 INFO L290 TraceCheckUtils]: 37: Hoare triple {14825#true} ~mode3~0 := 1; {14825#true} is VALID [2022-02-20 18:27:02,755 INFO L290 TraceCheckUtils]: 38: Hoare triple {14825#true} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {14825#true} is VALID [2022-02-20 18:27:02,755 INFO L290 TraceCheckUtils]: 39: Hoare triple {14825#true} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {14825#true} is VALID [2022-02-20 18:27:02,755 INFO L290 TraceCheckUtils]: 40: Hoare triple {14825#true} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {14830#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} is VALID [2022-02-20 18:27:02,756 INFO L290 TraceCheckUtils]: 41: Hoare triple {14830#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} check_#res#1 := check_~tmp~1#1; {14831#(not (= 0 |ULTIMATE.start_check_#res#1|))} is VALID [2022-02-20 18:27:02,756 INFO L290 TraceCheckUtils]: 42: Hoare triple {14831#(not (= 0 |ULTIMATE.start_check_#res#1|))} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {14832#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} is VALID [2022-02-20 18:27:02,757 INFO L290 TraceCheckUtils]: 43: Hoare triple {14832#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} assume 0 == assert_~arg#1 % 256; {14826#false} is VALID [2022-02-20 18:27:02,757 INFO L290 TraceCheckUtils]: 44: Hoare triple {14826#false} assume !false; {14826#false} is VALID [2022-02-20 18:27:02,759 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:27:02,759 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:02,759 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747430848] [2022-02-20 18:27:02,759 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747430848] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:02,760 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:02,760 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:27:02,760 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690297986] [2022-02-20 18:27:02,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:02,761 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2022-02-20 18:27:02,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:02,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:02,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:02,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:27:02,793 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:02,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:27:02,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:27:02,794 INFO L87 Difference]: Start difference. First operand 1345 states and 1968 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:05,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:05,159 INFO L93 Difference]: Finished difference Result 2859 states and 4105 transitions. [2022-02-20 18:27:05,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 18:27:05,159 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2022-02-20 18:27:05,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:05,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:05,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions. [2022-02-20 18:27:05,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:05,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions. [2022-02-20 18:27:05,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 181 transitions. [2022-02-20 18:27:05,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:05,631 INFO L225 Difference]: With dead ends: 2859 [2022-02-20 18:27:05,631 INFO L226 Difference]: Without dead ends: 2857 [2022-02-20 18:27:05,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2022-02-20 18:27:05,633 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 444 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:27:05,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [444 Valid, 581 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:05,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states. [2022-02-20 18:27:06,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 1489. [2022-02-20 18:27:06,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:06,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2857 states. Second operand has 1489 states, 1488 states have (on average 1.4193548387096775) internal successors, (2112), 1488 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:06,511 INFO L74 IsIncluded]: Start isIncluded. First operand 2857 states. Second operand has 1489 states, 1488 states have (on average 1.4193548387096775) internal successors, (2112), 1488 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:06,513 INFO L87 Difference]: Start difference. First operand 2857 states. Second operand has 1489 states, 1488 states have (on average 1.4193548387096775) internal successors, (2112), 1488 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:06,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:06,741 INFO L93 Difference]: Finished difference Result 2857 states and 4056 transitions. [2022-02-20 18:27:06,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2857 states and 4056 transitions. [2022-02-20 18:27:06,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:06,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:06,749 INFO L74 IsIncluded]: Start isIncluded. First operand has 1489 states, 1488 states have (on average 1.4193548387096775) internal successors, (2112), 1488 states have internal predecessors, (2112), 0 states have call successors, (0), 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 2857 states. [2022-02-20 18:27:06,751 INFO L87 Difference]: Start difference. First operand has 1489 states, 1488 states have (on average 1.4193548387096775) internal successors, (2112), 1488 states have internal predecessors, (2112), 0 states have call successors, (0), 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 2857 states. [2022-02-20 18:27:06,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:06,988 INFO L93 Difference]: Finished difference Result 2857 states and 4056 transitions. [2022-02-20 18:27:06,988 INFO L276 IsEmpty]: Start isEmpty. Operand 2857 states and 4056 transitions. [2022-02-20 18:27:06,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:06,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:06,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:06,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:07,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1489 states, 1488 states have (on average 1.4193548387096775) internal successors, (2112), 1488 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:07,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 2112 transitions. [2022-02-20 18:27:07,132 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 2112 transitions. Word has length 45 [2022-02-20 18:27:07,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:07,132 INFO L470 AbstractCegarLoop]: Abstraction has 1489 states and 2112 transitions. [2022-02-20 18:27:07,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:07,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 2112 transitions. [2022-02-20 18:27:07,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 18:27:07,133 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:07,134 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:27:07,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:27:07,134 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:07,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:07,135 INFO L85 PathProgramCache]: Analyzing trace with hash 83706006, now seen corresponding path program 1 times [2022-02-20 18:27:07,135 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:07,135 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095873759] [2022-02-20 18:27:07,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:07,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:07,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:07,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {25781#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; {25781#true} is VALID [2022-02-20 18:27:07,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {25781#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_#t~post27#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {25781#true} is VALID [2022-02-20 18:27:07,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {25781#true} assume 0 == ~r1~0; {25783#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:07,177 INFO L290 TraceCheckUtils]: 3: Hoare triple {25783#(<= ~r1~0 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {25783#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:07,178 INFO L290 TraceCheckUtils]: 4: Hoare triple {25783#(<= ~r1~0 0)} assume ~id1~0 >= 0; {25783#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:07,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {25783#(<= ~r1~0 0)} assume 0 == ~st1~0; {25783#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:07,178 INFO L290 TraceCheckUtils]: 6: Hoare triple {25783#(<= ~r1~0 0)} assume ~send1~0 == ~id1~0; {25783#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:07,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {25783#(<= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {25783#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:07,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {25783#(<= ~r1~0 0)} assume ~id2~0 >= 0; {25783#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:07,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {25783#(<= ~r1~0 0)} assume 0 == ~st2~0; {25783#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:07,180 INFO L290 TraceCheckUtils]: 10: Hoare triple {25783#(<= ~r1~0 0)} assume ~send2~0 == ~id2~0; {25783#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:07,180 INFO L290 TraceCheckUtils]: 11: Hoare triple {25783#(<= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {25783#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:07,180 INFO L290 TraceCheckUtils]: 12: Hoare triple {25783#(<= ~r1~0 0)} assume ~id3~0 >= 0; {25783#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:07,181 INFO L290 TraceCheckUtils]: 13: Hoare triple {25783#(<= ~r1~0 0)} assume 0 == ~st3~0; {25783#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:07,181 INFO L290 TraceCheckUtils]: 14: Hoare triple {25783#(<= ~r1~0 0)} assume ~send3~0 == ~id3~0; {25783#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:07,182 INFO L290 TraceCheckUtils]: 15: Hoare triple {25783#(<= ~r1~0 0)} assume 0 == ~mode3~0 % 256; {25783#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:07,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {25783#(<= ~r1~0 0)} assume ~id1~0 != ~id2~0; {25783#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:07,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {25783#(<= ~r1~0 0)} assume ~id1~0 != ~id3~0; {25783#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:07,183 INFO L290 TraceCheckUtils]: 18: Hoare triple {25783#(<= ~r1~0 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {25783#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:07,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {25783#(<= ~r1~0 0)} init_#res#1 := init_~tmp~0#1; {25783#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:07,183 INFO L290 TraceCheckUtils]: 20: Hoare triple {25783#(<= ~r1~0 0)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {25783#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:07,184 INFO L290 TraceCheckUtils]: 21: Hoare triple {25783#(<= ~r1~0 0)} assume !(0 == main_~i2~0#1); {25783#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:07,184 INFO L290 TraceCheckUtils]: 22: Hoare triple {25783#(<= ~r1~0 0)} ~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_~i2~0#1 := 0; {25783#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:07,184 INFO L290 TraceCheckUtils]: 23: Hoare triple {25783#(<= ~r1~0 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {25783#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:07,185 INFO L290 TraceCheckUtils]: 24: Hoare triple {25783#(<= ~r1~0 0)} assume !(0 != ~mode1~0 % 256); {25783#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:07,185 INFO L290 TraceCheckUtils]: 25: Hoare triple {25783#(<= ~r1~0 0)} assume !(0 != ~alive1~0 % 256); {25783#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:07,185 INFO L290 TraceCheckUtils]: 26: Hoare triple {25783#(<= ~r1~0 0)} ~mode1~0 := 1; {25783#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:07,186 INFO L290 TraceCheckUtils]: 27: Hoare triple {25783#(<= ~r1~0 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {25783#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:07,186 INFO L290 TraceCheckUtils]: 28: Hoare triple {25783#(<= ~r1~0 0)} assume !(0 != ~mode2~0 % 256); {25783#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:07,186 INFO L290 TraceCheckUtils]: 29: Hoare triple {25783#(<= ~r1~0 0)} assume !(0 != ~alive2~0 % 256); {25783#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:07,187 INFO L290 TraceCheckUtils]: 30: Hoare triple {25783#(<= ~r1~0 0)} assume !(~send2~0 != ~id2~0); {25783#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:07,187 INFO L290 TraceCheckUtils]: 31: Hoare triple {25783#(<= ~r1~0 0)} ~mode2~0 := 1; {25783#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:07,187 INFO L290 TraceCheckUtils]: 32: Hoare triple {25783#(<= ~r1~0 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {25783#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:07,188 INFO L290 TraceCheckUtils]: 33: Hoare triple {25783#(<= ~r1~0 0)} assume !(0 != ~mode3~0 % 256); {25783#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:07,188 INFO L290 TraceCheckUtils]: 34: Hoare triple {25783#(<= ~r1~0 0)} assume 0 != ~alive3~0 % 256; {25783#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:07,188 INFO L290 TraceCheckUtils]: 35: Hoare triple {25783#(<= ~r1~0 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {25783#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:07,189 INFO L290 TraceCheckUtils]: 36: Hoare triple {25783#(<= ~r1~0 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1; {25783#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:07,189 INFO L290 TraceCheckUtils]: 37: Hoare triple {25783#(<= ~r1~0 0)} ~mode3~0 := 1; {25783#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:07,189 INFO L290 TraceCheckUtils]: 38: Hoare triple {25783#(<= ~r1~0 0)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {25783#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:07,190 INFO L290 TraceCheckUtils]: 39: Hoare triple {25783#(<= ~r1~0 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {25783#(<= ~r1~0 0)} is VALID [2022-02-20 18:27:07,190 INFO L290 TraceCheckUtils]: 40: Hoare triple {25783#(<= ~r1~0 0)} assume !(~r1~0 < 3); {25782#false} is VALID [2022-02-20 18:27:07,191 INFO L290 TraceCheckUtils]: 41: Hoare triple {25782#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0);check_~tmp~1#1 := 0; {25782#false} is VALID [2022-02-20 18:27:07,191 INFO L290 TraceCheckUtils]: 42: Hoare triple {25782#false} check_#res#1 := check_~tmp~1#1; {25782#false} is VALID [2022-02-20 18:27:07,191 INFO L290 TraceCheckUtils]: 43: Hoare triple {25782#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {25782#false} is VALID [2022-02-20 18:27:07,191 INFO L290 TraceCheckUtils]: 44: Hoare triple {25782#false} assume 0 == assert_~arg#1 % 256; {25782#false} is VALID [2022-02-20 18:27:07,191 INFO L290 TraceCheckUtils]: 45: Hoare triple {25782#false} assume !false; {25782#false} is VALID [2022-02-20 18:27:07,192 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:27:07,192 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:07,192 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095873759] [2022-02-20 18:27:07,192 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095873759] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:07,192 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:07,192 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:27:07,192 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064641896] [2022-02-20 18:27:07,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:07,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2022-02-20 18:27:07,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:07,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:07,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:07,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:27:07,224 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:07,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:27:07,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:27:07,225 INFO L87 Difference]: Start difference. First operand 1489 states and 2112 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:08,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:08,808 INFO L93 Difference]: Finished difference Result 3507 states and 4980 transitions. [2022-02-20 18:27:08,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:27:08,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2022-02-20 18:27:08,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:08,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:08,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 243 transitions. [2022-02-20 18:27:08,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:08,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 243 transitions. [2022-02-20 18:27:08,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 243 transitions. [2022-02-20 18:27:08,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:09,137 INFO L225 Difference]: With dead ends: 3507 [2022-02-20 18:27:09,137 INFO L226 Difference]: Without dead ends: 2041 [2022-02-20 18:27:09,138 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:27:09,140 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 47 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:27:09,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 174 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:09,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2041 states. [2022-02-20 18:27:10,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2041 to 2039. [2022-02-20 18:27:10,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:10,282 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2041 states. Second operand has 2039 states, 2038 states have (on average 1.408243375858685) internal successors, (2870), 2038 states have internal predecessors, (2870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:10,283 INFO L74 IsIncluded]: Start isIncluded. First operand 2041 states. Second operand has 2039 states, 2038 states have (on average 1.408243375858685) internal successors, (2870), 2038 states have internal predecessors, (2870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:10,285 INFO L87 Difference]: Start difference. First operand 2041 states. Second operand has 2039 states, 2038 states have (on average 1.408243375858685) internal successors, (2870), 2038 states have internal predecessors, (2870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:10,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:10,411 INFO L93 Difference]: Finished difference Result 2041 states and 2871 transitions. [2022-02-20 18:27:10,411 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 2871 transitions. [2022-02-20 18:27:10,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:10,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:10,417 INFO L74 IsIncluded]: Start isIncluded. First operand has 2039 states, 2038 states have (on average 1.408243375858685) internal successors, (2870), 2038 states have internal predecessors, (2870), 0 states have call successors, (0), 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 2041 states. [2022-02-20 18:27:10,419 INFO L87 Difference]: Start difference. First operand has 2039 states, 2038 states have (on average 1.408243375858685) internal successors, (2870), 2038 states have internal predecessors, (2870), 0 states have call successors, (0), 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 2041 states. [2022-02-20 18:27:10,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:10,554 INFO L93 Difference]: Finished difference Result 2041 states and 2871 transitions. [2022-02-20 18:27:10,554 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 2871 transitions. [2022-02-20 18:27:10,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:10,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:10,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:10,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:10,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2039 states, 2038 states have (on average 1.408243375858685) internal successors, (2870), 2038 states have internal predecessors, (2870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:10,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 2870 transitions. [2022-02-20 18:27:10,704 INFO L78 Accepts]: Start accepts. Automaton has 2039 states and 2870 transitions. Word has length 46 [2022-02-20 18:27:10,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:10,705 INFO L470 AbstractCegarLoop]: Abstraction has 2039 states and 2870 transitions. [2022-02-20 18:27:10,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:10,705 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 2870 transitions. [2022-02-20 18:27:10,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:27:10,707 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:10,707 INFO L514 BasicCegarLoop]: trace histogram [2, 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, 1, 1] [2022-02-20 18:27:10,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:27:10,707 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:10,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:10,708 INFO L85 PathProgramCache]: Analyzing trace with hash -500810539, now seen corresponding path program 1 times [2022-02-20 18:27:10,708 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:10,708 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101976884] [2022-02-20 18:27:10,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:10,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:10,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {36498#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; {36498#true} is VALID [2022-02-20 18:27:10,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {36498#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_#t~post27#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {36498#true} is VALID [2022-02-20 18:27:10,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {36498#true} assume 0 == ~r1~0; {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,802 INFO L290 TraceCheckUtils]: 3: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,802 INFO L290 TraceCheckUtils]: 4: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id1~0 >= 0; {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~st1~0; {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~send1~0 == ~id1~0; {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~mode1~0 % 256; {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id2~0 >= 0; {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~st2~0; {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~send2~0 == ~id2~0; {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,810 INFO L290 TraceCheckUtils]: 11: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~mode2~0 % 256; {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,810 INFO L290 TraceCheckUtils]: 12: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id3~0 >= 0; {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~st3~0; {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~send3~0 == ~id3~0; {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~mode3~0 % 256; {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id1~0 != ~id2~0; {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id1~0 != ~id3~0; {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,813 INFO L290 TraceCheckUtils]: 18: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,814 INFO L290 TraceCheckUtils]: 19: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} init_#res#1 := init_~tmp~0#1; {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,814 INFO L290 TraceCheckUtils]: 20: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,814 INFO L290 TraceCheckUtils]: 21: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(0 == main_~i2~0#1); {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} ~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_~i2~0#1 := 0; {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,815 INFO L290 TraceCheckUtils]: 23: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,816 INFO L290 TraceCheckUtils]: 24: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(0 != ~mode1~0 % 256); {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,816 INFO L290 TraceCheckUtils]: 25: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(0 != ~alive1~0 % 256); {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,817 INFO L290 TraceCheckUtils]: 26: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} ~mode1~0 := 1; {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,817 INFO L290 TraceCheckUtils]: 27: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,818 INFO L290 TraceCheckUtils]: 28: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(0 != ~mode2~0 % 256); {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,818 INFO L290 TraceCheckUtils]: 29: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(0 != ~alive2~0 % 256); {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,819 INFO L290 TraceCheckUtils]: 30: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(~send2~0 != ~id2~0); {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,819 INFO L290 TraceCheckUtils]: 31: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} ~mode2~0 := 1; {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,819 INFO L290 TraceCheckUtils]: 32: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,820 INFO L290 TraceCheckUtils]: 33: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(0 != ~mode3~0 % 256); {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,820 INFO L290 TraceCheckUtils]: 34: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 != ~alive3~0 % 256; {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,821 INFO L290 TraceCheckUtils]: 35: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,822 INFO L290 TraceCheckUtils]: 36: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1; {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,822 INFO L290 TraceCheckUtils]: 37: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} ~mode3~0 := 1; {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,823 INFO L290 TraceCheckUtils]: 38: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,823 INFO L290 TraceCheckUtils]: 39: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,824 INFO L290 TraceCheckUtils]: 40: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,825 INFO L290 TraceCheckUtils]: 41: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} check_#res#1 := check_~tmp~1#1; {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,832 INFO L290 TraceCheckUtils]: 42: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,834 INFO L290 TraceCheckUtils]: 43: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(0 == assert_~arg#1 % 256); {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,835 INFO L290 TraceCheckUtils]: 44: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume { :end_inline_assert } true;main_#t~post27#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,836 INFO L290 TraceCheckUtils]: 45: Hoare triple {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {36500#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:27:10,837 INFO L290 TraceCheckUtils]: 46: Hoare triple {36500#(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);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {36501#(<= ~r1~0 1)} is VALID [2022-02-20 18:27:10,838 INFO L290 TraceCheckUtils]: 47: Hoare triple {36501#(<= ~r1~0 1)} assume !(node1_~m1~0#1 != ~nomsg~0); {36501#(<= ~r1~0 1)} is VALID [2022-02-20 18:27:10,838 INFO L290 TraceCheckUtils]: 48: Hoare triple {36501#(<= ~r1~0 1)} ~mode1~0 := 0; {36501#(<= ~r1~0 1)} is VALID [2022-02-20 18:27:10,839 INFO L290 TraceCheckUtils]: 49: Hoare triple {36501#(<= ~r1~0 1)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {36501#(<= ~r1~0 1)} is VALID [2022-02-20 18:27:10,840 INFO L290 TraceCheckUtils]: 50: Hoare triple {36501#(<= ~r1~0 1)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {36501#(<= ~r1~0 1)} is VALID [2022-02-20 18:27:10,844 INFO L290 TraceCheckUtils]: 51: Hoare triple {36501#(<= ~r1~0 1)} assume !(node2_~m2~0#1 != ~nomsg~0); {36501#(<= ~r1~0 1)} is VALID [2022-02-20 18:27:10,844 INFO L290 TraceCheckUtils]: 52: Hoare triple {36501#(<= ~r1~0 1)} ~mode2~0 := 0; {36501#(<= ~r1~0 1)} is VALID [2022-02-20 18:27:10,847 INFO L290 TraceCheckUtils]: 53: Hoare triple {36501#(<= ~r1~0 1)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {36501#(<= ~r1~0 1)} is VALID [2022-02-20 18:27:10,848 INFO L290 TraceCheckUtils]: 54: Hoare triple {36501#(<= ~r1~0 1)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {36501#(<= ~r1~0 1)} is VALID [2022-02-20 18:27:10,849 INFO L290 TraceCheckUtils]: 55: Hoare triple {36501#(<= ~r1~0 1)} assume !(node3_~m3~0#1 != ~nomsg~0); {36501#(<= ~r1~0 1)} is VALID [2022-02-20 18:27:10,849 INFO L290 TraceCheckUtils]: 56: Hoare triple {36501#(<= ~r1~0 1)} ~mode3~0 := 0; {36501#(<= ~r1~0 1)} is VALID [2022-02-20 18:27:10,849 INFO L290 TraceCheckUtils]: 57: Hoare triple {36501#(<= ~r1~0 1)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {36501#(<= ~r1~0 1)} is VALID [2022-02-20 18:27:10,850 INFO L290 TraceCheckUtils]: 58: Hoare triple {36501#(<= ~r1~0 1)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {36501#(<= ~r1~0 1)} is VALID [2022-02-20 18:27:10,850 INFO L290 TraceCheckUtils]: 59: Hoare triple {36501#(<= ~r1~0 1)} assume !(~r1~0 < 3); {36499#false} is VALID [2022-02-20 18:27:10,850 INFO L290 TraceCheckUtils]: 60: Hoare triple {36499#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0);check_~tmp~1#1 := 0; {36499#false} is VALID [2022-02-20 18:27:10,850 INFO L290 TraceCheckUtils]: 61: Hoare triple {36499#false} check_#res#1 := check_~tmp~1#1; {36499#false} is VALID [2022-02-20 18:27:10,851 INFO L290 TraceCheckUtils]: 62: Hoare triple {36499#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {36499#false} is VALID [2022-02-20 18:27:10,851 INFO L290 TraceCheckUtils]: 63: Hoare triple {36499#false} assume 0 == assert_~arg#1 % 256; {36499#false} is VALID [2022-02-20 18:27:10,851 INFO L290 TraceCheckUtils]: 64: Hoare triple {36499#false} assume !false; {36499#false} is VALID [2022-02-20 18:27:10,855 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:27:10,856 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:10,856 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101976884] [2022-02-20 18:27:10,856 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101976884] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:27:10,856 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366593714] [2022-02-20 18:27:10,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:10,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:27:10,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:27:10,858 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:27:10,862 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:27:10,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:10,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 18:27:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:10,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:27:11,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {36498#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; {36498#true} is VALID [2022-02-20 18:27:11,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {36498#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_#t~post27#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {36498#true} is VALID [2022-02-20 18:27:11,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {36498#true} assume 0 == ~r1~0; {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,370 INFO L290 TraceCheckUtils]: 3: Hoare triple {36511#(= ~r1~0 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,370 INFO L290 TraceCheckUtils]: 4: Hoare triple {36511#(= ~r1~0 0)} assume ~id1~0 >= 0; {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {36511#(= ~r1~0 0)} assume 0 == ~st1~0; {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,371 INFO L290 TraceCheckUtils]: 6: Hoare triple {36511#(= ~r1~0 0)} assume ~send1~0 == ~id1~0; {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {36511#(= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {36511#(= ~r1~0 0)} assume ~id2~0 >= 0; {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {36511#(= ~r1~0 0)} assume 0 == ~st2~0; {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,372 INFO L290 TraceCheckUtils]: 10: Hoare triple {36511#(= ~r1~0 0)} assume ~send2~0 == ~id2~0; {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,373 INFO L290 TraceCheckUtils]: 11: Hoare triple {36511#(= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,373 INFO L290 TraceCheckUtils]: 12: Hoare triple {36511#(= ~r1~0 0)} assume ~id3~0 >= 0; {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {36511#(= ~r1~0 0)} assume 0 == ~st3~0; {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {36511#(= ~r1~0 0)} assume ~send3~0 == ~id3~0; {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {36511#(= ~r1~0 0)} assume 0 == ~mode3~0 % 256; {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,375 INFO L290 TraceCheckUtils]: 16: Hoare triple {36511#(= ~r1~0 0)} assume ~id1~0 != ~id2~0; {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,375 INFO L290 TraceCheckUtils]: 17: Hoare triple {36511#(= ~r1~0 0)} assume ~id1~0 != ~id3~0; {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {36511#(= ~r1~0 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {36511#(= ~r1~0 0)} init_#res#1 := init_~tmp~0#1; {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,376 INFO L290 TraceCheckUtils]: 20: Hoare triple {36511#(= ~r1~0 0)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,377 INFO L290 TraceCheckUtils]: 21: Hoare triple {36511#(= ~r1~0 0)} assume !(0 == main_~i2~0#1); {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,377 INFO L290 TraceCheckUtils]: 22: Hoare triple {36511#(= ~r1~0 0)} ~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_~i2~0#1 := 0; {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,378 INFO L290 TraceCheckUtils]: 23: Hoare triple {36511#(= ~r1~0 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,378 INFO L290 TraceCheckUtils]: 24: Hoare triple {36511#(= ~r1~0 0)} assume !(0 != ~mode1~0 % 256); {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,378 INFO L290 TraceCheckUtils]: 25: Hoare triple {36511#(= ~r1~0 0)} assume !(0 != ~alive1~0 % 256); {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,379 INFO L290 TraceCheckUtils]: 26: Hoare triple {36511#(= ~r1~0 0)} ~mode1~0 := 1; {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,379 INFO L290 TraceCheckUtils]: 27: Hoare triple {36511#(= ~r1~0 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,380 INFO L290 TraceCheckUtils]: 28: Hoare triple {36511#(= ~r1~0 0)} assume !(0 != ~mode2~0 % 256); {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,380 INFO L290 TraceCheckUtils]: 29: Hoare triple {36511#(= ~r1~0 0)} assume !(0 != ~alive2~0 % 256); {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,380 INFO L290 TraceCheckUtils]: 30: Hoare triple {36511#(= ~r1~0 0)} assume !(~send2~0 != ~id2~0); {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,381 INFO L290 TraceCheckUtils]: 31: Hoare triple {36511#(= ~r1~0 0)} ~mode2~0 := 1; {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,381 INFO L290 TraceCheckUtils]: 32: Hoare triple {36511#(= ~r1~0 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,382 INFO L290 TraceCheckUtils]: 33: Hoare triple {36511#(= ~r1~0 0)} assume !(0 != ~mode3~0 % 256); {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,382 INFO L290 TraceCheckUtils]: 34: Hoare triple {36511#(= ~r1~0 0)} assume 0 != ~alive3~0 % 256; {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,382 INFO L290 TraceCheckUtils]: 35: Hoare triple {36511#(= ~r1~0 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,383 INFO L290 TraceCheckUtils]: 36: Hoare triple {36511#(= ~r1~0 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1; {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,383 INFO L290 TraceCheckUtils]: 37: Hoare triple {36511#(= ~r1~0 0)} ~mode3~0 := 1; {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,384 INFO L290 TraceCheckUtils]: 38: Hoare triple {36511#(= ~r1~0 0)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,384 INFO L290 TraceCheckUtils]: 39: Hoare triple {36511#(= ~r1~0 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,384 INFO L290 TraceCheckUtils]: 40: Hoare triple {36511#(= ~r1~0 0)} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {36626#(and (<= 1 |ULTIMATE.start_check_~tmp~1#1|) (= ~r1~0 0))} is VALID [2022-02-20 18:27:11,385 INFO L290 TraceCheckUtils]: 41: Hoare triple {36626#(and (<= 1 |ULTIMATE.start_check_~tmp~1#1|) (= ~r1~0 0))} check_#res#1 := check_~tmp~1#1; {36630#(and (<= 1 |ULTIMATE.start_check_#res#1|) (= ~r1~0 0))} is VALID [2022-02-20 18:27:11,385 INFO L290 TraceCheckUtils]: 42: Hoare triple {36630#(and (<= 1 |ULTIMATE.start_check_#res#1|) (= ~r1~0 0))} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,386 INFO L290 TraceCheckUtils]: 43: Hoare triple {36511#(= ~r1~0 0)} assume !(0 == assert_~arg#1 % 256); {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,386 INFO L290 TraceCheckUtils]: 44: Hoare triple {36511#(= ~r1~0 0)} assume { :end_inline_assert } true;main_#t~post27#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,387 INFO L290 TraceCheckUtils]: 45: Hoare triple {36511#(= ~r1~0 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {36511#(= ~r1~0 0)} is VALID [2022-02-20 18:27:11,387 INFO L290 TraceCheckUtils]: 46: Hoare triple {36511#(= ~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);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {36501#(<= ~r1~0 1)} is VALID [2022-02-20 18:27:11,388 INFO L290 TraceCheckUtils]: 47: Hoare triple {36501#(<= ~r1~0 1)} assume !(node1_~m1~0#1 != ~nomsg~0); {36501#(<= ~r1~0 1)} is VALID [2022-02-20 18:27:11,388 INFO L290 TraceCheckUtils]: 48: Hoare triple {36501#(<= ~r1~0 1)} ~mode1~0 := 0; {36501#(<= ~r1~0 1)} is VALID [2022-02-20 18:27:11,388 INFO L290 TraceCheckUtils]: 49: Hoare triple {36501#(<= ~r1~0 1)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {36501#(<= ~r1~0 1)} is VALID [2022-02-20 18:27:11,389 INFO L290 TraceCheckUtils]: 50: Hoare triple {36501#(<= ~r1~0 1)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {36501#(<= ~r1~0 1)} is VALID [2022-02-20 18:27:11,389 INFO L290 TraceCheckUtils]: 51: Hoare triple {36501#(<= ~r1~0 1)} assume !(node2_~m2~0#1 != ~nomsg~0); {36501#(<= ~r1~0 1)} is VALID [2022-02-20 18:27:11,390 INFO L290 TraceCheckUtils]: 52: Hoare triple {36501#(<= ~r1~0 1)} ~mode2~0 := 0; {36501#(<= ~r1~0 1)} is VALID [2022-02-20 18:27:11,390 INFO L290 TraceCheckUtils]: 53: Hoare triple {36501#(<= ~r1~0 1)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {36501#(<= ~r1~0 1)} is VALID [2022-02-20 18:27:11,390 INFO L290 TraceCheckUtils]: 54: Hoare triple {36501#(<= ~r1~0 1)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {36501#(<= ~r1~0 1)} is VALID [2022-02-20 18:27:11,391 INFO L290 TraceCheckUtils]: 55: Hoare triple {36501#(<= ~r1~0 1)} assume !(node3_~m3~0#1 != ~nomsg~0); {36501#(<= ~r1~0 1)} is VALID [2022-02-20 18:27:11,391 INFO L290 TraceCheckUtils]: 56: Hoare triple {36501#(<= ~r1~0 1)} ~mode3~0 := 0; {36501#(<= ~r1~0 1)} is VALID [2022-02-20 18:27:11,391 INFO L290 TraceCheckUtils]: 57: Hoare triple {36501#(<= ~r1~0 1)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {36501#(<= ~r1~0 1)} is VALID [2022-02-20 18:27:11,392 INFO L290 TraceCheckUtils]: 58: Hoare triple {36501#(<= ~r1~0 1)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {36501#(<= ~r1~0 1)} is VALID [2022-02-20 18:27:11,392 INFO L290 TraceCheckUtils]: 59: Hoare triple {36501#(<= ~r1~0 1)} assume !(~r1~0 < 3); {36499#false} is VALID [2022-02-20 18:27:11,392 INFO L290 TraceCheckUtils]: 60: Hoare triple {36499#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0);check_~tmp~1#1 := 0; {36499#false} is VALID [2022-02-20 18:27:11,393 INFO L290 TraceCheckUtils]: 61: Hoare triple {36499#false} check_#res#1 := check_~tmp~1#1; {36499#false} is VALID [2022-02-20 18:27:11,393 INFO L290 TraceCheckUtils]: 62: Hoare triple {36499#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {36499#false} is VALID [2022-02-20 18:27:11,393 INFO L290 TraceCheckUtils]: 63: Hoare triple {36499#false} assume 0 == assert_~arg#1 % 256; {36499#false} is VALID [2022-02-20 18:27:11,393 INFO L290 TraceCheckUtils]: 64: Hoare triple {36499#false} assume !false; {36499#false} is VALID [2022-02-20 18:27:11,394 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:27:11,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:27:12,078 INFO L290 TraceCheckUtils]: 64: Hoare triple {36499#false} assume !false; {36499#false} is VALID [2022-02-20 18:27:12,079 INFO L290 TraceCheckUtils]: 63: Hoare triple {36499#false} assume 0 == assert_~arg#1 % 256; {36499#false} is VALID [2022-02-20 18:27:12,079 INFO L290 TraceCheckUtils]: 62: Hoare triple {36499#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {36499#false} is VALID [2022-02-20 18:27:12,079 INFO L290 TraceCheckUtils]: 61: Hoare triple {36499#false} check_#res#1 := check_~tmp~1#1; {36499#false} is VALID [2022-02-20 18:27:12,079 INFO L290 TraceCheckUtils]: 60: Hoare triple {36499#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0);check_~tmp~1#1 := 0; {36499#false} is VALID [2022-02-20 18:27:12,079 INFO L290 TraceCheckUtils]: 59: Hoare triple {36715#(< ~r1~0 3)} assume !(~r1~0 < 3); {36499#false} is VALID [2022-02-20 18:27:12,080 INFO L290 TraceCheckUtils]: 58: Hoare triple {36715#(< ~r1~0 3)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {36715#(< ~r1~0 3)} is VALID [2022-02-20 18:27:12,080 INFO L290 TraceCheckUtils]: 57: Hoare triple {36715#(< ~r1~0 3)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {36715#(< ~r1~0 3)} is VALID [2022-02-20 18:27:12,081 INFO L290 TraceCheckUtils]: 56: Hoare triple {36715#(< ~r1~0 3)} ~mode3~0 := 0; {36715#(< ~r1~0 3)} is VALID [2022-02-20 18:27:12,081 INFO L290 TraceCheckUtils]: 55: Hoare triple {36715#(< ~r1~0 3)} assume !(node3_~m3~0#1 != ~nomsg~0); {36715#(< ~r1~0 3)} is VALID [2022-02-20 18:27:12,081 INFO L290 TraceCheckUtils]: 54: Hoare triple {36715#(< ~r1~0 3)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {36715#(< ~r1~0 3)} is VALID [2022-02-20 18:27:12,081 INFO L290 TraceCheckUtils]: 53: Hoare triple {36715#(< ~r1~0 3)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {36715#(< ~r1~0 3)} is VALID [2022-02-20 18:27:12,082 INFO L290 TraceCheckUtils]: 52: Hoare triple {36715#(< ~r1~0 3)} ~mode2~0 := 0; {36715#(< ~r1~0 3)} is VALID [2022-02-20 18:27:12,082 INFO L290 TraceCheckUtils]: 51: Hoare triple {36715#(< ~r1~0 3)} assume !(node2_~m2~0#1 != ~nomsg~0); {36715#(< ~r1~0 3)} is VALID [2022-02-20 18:27:12,082 INFO L290 TraceCheckUtils]: 50: Hoare triple {36715#(< ~r1~0 3)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {36715#(< ~r1~0 3)} is VALID [2022-02-20 18:27:12,083 INFO L290 TraceCheckUtils]: 49: Hoare triple {36715#(< ~r1~0 3)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {36715#(< ~r1~0 3)} is VALID [2022-02-20 18:27:12,083 INFO L290 TraceCheckUtils]: 48: Hoare triple {36715#(< ~r1~0 3)} ~mode1~0 := 0; {36715#(< ~r1~0 3)} is VALID [2022-02-20 18:27:12,083 INFO L290 TraceCheckUtils]: 47: Hoare triple {36715#(< ~r1~0 3)} assume !(node1_~m1~0#1 != ~nomsg~0); {36715#(< ~r1~0 3)} is VALID [2022-02-20 18:27:12,084 INFO L290 TraceCheckUtils]: 46: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (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);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {36715#(< ~r1~0 3)} is VALID [2022-02-20 18:27:12,085 INFO L290 TraceCheckUtils]: 45: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,085 INFO L290 TraceCheckUtils]: 44: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume { :end_inline_assert } true;main_#t~post27#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,086 INFO L290 TraceCheckUtils]: 43: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume !(0 == assert_~arg#1 % 256); {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,086 INFO L290 TraceCheckUtils]: 42: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,086 INFO L290 TraceCheckUtils]: 41: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} check_#res#1 := check_~tmp~1#1; {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,087 INFO L290 TraceCheckUtils]: 40: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,087 INFO L290 TraceCheckUtils]: 39: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,087 INFO L290 TraceCheckUtils]: 38: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,088 INFO L290 TraceCheckUtils]: 37: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} ~mode3~0 := 1; {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,088 INFO L290 TraceCheckUtils]: 36: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1; {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,088 INFO L290 TraceCheckUtils]: 35: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,089 INFO L290 TraceCheckUtils]: 34: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume 0 != ~alive3~0 % 256; {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,089 INFO L290 TraceCheckUtils]: 33: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume !(0 != ~mode3~0 % 256); {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,089 INFO L290 TraceCheckUtils]: 32: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,090 INFO L290 TraceCheckUtils]: 31: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} ~mode2~0 := 1; {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,090 INFO L290 TraceCheckUtils]: 30: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume !(~send2~0 != ~id2~0); {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,090 INFO L290 TraceCheckUtils]: 29: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume !(0 != ~alive2~0 % 256); {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,091 INFO L290 TraceCheckUtils]: 28: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume !(0 != ~mode2~0 % 256); {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,091 INFO L290 TraceCheckUtils]: 27: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,091 INFO L290 TraceCheckUtils]: 26: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} ~mode1~0 := 1; {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,092 INFO L290 TraceCheckUtils]: 25: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume !(0 != ~alive1~0 % 256); {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,092 INFO L290 TraceCheckUtils]: 24: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume !(0 != ~mode1~0 % 256); {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,092 INFO L290 TraceCheckUtils]: 23: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,093 INFO L290 TraceCheckUtils]: 22: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} ~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_~i2~0#1 := 0; {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,093 INFO L290 TraceCheckUtils]: 21: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume !(0 == main_~i2~0#1); {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,093 INFO L290 TraceCheckUtils]: 20: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,094 INFO L290 TraceCheckUtils]: 19: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} init_#res#1 := init_~tmp~0#1; {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,094 INFO L290 TraceCheckUtils]: 18: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,096 INFO L290 TraceCheckUtils]: 17: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~id1~0 != ~id3~0; {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,096 INFO L290 TraceCheckUtils]: 16: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~id1~0 != ~id2~0; {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,096 INFO L290 TraceCheckUtils]: 15: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume 0 == ~mode3~0 % 256; {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,097 INFO L290 TraceCheckUtils]: 14: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~send3~0 == ~id3~0; {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume 0 == ~st3~0; {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,097 INFO L290 TraceCheckUtils]: 12: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~id3~0 >= 0; {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume 0 == ~mode2~0 % 256; {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,098 INFO L290 TraceCheckUtils]: 10: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~send2~0 == ~id2~0; {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume 0 == ~st2~0; {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~id2~0 >= 0; {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume 0 == ~mode1~0 % 256; {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~send1~0 == ~id1~0; {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume 0 == ~st1~0; {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,100 INFO L290 TraceCheckUtils]: 4: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~id1~0 >= 0; {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,101 INFO L290 TraceCheckUtils]: 3: Hoare triple {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {36498#true} assume 0 == ~r1~0; {36755#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:27:12,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {36498#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_#t~post27#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {36498#true} is VALID [2022-02-20 18:27:12,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {36498#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; {36498#true} is VALID [2022-02-20 18:27:12,102 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:27:12,102 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366593714] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:27:12,103 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:27:12,103 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2022-02-20 18:27:12,103 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863991657] [2022-02-20 18:27:12,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:27:12,105 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.333333333333332) internal successors, (165), 9 states have internal predecessors, (165), 0 states have call successors, (0), 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 65 [2022-02-20 18:27:12,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:12,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 18.333333333333332) internal successors, (165), 9 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:12,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:12,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:27:12,242 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:12,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:27:12,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:27:12,243 INFO L87 Difference]: Start difference. First operand 2039 states and 2870 transitions. Second operand has 9 states, 9 states have (on average 18.333333333333332) internal successors, (165), 9 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:17,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:17,600 INFO L93 Difference]: Finished difference Result 6328 states and 9009 transitions. [2022-02-20 18:27:17,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:27:17,601 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.333333333333332) internal successors, (165), 9 states have internal predecessors, (165), 0 states have call successors, (0), 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 65 [2022-02-20 18:27:17,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:17,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 18.333333333333332) internal successors, (165), 9 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:17,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 452 transitions. [2022-02-20 18:27:17,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 18.333333333333332) internal successors, (165), 9 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:17,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 452 transitions. [2022-02-20 18:27:17,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 452 transitions. [2022-02-20 18:27:17,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 452 edges. 452 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:18,801 INFO L225 Difference]: With dead ends: 6328 [2022-02-20 18:27:18,801 INFO L226 Difference]: Without dead ends: 4862 [2022-02-20 18:27:18,803 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 121 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:27:18,803 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 429 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:27:18,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [429 Valid, 657 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:18,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4862 states. [2022-02-20 18:27:21,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4862 to 4639. [2022-02-20 18:27:21,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:21,826 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4862 states. Second operand has 4639 states, 4638 states have (on average 1.4036222509702458) internal successors, (6510), 4638 states have internal predecessors, (6510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:21,832 INFO L74 IsIncluded]: Start isIncluded. First operand 4862 states. Second operand has 4639 states, 4638 states have (on average 1.4036222509702458) internal successors, (6510), 4638 states have internal predecessors, (6510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:21,838 INFO L87 Difference]: Start difference. First operand 4862 states. Second operand has 4639 states, 4638 states have (on average 1.4036222509702458) internal successors, (6510), 4638 states have internal predecessors, (6510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:22,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:22,575 INFO L93 Difference]: Finished difference Result 4862 states and 6824 transitions. [2022-02-20 18:27:22,575 INFO L276 IsEmpty]: Start isEmpty. Operand 4862 states and 6824 transitions. [2022-02-20 18:27:22,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:22,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:22,586 INFO L74 IsIncluded]: Start isIncluded. First operand has 4639 states, 4638 states have (on average 1.4036222509702458) internal successors, (6510), 4638 states have internal predecessors, (6510), 0 states have call successors, (0), 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 4862 states. [2022-02-20 18:27:22,593 INFO L87 Difference]: Start difference. First operand has 4639 states, 4638 states have (on average 1.4036222509702458) internal successors, (6510), 4638 states have internal predecessors, (6510), 0 states have call successors, (0), 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 4862 states. [2022-02-20 18:27:23,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:23,299 INFO L93 Difference]: Finished difference Result 4862 states and 6824 transitions. [2022-02-20 18:27:23,299 INFO L276 IsEmpty]: Start isEmpty. Operand 4862 states and 6824 transitions. [2022-02-20 18:27:23,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:23,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:23,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:23,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:23,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4639 states, 4638 states have (on average 1.4036222509702458) internal successors, (6510), 4638 states have internal predecessors, (6510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:24,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4639 states to 4639 states and 6510 transitions. [2022-02-20 18:27:24,022 INFO L78 Accepts]: Start accepts. Automaton has 4639 states and 6510 transitions. Word has length 65 [2022-02-20 18:27:24,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:24,022 INFO L470 AbstractCegarLoop]: Abstraction has 4639 states and 6510 transitions. [2022-02-20 18:27:24,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.333333333333332) internal successors, (165), 9 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:24,022 INFO L276 IsEmpty]: Start isEmpty. Operand 4639 states and 6510 transitions. [2022-02-20 18:27:24,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:27:24,023 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:24,023 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2022-02-20 18:27:24,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 18:27:24,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:27:24,224 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:24,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:24,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1457272171, now seen corresponding path program 1 times [2022-02-20 18:27:24,224 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:24,224 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574736301] [2022-02-20 18:27:24,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:24,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:24,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {59720#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; {59720#true} is VALID [2022-02-20 18:27:24,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {59720#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_#t~post27#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {59720#true} is VALID [2022-02-20 18:27:24,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {59720#true} assume 0 == ~r1~0; {59720#true} is VALID [2022-02-20 18:27:24,307 INFO L290 TraceCheckUtils]: 3: Hoare triple {59720#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {59720#true} is VALID [2022-02-20 18:27:24,308 INFO L290 TraceCheckUtils]: 4: Hoare triple {59720#true} assume ~id1~0 >= 0; {59720#true} is VALID [2022-02-20 18:27:24,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {59720#true} assume 0 == ~st1~0; {59722#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:24,308 INFO L290 TraceCheckUtils]: 6: Hoare triple {59722#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {59722#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:24,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {59722#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {59722#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:24,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {59722#(<= ~st1~0 0)} assume ~id2~0 >= 0; {59722#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:24,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {59722#(<= ~st1~0 0)} assume 0 == ~st2~0; {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,310 INFO L290 TraceCheckUtils]: 11: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,311 INFO L290 TraceCheckUtils]: 16: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,312 INFO L290 TraceCheckUtils]: 17: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,312 INFO L290 TraceCheckUtils]: 18: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,312 INFO L290 TraceCheckUtils]: 19: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,313 INFO L290 TraceCheckUtils]: 20: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == main_~i2~0#1); {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,313 INFO L290 TraceCheckUtils]: 22: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} ~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_~i2~0#1 := 0; {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,314 INFO L290 TraceCheckUtils]: 23: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~alive1~0 % 256); {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,315 INFO L290 TraceCheckUtils]: 27: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,315 INFO L290 TraceCheckUtils]: 28: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~alive2~0 % 256); {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,316 INFO L290 TraceCheckUtils]: 30: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,316 INFO L290 TraceCheckUtils]: 31: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,317 INFO L290 TraceCheckUtils]: 32: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,317 INFO L290 TraceCheckUtils]: 33: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,317 INFO L290 TraceCheckUtils]: 34: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 != ~alive3~0 % 256; {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,317 INFO L290 TraceCheckUtils]: 35: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,318 INFO L290 TraceCheckUtils]: 36: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1; {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,318 INFO L290 TraceCheckUtils]: 37: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,318 INFO L290 TraceCheckUtils]: 38: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,319 INFO L290 TraceCheckUtils]: 39: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,319 INFO L290 TraceCheckUtils]: 40: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,319 INFO L290 TraceCheckUtils]: 41: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} check_#res#1 := check_~tmp~1#1; {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,320 INFO L290 TraceCheckUtils]: 42: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,320 INFO L290 TraceCheckUtils]: 43: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == assert_~arg#1 % 256); {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,320 INFO L290 TraceCheckUtils]: 44: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} assume { :end_inline_assert } true;main_#t~post27#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,321 INFO L290 TraceCheckUtils]: 45: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,321 INFO L290 TraceCheckUtils]: 46: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,321 INFO L290 TraceCheckUtils]: 47: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~alive1~0 % 256); {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,321 INFO L290 TraceCheckUtils]: 48: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,322 INFO L290 TraceCheckUtils]: 49: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,322 INFO L290 TraceCheckUtils]: 50: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,322 INFO L290 TraceCheckUtils]: 51: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} assume !(node2_~m2~0#1 != ~nomsg~0); {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,323 INFO L290 TraceCheckUtils]: 52: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} ~mode2~0 := 0; {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,323 INFO L290 TraceCheckUtils]: 53: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,323 INFO L290 TraceCheckUtils]: 54: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,324 INFO L290 TraceCheckUtils]: 55: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} assume node3_~m3~0#1 != ~nomsg~0; {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,324 INFO L290 TraceCheckUtils]: 56: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 != ~alive3~0 % 256; {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,324 INFO L290 TraceCheckUtils]: 57: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} assume !(node3_~m3~0#1 > ~id3~0); {59723#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:24,325 INFO L290 TraceCheckUtils]: 58: Hoare triple {59723#(<= (+ ~st2~0 ~st1~0) 0)} assume node3_~m3~0#1 == ~id3~0;~st3~0 := 1; {59724#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:27:24,325 INFO L290 TraceCheckUtils]: 59: Hoare triple {59724#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} ~mode3~0 := 0; {59724#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:27:24,326 INFO L290 TraceCheckUtils]: 60: Hoare triple {59724#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {59724#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:27:24,326 INFO L290 TraceCheckUtils]: 61: Hoare triple {59724#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {59721#false} is VALID [2022-02-20 18:27:24,326 INFO L290 TraceCheckUtils]: 62: Hoare triple {59721#false} check_#res#1 := check_~tmp~1#1; {59721#false} is VALID [2022-02-20 18:27:24,326 INFO L290 TraceCheckUtils]: 63: Hoare triple {59721#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {59721#false} is VALID [2022-02-20 18:27:24,326 INFO L290 TraceCheckUtils]: 64: Hoare triple {59721#false} assume 0 == assert_~arg#1 % 256; {59721#false} is VALID [2022-02-20 18:27:24,327 INFO L290 TraceCheckUtils]: 65: Hoare triple {59721#false} assume !false; {59721#false} is VALID [2022-02-20 18:27:24,327 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 18:27:24,327 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:24,327 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574736301] [2022-02-20 18:27:24,327 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574736301] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:24,328 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:24,328 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:27:24,328 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330421355] [2022-02-20 18:27:24,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:24,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 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 66 [2022-02-20 18:27:24,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:24,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:24,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:24,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:27:24,369 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:24,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:27:24,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:27:24,370 INFO L87 Difference]: Start difference. First operand 4639 states and 6510 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:30,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:30,626 INFO L93 Difference]: Finished difference Result 7759 states and 10922 transitions. [2022-02-20 18:27:30,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:27:30,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 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 66 [2022-02-20 18:27:30,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:30,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:30,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 392 transitions. [2022-02-20 18:27:30,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:30,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 392 transitions. [2022-02-20 18:27:30,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 392 transitions. [2022-02-20 18:27:30,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 392 edges. 392 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:32,569 INFO L225 Difference]: With dead ends: 7759 [2022-02-20 18:27:32,570 INFO L226 Difference]: Without dead ends: 6883 [2022-02-20 18:27:32,571 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:27:32,572 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 268 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:27:32,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [268 Valid, 435 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:32,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6883 states. [2022-02-20 18:27:35,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6883 to 5453. [2022-02-20 18:27:35,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:35,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6883 states. Second operand has 5453 states, 5452 states have (on average 1.4013206162876009) internal successors, (7640), 5452 states have internal predecessors, (7640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:35,924 INFO L74 IsIncluded]: Start isIncluded. First operand 6883 states. Second operand has 5453 states, 5452 states have (on average 1.4013206162876009) internal successors, (7640), 5452 states have internal predecessors, (7640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:35,928 INFO L87 Difference]: Start difference. First operand 6883 states. Second operand has 5453 states, 5452 states have (on average 1.4013206162876009) internal successors, (7640), 5452 states have internal predecessors, (7640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:37,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:37,278 INFO L93 Difference]: Finished difference Result 6883 states and 9655 transitions. [2022-02-20 18:27:37,278 INFO L276 IsEmpty]: Start isEmpty. Operand 6883 states and 9655 transitions. [2022-02-20 18:27:37,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:37,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:37,290 INFO L74 IsIncluded]: Start isIncluded. First operand has 5453 states, 5452 states have (on average 1.4013206162876009) internal successors, (7640), 5452 states have internal predecessors, (7640), 0 states have call successors, (0), 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 6883 states. [2022-02-20 18:27:37,295 INFO L87 Difference]: Start difference. First operand has 5453 states, 5452 states have (on average 1.4013206162876009) internal successors, (7640), 5452 states have internal predecessors, (7640), 0 states have call successors, (0), 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 6883 states. [2022-02-20 18:27:38,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:38,688 INFO L93 Difference]: Finished difference Result 6883 states and 9655 transitions. [2022-02-20 18:27:38,688 INFO L276 IsEmpty]: Start isEmpty. Operand 6883 states and 9655 transitions. [2022-02-20 18:27:38,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:38,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:38,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:38,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:38,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5453 states, 5452 states have (on average 1.4013206162876009) internal successors, (7640), 5452 states have internal predecessors, (7640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:39,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5453 states to 5453 states and 7640 transitions. [2022-02-20 18:27:39,663 INFO L78 Accepts]: Start accepts. Automaton has 5453 states and 7640 transitions. Word has length 66 [2022-02-20 18:27:39,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:39,663 INFO L470 AbstractCegarLoop]: Abstraction has 5453 states and 7640 transitions. [2022-02-20 18:27:39,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:39,664 INFO L276 IsEmpty]: Start isEmpty. Operand 5453 states and 7640 transitions. [2022-02-20 18:27:39,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:27:39,665 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:39,665 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2022-02-20 18:27:39,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:27:39,665 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:39,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:39,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1029926107, now seen corresponding path program 1 times [2022-02-20 18:27:39,666 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:39,666 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4027788] [2022-02-20 18:27:39,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:39,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:39,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {89266#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; {89266#true} is VALID [2022-02-20 18:27:39,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {89266#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_#t~post27#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {89266#true} is VALID [2022-02-20 18:27:39,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {89266#true} assume 0 == ~r1~0; {89266#true} is VALID [2022-02-20 18:27:39,718 INFO L290 TraceCheckUtils]: 3: Hoare triple {89266#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {89266#true} is VALID [2022-02-20 18:27:39,718 INFO L290 TraceCheckUtils]: 4: Hoare triple {89266#true} assume ~id1~0 >= 0; {89266#true} is VALID [2022-02-20 18:27:39,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {89266#true} assume 0 == ~st1~0; {89266#true} is VALID [2022-02-20 18:27:39,718 INFO L290 TraceCheckUtils]: 6: Hoare triple {89266#true} assume ~send1~0 == ~id1~0; {89266#true} is VALID [2022-02-20 18:27:39,718 INFO L290 TraceCheckUtils]: 7: Hoare triple {89266#true} assume 0 == ~mode1~0 % 256; {89266#true} is VALID [2022-02-20 18:27:39,718 INFO L290 TraceCheckUtils]: 8: Hoare triple {89266#true} assume ~id2~0 >= 0; {89266#true} is VALID [2022-02-20 18:27:39,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {89266#true} assume 0 == ~st2~0; {89266#true} is VALID [2022-02-20 18:27:39,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {89266#true} assume ~send2~0 == ~id2~0; {89266#true} is VALID [2022-02-20 18:27:39,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {89266#true} assume 0 == ~mode2~0 % 256; {89266#true} is VALID [2022-02-20 18:27:39,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {89266#true} assume ~id3~0 >= 0; {89266#true} is VALID [2022-02-20 18:27:39,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {89266#true} assume 0 == ~st3~0; {89266#true} is VALID [2022-02-20 18:27:39,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {89266#true} assume ~send3~0 == ~id3~0; {89266#true} is VALID [2022-02-20 18:27:39,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {89266#true} assume 0 == ~mode3~0 % 256; {89266#true} is VALID [2022-02-20 18:27:39,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {89266#true} assume ~id1~0 != ~id2~0; {89266#true} is VALID [2022-02-20 18:27:39,719 INFO L290 TraceCheckUtils]: 17: Hoare triple {89266#true} assume ~id1~0 != ~id3~0; {89266#true} is VALID [2022-02-20 18:27:39,720 INFO L290 TraceCheckUtils]: 18: Hoare triple {89266#true} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {89266#true} is VALID [2022-02-20 18:27:39,720 INFO L290 TraceCheckUtils]: 19: Hoare triple {89266#true} init_#res#1 := init_~tmp~0#1; {89266#true} is VALID [2022-02-20 18:27:39,720 INFO L290 TraceCheckUtils]: 20: Hoare triple {89266#true} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {89266#true} is VALID [2022-02-20 18:27:39,720 INFO L290 TraceCheckUtils]: 21: Hoare triple {89266#true} assume !(0 == main_~i2~0#1); {89266#true} is VALID [2022-02-20 18:27:39,720 INFO L290 TraceCheckUtils]: 22: Hoare triple {89266#true} ~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_~i2~0#1 := 0; {89266#true} is VALID [2022-02-20 18:27:39,720 INFO L290 TraceCheckUtils]: 23: Hoare triple {89266#true} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {89266#true} is VALID [2022-02-20 18:27:39,720 INFO L290 TraceCheckUtils]: 24: Hoare triple {89266#true} assume !(0 != ~mode1~0 % 256); {89266#true} is VALID [2022-02-20 18:27:39,721 INFO L290 TraceCheckUtils]: 25: Hoare triple {89266#true} assume !(0 != ~alive1~0 % 256); {89266#true} is VALID [2022-02-20 18:27:39,721 INFO L290 TraceCheckUtils]: 26: Hoare triple {89266#true} ~mode1~0 := 1; {89266#true} is VALID [2022-02-20 18:27:39,721 INFO L290 TraceCheckUtils]: 27: Hoare triple {89266#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {89266#true} is VALID [2022-02-20 18:27:39,721 INFO L290 TraceCheckUtils]: 28: Hoare triple {89266#true} assume !(0 != ~mode2~0 % 256); {89266#true} is VALID [2022-02-20 18:27:39,721 INFO L290 TraceCheckUtils]: 29: Hoare triple {89266#true} assume !(0 != ~alive2~0 % 256); {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:27:39,722 INFO L290 TraceCheckUtils]: 30: Hoare triple {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(~send2~0 != ~id2~0); {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:27:39,722 INFO L290 TraceCheckUtils]: 31: Hoare triple {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} ~mode2~0 := 1; {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:27:39,723 INFO L290 TraceCheckUtils]: 32: Hoare triple {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:27:39,723 INFO L290 TraceCheckUtils]: 33: Hoare triple {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 != ~mode3~0 % 256); {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:27:39,723 INFO L290 TraceCheckUtils]: 34: Hoare triple {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume 0 != ~alive3~0 % 256; {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:27:39,724 INFO L290 TraceCheckUtils]: 35: Hoare triple {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:27:39,724 INFO L290 TraceCheckUtils]: 36: Hoare triple {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1; {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:27:39,725 INFO L290 TraceCheckUtils]: 37: Hoare triple {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} ~mode3~0 := 1; {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:27:39,725 INFO L290 TraceCheckUtils]: 38: Hoare triple {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:27:39,725 INFO L290 TraceCheckUtils]: 39: Hoare triple {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:27:39,726 INFO L290 TraceCheckUtils]: 40: Hoare triple {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:27:39,726 INFO L290 TraceCheckUtils]: 41: Hoare triple {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} check_#res#1 := check_~tmp~1#1; {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:27:39,727 INFO L290 TraceCheckUtils]: 42: Hoare triple {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:27:39,727 INFO L290 TraceCheckUtils]: 43: Hoare triple {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 == assert_~arg#1 % 256); {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:27:39,727 INFO L290 TraceCheckUtils]: 44: Hoare triple {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume { :end_inline_assert } true;main_#t~post27#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:27:39,728 INFO L290 TraceCheckUtils]: 45: Hoare triple {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:27:39,728 INFO L290 TraceCheckUtils]: 46: Hoare triple {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 != ~mode1~0 % 256); {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:27:39,729 INFO L290 TraceCheckUtils]: 47: Hoare triple {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 != ~alive1~0 % 256); {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:27:39,729 INFO L290 TraceCheckUtils]: 48: Hoare triple {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} ~mode1~0 := 1; {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:27:39,729 INFO L290 TraceCheckUtils]: 49: Hoare triple {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:27:39,730 INFO L290 TraceCheckUtils]: 50: Hoare triple {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:27:39,730 INFO L290 TraceCheckUtils]: 51: Hoare triple {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume node2_~m2~0#1 != ~nomsg~0; {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:27:39,731 INFO L290 TraceCheckUtils]: 52: Hoare triple {89268#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume 0 != ~alive2~0 % 256; {89267#false} is VALID [2022-02-20 18:27:39,731 INFO L290 TraceCheckUtils]: 53: Hoare triple {89267#false} assume !(node2_~m2~0#1 > ~id2~0); {89267#false} is VALID [2022-02-20 18:27:39,731 INFO L290 TraceCheckUtils]: 54: Hoare triple {89267#false} assume node2_~m2~0#1 == ~id2~0;~st2~0 := 1; {89267#false} is VALID [2022-02-20 18:27:39,731 INFO L290 TraceCheckUtils]: 55: Hoare triple {89267#false} ~mode2~0 := 0; {89267#false} is VALID [2022-02-20 18:27:39,731 INFO L290 TraceCheckUtils]: 56: Hoare triple {89267#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {89267#false} is VALID [2022-02-20 18:27:39,731 INFO L290 TraceCheckUtils]: 57: Hoare triple {89267#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {89267#false} is VALID [2022-02-20 18:27:39,732 INFO L290 TraceCheckUtils]: 58: Hoare triple {89267#false} assume !(node3_~m3~0#1 != ~nomsg~0); {89267#false} is VALID [2022-02-20 18:27:39,732 INFO L290 TraceCheckUtils]: 59: Hoare triple {89267#false} ~mode3~0 := 0; {89267#false} is VALID [2022-02-20 18:27:39,732 INFO L290 TraceCheckUtils]: 60: Hoare triple {89267#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {89267#false} is VALID [2022-02-20 18:27:39,732 INFO L290 TraceCheckUtils]: 61: Hoare triple {89267#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {89267#false} is VALID [2022-02-20 18:27:39,732 INFO L290 TraceCheckUtils]: 62: Hoare triple {89267#false} check_#res#1 := check_~tmp~1#1; {89267#false} is VALID [2022-02-20 18:27:39,732 INFO L290 TraceCheckUtils]: 63: Hoare triple {89267#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {89267#false} is VALID [2022-02-20 18:27:39,732 INFO L290 TraceCheckUtils]: 64: Hoare triple {89267#false} assume 0 == assert_~arg#1 % 256; {89267#false} is VALID [2022-02-20 18:27:39,732 INFO L290 TraceCheckUtils]: 65: Hoare triple {89267#false} assume !false; {89267#false} is VALID [2022-02-20 18:27:39,733 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:27:39,733 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:39,733 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4027788] [2022-02-20 18:27:39,733 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4027788] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:39,734 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:39,734 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:27:39,734 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135330660] [2022-02-20 18:27:39,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:39,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-02-20 18:27:39,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:39,735 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:39,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:39,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:27:39,786 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:39,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:27:39,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:27:39,786 INFO L87 Difference]: Start difference. First operand 5453 states and 7640 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:50,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:50,462 INFO L93 Difference]: Finished difference Result 12406 states and 17292 transitions. [2022-02-20 18:27:50,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:27:50,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-02-20 18:27:50,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:50,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:50,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2022-02-20 18:27:50,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:50,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2022-02-20 18:27:50,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 242 transitions. [2022-02-20 18:27:50,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 242 edges. 242 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:53,382 INFO L225 Difference]: With dead ends: 12406 [2022-02-20 18:27:53,382 INFO L226 Difference]: Without dead ends: 8374 [2022-02-20 18:27:53,386 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:27:53,387 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 45 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:27:53,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 204 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:53,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8374 states.