./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ac9738018cdb6c628ad42533cfecc5c9af778919d271278199945a85d10a362 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:43:51,843 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:43:51,845 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:43:51,878 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:43:51,879 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:43:51,881 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:43:51,882 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:43:51,884 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:43:51,885 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:43:51,888 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:43:51,889 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:43:51,890 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:43:51,890 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:43:51,892 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:43:51,893 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:43:51,896 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:43:51,897 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:43:51,897 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:43:51,898 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:43:51,899 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:43:51,900 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:43:51,901 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:43:51,901 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:43:51,902 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:43:51,905 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:43:51,907 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:43:51,907 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:43:51,908 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:43:51,909 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:43:51,909 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:43:51,910 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:43:51,910 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:43:51,911 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:43:51,912 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:43:51,913 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:43:51,913 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:43:51,914 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:43:51,914 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:43:51,914 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:43:51,914 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:43:51,915 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:43:51,916 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:43:51,936 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:43:51,936 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:43:51,937 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:43:51,937 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:43:51,938 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:43:51,938 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:43:51,938 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:43:51,938 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:43:51,938 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:43:51,939 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:43:51,939 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:43:51,940 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:43:51,940 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:43:51,940 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:43:51,940 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:43:51,940 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:43:51,940 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:43:51,940 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:43:51,940 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:43:51,941 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:43:51,941 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:43:51,941 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:43:51,941 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:43:51,941 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:43:51,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:43:51,941 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:43:51,942 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:43:51,943 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:43:51,943 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:43:51,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:43:51,943 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:43:51,943 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:43:51,944 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:43:51,944 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 -> 4ac9738018cdb6c628ad42533cfecc5c9af778919d271278199945a85d10a362 [2022-02-20 18:43:52,129 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:43:52,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:43:52,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:43:52,146 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:43:52,146 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:43:52,147 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:43:52,187 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/004f2798d/8b816b51f3b442f29739ee7c1185d5dc/FLAG341a0e706 [2022-02-20 18:43:52,556 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:43:52,557 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:43:52,565 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/004f2798d/8b816b51f3b442f29739ee7c1185d5dc/FLAG341a0e706 [2022-02-20 18:43:52,574 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/004f2798d/8b816b51f3b442f29739ee7c1185d5dc [2022-02-20 18:43:52,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:43:52,577 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:43:52,578 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:43:52,578 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:43:52,580 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:43:52,580 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:43:52" (1/1) ... [2022-02-20 18:43:52,581 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ed70bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:52, skipping insertion in model container [2022-02-20 18:43:52,581 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:43:52" (1/1) ... [2022-02-20 18:43:52,585 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:43:52,601 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:43:52,769 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4411,4424] [2022-02-20 18:43:52,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:43:52,810 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:43:52,838 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4411,4424] [2022-02-20 18:43:52,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:43:52,874 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:43:52,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:52 WrapperNode [2022-02-20 18:43:52,877 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:43:52,884 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:43:52,884 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:43:52,884 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:43:52,888 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:43:52" (1/1) ... [2022-02-20 18:43:52,893 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:43:52" (1/1) ... [2022-02-20 18:43:52,921 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 329 [2022-02-20 18:43:52,921 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:43:52,922 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:43:52,922 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:43:52,922 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:43:52,943 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:52" (1/1) ... [2022-02-20 18:43:52,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:52" (1/1) ... [2022-02-20 18:43:52,945 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:52" (1/1) ... [2022-02-20 18:43:52,946 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:52" (1/1) ... [2022-02-20 18:43:52,949 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:52" (1/1) ... [2022-02-20 18:43:52,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:52" (1/1) ... [2022-02-20 18:43:52,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:52" (1/1) ... [2022-02-20 18:43:52,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:43:52,955 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:43:52,955 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:43:52,955 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:43:52,956 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:52" (1/1) ... [2022-02-20 18:43:52,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:43:52,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:43:52,997 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:43:53,007 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:43:53,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:43:53,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:43:53,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:43:53,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:43:53,122 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:43:53,123 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:43:53,433 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:43:53,438 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:43:53,438 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:43:53,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:43:53 BoogieIcfgContainer [2022-02-20 18:43:53,439 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:43:53,440 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:43:53,441 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:43:53,443 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:43:53,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:43:52" (1/3) ... [2022-02-20 18:43:53,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5653de82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:43:53, skipping insertion in model container [2022-02-20 18:43:53,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:52" (2/3) ... [2022-02-20 18:43:53,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5653de82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:43:53, skipping insertion in model container [2022-02-20 18:43:53,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:43:53" (3/3) ... [2022-02-20 18:43:53,452 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:43:53,455 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:43:53,455 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:43:53,489 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:43:53,493 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:43:53,493 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:43:53,505 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 85 states have (on average 1.6705882352941177) internal successors, (142), 86 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:53,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 18:43:53,510 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:43:53,511 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:43:53,511 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:43:53,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:43:53,515 INFO L85 PathProgramCache]: Analyzing trace with hash 716810707, now seen corresponding path program 1 times [2022-02-20 18:43:53,521 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:43:53,522 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752910077] [2022-02-20 18:43:53,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:43:53,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:43:53,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:43:53,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {90#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6348~0 := 0;~__return_6453~0 := 0; {90#true} is VALID [2022-02-20 18:43:53,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {90#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {90#true} is VALID [2022-02-20 18:43:53,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {90#true} assume 0 == ~r1~0 % 256; {90#true} is VALID [2022-02-20 18:43:53,691 INFO L290 TraceCheckUtils]: 3: Hoare triple {90#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {90#true} is VALID [2022-02-20 18:43:53,691 INFO L290 TraceCheckUtils]: 4: Hoare triple {90#true} assume ~id1~0 >= 0; {90#true} is VALID [2022-02-20 18:43:53,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {90#true} assume 0 == ~st1~0; {90#true} is VALID [2022-02-20 18:43:53,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {90#true} assume ~send1~0 == ~id1~0; {90#true} is VALID [2022-02-20 18:43:53,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {90#true} assume 0 == ~mode1~0 % 256; {90#true} is VALID [2022-02-20 18:43:53,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {90#true} assume ~id2~0 >= 0; {90#true} is VALID [2022-02-20 18:43:53,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {90#true} assume 0 == ~st2~0; {90#true} is VALID [2022-02-20 18:43:53,692 INFO L290 TraceCheckUtils]: 10: Hoare triple {90#true} assume ~send2~0 == ~id2~0; {90#true} is VALID [2022-02-20 18:43:53,693 INFO L290 TraceCheckUtils]: 11: Hoare triple {90#true} assume 0 == ~mode2~0 % 256; {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:43:53,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:43:53,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:43:53,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:43:53,698 INFO L290 TraceCheckUtils]: 15: Hoare triple {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:43:53,698 INFO L290 TraceCheckUtils]: 16: Hoare triple {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:43:53,699 INFO L290 TraceCheckUtils]: 17: Hoare triple {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:43:53,700 INFO L290 TraceCheckUtils]: 18: Hoare triple {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6348~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6348~0; {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:43:53,700 INFO L290 TraceCheckUtils]: 19: Hoare triple {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:43:53,701 INFO L290 TraceCheckUtils]: 20: Hoare triple {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:43:53,702 INFO L290 TraceCheckUtils]: 21: Hoare triple {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~mode1~0 % 256); {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:43:53,702 INFO L290 TraceCheckUtils]: 22: Hoare triple {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~alive1~0 % 256); {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:43:53,703 INFO L290 TraceCheckUtils]: 23: Hoare triple {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(~send1~0 != ~id1~0); {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:43:53,703 INFO L290 TraceCheckUtils]: 24: Hoare triple {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:43:53,704 INFO L290 TraceCheckUtils]: 25: Hoare triple {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:43:53,705 INFO L290 TraceCheckUtils]: 26: Hoare triple {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {91#false} is VALID [2022-02-20 18:43:53,705 INFO L290 TraceCheckUtils]: 27: Hoare triple {91#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {91#false} is VALID [2022-02-20 18:43:53,705 INFO L290 TraceCheckUtils]: 28: Hoare triple {91#false} ~mode2~0 := 0; {91#false} is VALID [2022-02-20 18:43:53,705 INFO L290 TraceCheckUtils]: 29: Hoare triple {91#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {91#false} is VALID [2022-02-20 18:43:53,705 INFO L290 TraceCheckUtils]: 30: Hoare triple {91#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {91#false} is VALID [2022-02-20 18:43:53,706 INFO L290 TraceCheckUtils]: 31: Hoare triple {91#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {91#false} is VALID [2022-02-20 18:43:53,706 INFO L290 TraceCheckUtils]: 32: Hoare triple {91#false} ~mode3~0 := 0; {91#false} is VALID [2022-02-20 18:43:53,706 INFO L290 TraceCheckUtils]: 33: Hoare triple {91#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {91#false} is VALID [2022-02-20 18:43:53,706 INFO L290 TraceCheckUtils]: 34: Hoare triple {91#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {91#false} is VALID [2022-02-20 18:43:53,706 INFO L290 TraceCheckUtils]: 35: Hoare triple {91#false} ~__return_6453~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6453~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {91#false} is VALID [2022-02-20 18:43:53,707 INFO L290 TraceCheckUtils]: 36: Hoare triple {91#false} assume 0 == main_~assert__arg~0#1 % 256; {91#false} is VALID [2022-02-20 18:43:53,707 INFO L290 TraceCheckUtils]: 37: Hoare triple {91#false} assume !false; {91#false} is VALID [2022-02-20 18:43:53,708 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:43:53,708 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:43:53,708 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752910077] [2022-02-20 18:43:53,709 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752910077] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:43:53,709 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:43:53,709 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:43:53,710 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519645790] [2022-02-20 18:43:53,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:43:53,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-02-20 18:43:53,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:43:53,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:53,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:53,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:43:53,748 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:43:53,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:43:53,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:43:53,763 INFO L87 Difference]: Start difference. First operand has 87 states, 85 states have (on average 1.6705882352941177) internal successors, (142), 86 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:53,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:53,951 INFO L93 Difference]: Finished difference Result 205 states and 324 transitions. [2022-02-20 18:43:53,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:43:53,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-02-20 18:43:53,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:43:53,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:53,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2022-02-20 18:43:53,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:53,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2022-02-20 18:43:53,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 324 transitions. [2022-02-20 18:43:54,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 324 edges. 324 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:54,206 INFO L225 Difference]: With dead ends: 205 [2022-02-20 18:43:54,206 INFO L226 Difference]: Without dead ends: 132 [2022-02-20 18:43:54,208 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:43:54,210 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 94 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:43:54,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 283 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:43:54,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-02-20 18:43:54,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2022-02-20 18:43:54,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:43:54,238 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 130 states, 129 states have (on average 1.503875968992248) internal successors, (194), 129 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:54,239 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 130 states, 129 states have (on average 1.503875968992248) internal successors, (194), 129 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:54,240 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 130 states, 129 states have (on average 1.503875968992248) internal successors, (194), 129 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:54,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:54,248 INFO L93 Difference]: Finished difference Result 132 states and 195 transitions. [2022-02-20 18:43:54,248 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 195 transitions. [2022-02-20 18:43:54,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:54,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:54,249 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 129 states have (on average 1.503875968992248) internal successors, (194), 129 states have internal predecessors, (194), 0 states have call successors, (0), 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 132 states. [2022-02-20 18:43:54,250 INFO L87 Difference]: Start difference. First operand has 130 states, 129 states have (on average 1.503875968992248) internal successors, (194), 129 states have internal predecessors, (194), 0 states have call successors, (0), 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 132 states. [2022-02-20 18:43:54,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:54,258 INFO L93 Difference]: Finished difference Result 132 states and 195 transitions. [2022-02-20 18:43:54,258 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 195 transitions. [2022-02-20 18:43:54,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:54,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:54,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:43:54,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:43:54,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.503875968992248) internal successors, (194), 129 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:54,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 194 transitions. [2022-02-20 18:43:54,265 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 194 transitions. Word has length 38 [2022-02-20 18:43:54,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:43:54,265 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 194 transitions. [2022-02-20 18:43:54,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:54,266 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 194 transitions. [2022-02-20 18:43:54,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 18:43:54,266 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:43:54,267 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:43:54,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:43:54,267 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:43:54,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:43:54,268 INFO L85 PathProgramCache]: Analyzing trace with hash -935293361, now seen corresponding path program 1 times [2022-02-20 18:43:54,268 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:43:54,268 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49754411] [2022-02-20 18:43:54,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:43:54,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:43:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:43:54,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {805#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6348~0 := 0;~__return_6453~0 := 0; {805#true} is VALID [2022-02-20 18:43:54,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {805#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {805#true} is VALID [2022-02-20 18:43:54,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {805#true} assume 0 == ~r1~0 % 256; {805#true} is VALID [2022-02-20 18:43:54,334 INFO L290 TraceCheckUtils]: 3: Hoare triple {805#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {805#true} is VALID [2022-02-20 18:43:54,334 INFO L290 TraceCheckUtils]: 4: Hoare triple {805#true} assume ~id1~0 >= 0; {805#true} is VALID [2022-02-20 18:43:54,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {805#true} assume 0 == ~st1~0; {805#true} is VALID [2022-02-20 18:43:54,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {805#true} assume ~send1~0 == ~id1~0; {805#true} is VALID [2022-02-20 18:43:54,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {805#true} assume 0 == ~mode1~0 % 256; {805#true} is VALID [2022-02-20 18:43:54,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {805#true} assume ~id2~0 >= 0; {805#true} is VALID [2022-02-20 18:43:54,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {805#true} assume 0 == ~st2~0; {805#true} is VALID [2022-02-20 18:43:54,335 INFO L290 TraceCheckUtils]: 10: Hoare triple {805#true} assume ~send2~0 == ~id2~0; {805#true} is VALID [2022-02-20 18:43:54,335 INFO L290 TraceCheckUtils]: 11: Hoare triple {805#true} assume 0 == ~mode2~0 % 256; {805#true} is VALID [2022-02-20 18:43:54,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {805#true} assume ~id3~0 >= 0; {805#true} is VALID [2022-02-20 18:43:54,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {805#true} assume 0 == ~st3~0; {805#true} is VALID [2022-02-20 18:43:54,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {805#true} assume ~send3~0 == ~id3~0; {805#true} is VALID [2022-02-20 18:43:54,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {805#true} assume 0 == ~mode3~0 % 256; {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:43:54,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:43:54,337 INFO L290 TraceCheckUtils]: 17: Hoare triple {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:43:54,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6348~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6348~0; {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:43:54,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:43:54,339 INFO L290 TraceCheckUtils]: 20: Hoare triple {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:43:54,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode1~0 % 256); {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:43:54,340 INFO L290 TraceCheckUtils]: 22: Hoare triple {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~alive1~0 % 256); {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:43:54,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send1~0 != ~id1~0); {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:43:54,341 INFO L290 TraceCheckUtils]: 24: Hoare triple {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:43:54,341 INFO L290 TraceCheckUtils]: 25: Hoare triple {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:43:54,342 INFO L290 TraceCheckUtils]: 26: Hoare triple {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode2~0 % 256); {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:43:54,342 INFO L290 TraceCheckUtils]: 27: Hoare triple {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~alive2~0 % 256); {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:43:54,343 INFO L290 TraceCheckUtils]: 28: Hoare triple {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~id2~0); {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:43:54,343 INFO L290 TraceCheckUtils]: 29: Hoare triple {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:43:54,344 INFO L290 TraceCheckUtils]: 30: Hoare triple {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:43:54,344 INFO L290 TraceCheckUtils]: 31: Hoare triple {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {806#false} is VALID [2022-02-20 18:43:54,344 INFO L290 TraceCheckUtils]: 32: Hoare triple {806#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {806#false} is VALID [2022-02-20 18:43:54,345 INFO L290 TraceCheckUtils]: 33: Hoare triple {806#false} ~mode3~0 := 0; {806#false} is VALID [2022-02-20 18:43:54,345 INFO L290 TraceCheckUtils]: 34: Hoare triple {806#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {806#false} is VALID [2022-02-20 18:43:54,345 INFO L290 TraceCheckUtils]: 35: Hoare triple {806#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {806#false} is VALID [2022-02-20 18:43:54,345 INFO L290 TraceCheckUtils]: 36: Hoare triple {806#false} ~__return_6453~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6453~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {806#false} is VALID [2022-02-20 18:43:54,345 INFO L290 TraceCheckUtils]: 37: Hoare triple {806#false} assume 0 == main_~assert__arg~0#1 % 256; {806#false} is VALID [2022-02-20 18:43:54,345 INFO L290 TraceCheckUtils]: 38: Hoare triple {806#false} assume !false; {806#false} is VALID [2022-02-20 18:43:54,346 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:43:54,346 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:43:54,346 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49754411] [2022-02-20 18:43:54,347 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49754411] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:43:54,347 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:43:54,347 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:43:54,347 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853912786] [2022-02-20 18:43:54,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:43:54,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-02-20 18:43:54,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:43:54,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:54,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:54,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:43:54,383 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:43:54,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:43:54,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:43:54,383 INFO L87 Difference]: Start difference. First operand 130 states and 194 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:54,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:54,529 INFO L93 Difference]: Finished difference Result 318 states and 490 transitions. [2022-02-20 18:43:54,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:43:54,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-02-20 18:43:54,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:43:54,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:54,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2022-02-20 18:43:54,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:54,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2022-02-20 18:43:54,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 297 transitions. [2022-02-20 18:43:54,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 297 edges. 297 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:54,743 INFO L225 Difference]: With dead ends: 318 [2022-02-20 18:43:54,743 INFO L226 Difference]: Without dead ends: 208 [2022-02-20 18:43:54,744 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:43:54,745 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 79 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 235 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:43:54,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 235 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:43:54,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-02-20 18:43:54,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2022-02-20 18:43:54,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:43:54,762 INFO L82 GeneralOperation]: Start isEquivalent. First operand 208 states. Second operand has 206 states, 205 states have (on average 1.526829268292683) internal successors, (313), 205 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:54,762 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states. Second operand has 206 states, 205 states have (on average 1.526829268292683) internal successors, (313), 205 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:54,763 INFO L87 Difference]: Start difference. First operand 208 states. Second operand has 206 states, 205 states have (on average 1.526829268292683) internal successors, (313), 205 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:54,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:54,768 INFO L93 Difference]: Finished difference Result 208 states and 314 transitions. [2022-02-20 18:43:54,769 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 314 transitions. [2022-02-20 18:43:54,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:54,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:54,770 INFO L74 IsIncluded]: Start isIncluded. First operand has 206 states, 205 states have (on average 1.526829268292683) internal successors, (313), 205 states have internal predecessors, (313), 0 states have call successors, (0), 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 208 states. [2022-02-20 18:43:54,771 INFO L87 Difference]: Start difference. First operand has 206 states, 205 states have (on average 1.526829268292683) internal successors, (313), 205 states have internal predecessors, (313), 0 states have call successors, (0), 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 208 states. [2022-02-20 18:43:54,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:54,776 INFO L93 Difference]: Finished difference Result 208 states and 314 transitions. [2022-02-20 18:43:54,776 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 314 transitions. [2022-02-20 18:43:54,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:54,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:54,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:43:54,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:43:54,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.526829268292683) internal successors, (313), 205 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:54,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 313 transitions. [2022-02-20 18:43:54,783 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 313 transitions. Word has length 39 [2022-02-20 18:43:54,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:43:54,784 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 313 transitions. [2022-02-20 18:43:54,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:54,784 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 313 transitions. [2022-02-20 18:43:54,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 18:43:54,785 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:43:54,785 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] [2022-02-20 18:43:54,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:43:54,786 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:43:54,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:43:54,786 INFO L85 PathProgramCache]: Analyzing trace with hash 830312666, now seen corresponding path program 1 times [2022-02-20 18:43:54,786 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:43:54,786 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386888029] [2022-02-20 18:43:54,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:43:54,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:43:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:43:54,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {1936#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6348~0 := 0;~__return_6453~0 := 0; {1936#true} is VALID [2022-02-20 18:43:54,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {1936#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {1936#true} is VALID [2022-02-20 18:43:54,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {1936#true} assume 0 == ~r1~0 % 256; {1936#true} is VALID [2022-02-20 18:43:54,885 INFO L290 TraceCheckUtils]: 3: Hoare triple {1936#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {1936#true} is VALID [2022-02-20 18:43:54,885 INFO L290 TraceCheckUtils]: 4: Hoare triple {1936#true} assume ~id1~0 >= 0; {1936#true} is VALID [2022-02-20 18:43:54,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {1936#true} assume 0 == ~st1~0; {1938#(<= ~st1~0 0)} is VALID [2022-02-20 18:43:54,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {1938#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {1938#(<= ~st1~0 0)} is VALID [2022-02-20 18:43:54,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {1938#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {1938#(<= ~st1~0 0)} is VALID [2022-02-20 18:43:54,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {1938#(<= ~st1~0 0)} assume ~id2~0 >= 0; {1938#(<= ~st1~0 0)} is VALID [2022-02-20 18:43:54,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {1938#(<= ~st1~0 0)} assume 0 == ~st2~0; {1939#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:54,887 INFO L290 TraceCheckUtils]: 10: Hoare triple {1939#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {1939#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:54,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {1939#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {1939#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:54,888 INFO L290 TraceCheckUtils]: 12: Hoare triple {1939#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {1939#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:54,888 INFO L290 TraceCheckUtils]: 13: Hoare triple {1939#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:54,888 INFO L290 TraceCheckUtils]: 14: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:54,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:54,889 INFO L290 TraceCheckUtils]: 16: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:54,890 INFO L290 TraceCheckUtils]: 17: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:54,890 INFO L290 TraceCheckUtils]: 18: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6348~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6348~0; {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:54,890 INFO L290 TraceCheckUtils]: 19: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:54,891 INFO L290 TraceCheckUtils]: 20: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:54,891 INFO L290 TraceCheckUtils]: 21: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:54,891 INFO L290 TraceCheckUtils]: 22: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive1~0 % 256); {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:54,892 INFO L290 TraceCheckUtils]: 23: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~id1~0); {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:54,892 INFO L290 TraceCheckUtils]: 24: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:54,892 INFO L290 TraceCheckUtils]: 25: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:54,893 INFO L290 TraceCheckUtils]: 26: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:54,893 INFO L290 TraceCheckUtils]: 27: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive2~0 % 256); {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:54,893 INFO L290 TraceCheckUtils]: 28: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:54,894 INFO L290 TraceCheckUtils]: 29: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:54,894 INFO L290 TraceCheckUtils]: 30: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:54,895 INFO L290 TraceCheckUtils]: 31: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:54,895 INFO L290 TraceCheckUtils]: 32: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive3~0 % 256); {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:54,895 INFO L290 TraceCheckUtils]: 33: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:54,896 INFO L290 TraceCheckUtils]: 34: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:54,896 INFO L290 TraceCheckUtils]: 35: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:43:54,897 INFO L290 TraceCheckUtils]: 36: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {1937#false} is VALID [2022-02-20 18:43:54,897 INFO L290 TraceCheckUtils]: 37: Hoare triple {1937#false} ~__return_6453~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6453~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {1937#false} is VALID [2022-02-20 18:43:54,897 INFO L290 TraceCheckUtils]: 38: Hoare triple {1937#false} assume 0 == main_~assert__arg~0#1 % 256; {1937#false} is VALID [2022-02-20 18:43:54,897 INFO L290 TraceCheckUtils]: 39: Hoare triple {1937#false} assume !false; {1937#false} is VALID [2022-02-20 18:43:54,898 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:43:54,898 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:43:54,898 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386888029] [2022-02-20 18:43:54,898 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386888029] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:43:54,898 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:43:54,898 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:43:54,899 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604756876] [2022-02-20 18:43:54,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:43:54,899 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2022-02-20 18:43:54,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:43:54,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:54,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:54,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:43:54,924 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:43:54,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:43:54,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:43:54,925 INFO L87 Difference]: Start difference. First operand 206 states and 313 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:55,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:55,726 INFO L93 Difference]: Finished difference Result 950 states and 1485 transitions. [2022-02-20 18:43:55,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:43:55,726 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2022-02-20 18:43:55,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:43:55,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:55,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 525 transitions. [2022-02-20 18:43:55,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:55,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 525 transitions. [2022-02-20 18:43:55,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 525 transitions. [2022-02-20 18:43:56,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 525 edges. 525 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:56,143 INFO L225 Difference]: With dead ends: 950 [2022-02-20 18:43:56,143 INFO L226 Difference]: Without dead ends: 764 [2022-02-20 18:43:56,144 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:43:56,145 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 501 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:43:56,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [501 Valid, 676 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:43:56,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2022-02-20 18:43:56,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 390. [2022-02-20 18:43:56,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:43:56,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 764 states. Second operand has 390 states, 389 states have (on average 1.5347043701799485) internal successors, (597), 389 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:56,324 INFO L74 IsIncluded]: Start isIncluded. First operand 764 states. Second operand has 390 states, 389 states have (on average 1.5347043701799485) internal successors, (597), 389 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:56,325 INFO L87 Difference]: Start difference. First operand 764 states. Second operand has 390 states, 389 states have (on average 1.5347043701799485) internal successors, (597), 389 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:56,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:56,349 INFO L93 Difference]: Finished difference Result 764 states and 1184 transitions. [2022-02-20 18:43:56,349 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1184 transitions. [2022-02-20 18:43:56,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:56,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:56,351 INFO L74 IsIncluded]: Start isIncluded. First operand has 390 states, 389 states have (on average 1.5347043701799485) internal successors, (597), 389 states have internal predecessors, (597), 0 states have call successors, (0), 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 764 states. [2022-02-20 18:43:56,351 INFO L87 Difference]: Start difference. First operand has 390 states, 389 states have (on average 1.5347043701799485) internal successors, (597), 389 states have internal predecessors, (597), 0 states have call successors, (0), 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 764 states. [2022-02-20 18:43:56,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:56,374 INFO L93 Difference]: Finished difference Result 764 states and 1184 transitions. [2022-02-20 18:43:56,374 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1184 transitions. [2022-02-20 18:43:56,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:56,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:56,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:43:56,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:43:56,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 1.5347043701799485) internal successors, (597), 389 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:56,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 597 transitions. [2022-02-20 18:43:56,386 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 597 transitions. Word has length 40 [2022-02-20 18:43:56,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:43:56,386 INFO L470 AbstractCegarLoop]: Abstraction has 390 states and 597 transitions. [2022-02-20 18:43:56,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:56,387 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 597 transitions. [2022-02-20 18:43:56,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 18:43:56,387 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:43:56,387 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:43:56,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:43:56,388 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:43:56,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:43:56,388 INFO L85 PathProgramCache]: Analyzing trace with hash -49567444, now seen corresponding path program 1 times [2022-02-20 18:43:56,389 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:43:56,389 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47389682] [2022-02-20 18:43:56,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:43:56,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:43:56,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:43:56,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {5320#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6348~0 := 0;~__return_6453~0 := 0; {5320#true} is VALID [2022-02-20 18:43:56,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {5320#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {5320#true} is VALID [2022-02-20 18:43:56,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {5320#true} assume 0 == ~r1~0 % 256; {5320#true} is VALID [2022-02-20 18:43:56,468 INFO L290 TraceCheckUtils]: 3: Hoare triple {5320#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {5322#(<= (+ (* (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:43:56,469 INFO L290 TraceCheckUtils]: 4: Hoare triple {5322#(<= (+ (* (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; {5322#(<= (+ (* (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:43:56,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {5322#(<= (+ (* (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; {5322#(<= (+ (* (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:43:56,470 INFO L290 TraceCheckUtils]: 6: Hoare triple {5322#(<= (+ (* (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; {5322#(<= (+ (* (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:43:56,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {5322#(<= (+ (* (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; {5322#(<= (+ (* (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:43:56,471 INFO L290 TraceCheckUtils]: 8: Hoare triple {5322#(<= (+ (* (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; {5322#(<= (+ (* (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:43:56,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {5322#(<= (+ (* (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; {5322#(<= (+ (* (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:43:56,471 INFO L290 TraceCheckUtils]: 10: Hoare triple {5322#(<= (+ (* (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; {5322#(<= (+ (* (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:43:56,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {5322#(<= (+ (* (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; {5322#(<= (+ (* (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:43:56,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {5322#(<= (+ (* (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; {5322#(<= (+ (* (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:43:56,473 INFO L290 TraceCheckUtils]: 13: Hoare triple {5322#(<= (+ (* (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; {5322#(<= (+ (* (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:43:56,473 INFO L290 TraceCheckUtils]: 14: Hoare triple {5322#(<= (+ (* (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; {5322#(<= (+ (* (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:43:56,474 INFO L290 TraceCheckUtils]: 15: Hoare triple {5322#(<= (+ (* (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; {5322#(<= (+ (* (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:43:56,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {5322#(<= (+ (* (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; {5322#(<= (+ (* (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:43:56,475 INFO L290 TraceCheckUtils]: 17: Hoare triple {5322#(<= (+ (* (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; {5322#(<= (+ (* (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:43:56,475 INFO L290 TraceCheckUtils]: 18: Hoare triple {5322#(<= (+ (* (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;main_~init__tmp~0#1 := 1;~__return_6348~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6348~0; {5322#(<= (+ (* (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:43:56,476 INFO L290 TraceCheckUtils]: 19: Hoare triple {5322#(<= (+ (* (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_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {5322#(<= (+ (* (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:43:56,476 INFO L290 TraceCheckUtils]: 20: Hoare triple {5322#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {5322#(<= (+ (* (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:43:56,477 INFO L290 TraceCheckUtils]: 21: Hoare triple {5322#(<= (+ (* (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); {5322#(<= (+ (* (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:43:56,477 INFO L290 TraceCheckUtils]: 22: Hoare triple {5322#(<= (+ (* (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); {5323#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:43:56,478 INFO L290 TraceCheckUtils]: 23: Hoare triple {5323#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} assume !(~send1~0 != ~id1~0); {5323#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:43:56,478 INFO L290 TraceCheckUtils]: 24: Hoare triple {5323#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} ~mode1~0 := 1; {5323#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:43:56,479 INFO L290 TraceCheckUtils]: 25: Hoare triple {5323#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {5323#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:43:56,479 INFO L290 TraceCheckUtils]: 26: Hoare triple {5323#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} assume !!(0 == ~mode2~0 % 256); {5323#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:43:56,497 INFO L290 TraceCheckUtils]: 27: Hoare triple {5323#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} assume !!(0 == ~alive2~0 % 256); {5324#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} is VALID [2022-02-20 18:43:56,498 INFO L290 TraceCheckUtils]: 28: Hoare triple {5324#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} assume !(~send2~0 != ~id2~0); {5324#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} is VALID [2022-02-20 18:43:56,498 INFO L290 TraceCheckUtils]: 29: Hoare triple {5324#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} ~mode2~0 := 1; {5324#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} is VALID [2022-02-20 18:43:56,498 INFO L290 TraceCheckUtils]: 30: Hoare triple {5324#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {5324#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} is VALID [2022-02-20 18:43:56,499 INFO L290 TraceCheckUtils]: 31: Hoare triple {5324#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} assume !!(0 == ~mode3~0 % 256); {5324#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} is VALID [2022-02-20 18:43:56,499 INFO L290 TraceCheckUtils]: 32: Hoare triple {5324#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} assume !!(0 == ~alive3~0 % 256); {5321#false} is VALID [2022-02-20 18:43:56,500 INFO L290 TraceCheckUtils]: 33: Hoare triple {5321#false} assume !(~send3~0 != ~id3~0); {5321#false} is VALID [2022-02-20 18:43:56,500 INFO L290 TraceCheckUtils]: 34: Hoare triple {5321#false} ~mode3~0 := 1; {5321#false} is VALID [2022-02-20 18:43:56,500 INFO L290 TraceCheckUtils]: 35: Hoare triple {5321#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {5321#false} is VALID [2022-02-20 18:43:56,500 INFO L290 TraceCheckUtils]: 36: Hoare triple {5321#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {5321#false} is VALID [2022-02-20 18:43:56,500 INFO L290 TraceCheckUtils]: 37: Hoare triple {5321#false} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1; {5321#false} is VALID [2022-02-20 18:43:56,501 INFO L290 TraceCheckUtils]: 38: Hoare triple {5321#false} ~__return_6453~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6453~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {5321#false} is VALID [2022-02-20 18:43:56,501 INFO L290 TraceCheckUtils]: 39: Hoare triple {5321#false} assume 0 == main_~assert__arg~0#1 % 256; {5321#false} is VALID [2022-02-20 18:43:56,501 INFO L290 TraceCheckUtils]: 40: Hoare triple {5321#false} assume !false; {5321#false} is VALID [2022-02-20 18:43:56,501 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:43:56,502 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:43:56,502 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47389682] [2022-02-20 18:43:56,504 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47389682] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:43:56,504 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:43:56,504 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:43:56,504 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075282856] [2022-02-20 18:43:56,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:43:56,505 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 18:43:56,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:43:56,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:56,533 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:43:56,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:43:56,534 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:43:56,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:43:56,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:43:56,535 INFO L87 Difference]: Start difference. First operand 390 states and 597 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:57,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:57,571 INFO L93 Difference]: Finished difference Result 1348 states and 2080 transitions. [2022-02-20 18:43:57,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:43:57,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 18:43:57,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:43:57,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:57,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 370 transitions. [2022-02-20 18:43:57,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:57,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 370 transitions. [2022-02-20 18:43:57,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 370 transitions. [2022-02-20 18:43:57,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 370 edges. 370 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:57,860 INFO L225 Difference]: With dead ends: 1348 [2022-02-20 18:43:57,860 INFO L226 Difference]: Without dead ends: 978 [2022-02-20 18:43:57,861 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:43:57,862 INFO L933 BasicCegarLoop]: 220 mSDtfsCounter, 268 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:43:57,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [268 Valid, 440 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:43:57,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2022-02-20 18:43:58,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 974. [2022-02-20 18:43:58,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:43:58,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 978 states. Second operand has 974 states, 973 states have (on average 1.5344295991778005) internal successors, (1493), 973 states have internal predecessors, (1493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:58,422 INFO L74 IsIncluded]: Start isIncluded. First operand 978 states. Second operand has 974 states, 973 states have (on average 1.5344295991778005) internal successors, (1493), 973 states have internal predecessors, (1493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:58,424 INFO L87 Difference]: Start difference. First operand 978 states. Second operand has 974 states, 973 states have (on average 1.5344295991778005) internal successors, (1493), 973 states have internal predecessors, (1493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:58,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:58,464 INFO L93 Difference]: Finished difference Result 978 states and 1495 transitions. [2022-02-20 18:43:58,465 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1495 transitions. [2022-02-20 18:43:58,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:58,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:58,468 INFO L74 IsIncluded]: Start isIncluded. First operand has 974 states, 973 states have (on average 1.5344295991778005) internal successors, (1493), 973 states have internal predecessors, (1493), 0 states have call successors, (0), 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 978 states. [2022-02-20 18:43:58,469 INFO L87 Difference]: Start difference. First operand has 974 states, 973 states have (on average 1.5344295991778005) internal successors, (1493), 973 states have internal predecessors, (1493), 0 states have call successors, (0), 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 978 states. [2022-02-20 18:43:58,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:58,502 INFO L93 Difference]: Finished difference Result 978 states and 1495 transitions. [2022-02-20 18:43:58,502 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1495 transitions. [2022-02-20 18:43:58,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:58,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:58,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:43:58,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:43:58,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 973 states have (on average 1.5344295991778005) internal successors, (1493), 973 states have internal predecessors, (1493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:58,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1493 transitions. [2022-02-20 18:43:58,553 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1493 transitions. Word has length 41 [2022-02-20 18:43:58,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:43:58,554 INFO L470 AbstractCegarLoop]: Abstraction has 974 states and 1493 transitions. [2022-02-20 18:43:58,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:43:58,554 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1493 transitions. [2022-02-20 18:43:58,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 18:43:58,555 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:43:58,555 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:43:58,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:43:58,556 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:43:58,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:43:58,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1536012938, now seen corresponding path program 1 times [2022-02-20 18:43:58,556 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:43:58,557 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386165299] [2022-02-20 18:43:58,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:43:58,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:43:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:43:58,615 INFO L290 TraceCheckUtils]: 0: Hoare triple {10501#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6348~0 := 0;~__return_6453~0 := 0; {10501#true} is VALID [2022-02-20 18:43:58,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {10501#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {10501#true} is VALID [2022-02-20 18:43:58,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {10501#true} assume 0 == ~r1~0 % 256; {10501#true} is VALID [2022-02-20 18:43:58,615 INFO L290 TraceCheckUtils]: 3: Hoare triple {10501#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {10501#true} is VALID [2022-02-20 18:43:58,616 INFO L290 TraceCheckUtils]: 4: Hoare triple {10501#true} assume ~id1~0 >= 0; {10501#true} is VALID [2022-02-20 18:43:58,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {10501#true} assume 0 == ~st1~0; {10501#true} is VALID [2022-02-20 18:43:58,616 INFO L290 TraceCheckUtils]: 6: Hoare triple {10501#true} assume ~send1~0 == ~id1~0; {10501#true} is VALID [2022-02-20 18:43:58,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {10501#true} assume 0 == ~mode1~0 % 256; {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:43:58,617 INFO L290 TraceCheckUtils]: 8: Hoare triple {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:43:58,617 INFO L290 TraceCheckUtils]: 9: Hoare triple {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:43:58,618 INFO L290 TraceCheckUtils]: 10: Hoare triple {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:43:58,618 INFO L290 TraceCheckUtils]: 11: Hoare triple {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:43:58,618 INFO L290 TraceCheckUtils]: 12: Hoare triple {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:43:58,619 INFO L290 TraceCheckUtils]: 13: Hoare triple {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:43:58,619 INFO L290 TraceCheckUtils]: 14: Hoare triple {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:43:58,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:43:58,620 INFO L290 TraceCheckUtils]: 16: Hoare triple {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:43:58,620 INFO L290 TraceCheckUtils]: 17: Hoare triple {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:43:58,621 INFO L290 TraceCheckUtils]: 18: Hoare triple {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6348~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6348~0; {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:43:58,621 INFO L290 TraceCheckUtils]: 19: Hoare triple {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:43:58,622 INFO L290 TraceCheckUtils]: 20: Hoare triple {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:43:58,622 INFO L290 TraceCheckUtils]: 21: Hoare triple {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~mode1~0 % 256); {10502#false} is VALID [2022-02-20 18:43:58,622 INFO L290 TraceCheckUtils]: 22: Hoare triple {10502#false} assume 255 == ~r1~0 % 256;~r1~0 := 2; {10502#false} is VALID [2022-02-20 18:43:58,622 INFO L290 TraceCheckUtils]: 23: Hoare triple {10502#false} ~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {10502#false} is VALID [2022-02-20 18:43:58,623 INFO L290 TraceCheckUtils]: 24: Hoare triple {10502#false} assume !(main_~node1__m1~0#1 != ~nomsg~0); {10502#false} is VALID [2022-02-20 18:43:58,623 INFO L290 TraceCheckUtils]: 25: Hoare triple {10502#false} ~mode1~0 := 0; {10502#false} is VALID [2022-02-20 18:43:58,623 INFO L290 TraceCheckUtils]: 26: Hoare triple {10502#false} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {10502#false} is VALID [2022-02-20 18:43:58,623 INFO L290 TraceCheckUtils]: 27: Hoare triple {10502#false} assume !!(0 == ~mode2~0 % 256); {10502#false} is VALID [2022-02-20 18:43:58,623 INFO L290 TraceCheckUtils]: 28: Hoare triple {10502#false} assume !!(0 == ~alive2~0 % 256); {10502#false} is VALID [2022-02-20 18:43:58,623 INFO L290 TraceCheckUtils]: 29: Hoare triple {10502#false} assume !(~send2~0 != ~id2~0); {10502#false} is VALID [2022-02-20 18:43:58,624 INFO L290 TraceCheckUtils]: 30: Hoare triple {10502#false} ~mode2~0 := 1; {10502#false} is VALID [2022-02-20 18:43:58,624 INFO L290 TraceCheckUtils]: 31: Hoare triple {10502#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {10502#false} is VALID [2022-02-20 18:43:58,624 INFO L290 TraceCheckUtils]: 32: Hoare triple {10502#false} assume !!(0 == ~mode3~0 % 256); {10502#false} is VALID [2022-02-20 18:43:58,624 INFO L290 TraceCheckUtils]: 33: Hoare triple {10502#false} assume !!(0 == ~alive3~0 % 256); {10502#false} is VALID [2022-02-20 18:43:58,624 INFO L290 TraceCheckUtils]: 34: Hoare triple {10502#false} assume !(~send3~0 != ~id3~0); {10502#false} is VALID [2022-02-20 18:43:58,624 INFO L290 TraceCheckUtils]: 35: Hoare triple {10502#false} ~mode3~0 := 1; {10502#false} is VALID [2022-02-20 18:43:58,624 INFO L290 TraceCheckUtils]: 36: Hoare triple {10502#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {10502#false} is VALID [2022-02-20 18:43:58,625 INFO L290 TraceCheckUtils]: 37: Hoare triple {10502#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {10502#false} is VALID [2022-02-20 18:43:58,625 INFO L290 TraceCheckUtils]: 38: Hoare triple {10502#false} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1; {10502#false} is VALID [2022-02-20 18:43:58,625 INFO L290 TraceCheckUtils]: 39: Hoare triple {10502#false} ~__return_6453~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6453~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {10502#false} is VALID [2022-02-20 18:43:58,625 INFO L290 TraceCheckUtils]: 40: Hoare triple {10502#false} assume 0 == main_~assert__arg~0#1 % 256; {10502#false} is VALID [2022-02-20 18:43:58,625 INFO L290 TraceCheckUtils]: 41: Hoare triple {10502#false} assume !false; {10502#false} is VALID [2022-02-20 18:43:58,625 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:43:58,626 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:43:58,626 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386165299] [2022-02-20 18:43:58,626 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386165299] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:43:58,626 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:43:58,626 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:43:58,626 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098695605] [2022-02-20 18:43:58,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:43:58,627 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:43:58,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:43:58,627 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:43:58,650 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:43:58,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:43:58,651 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:43:58,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:43:58,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:43:58,651 INFO L87 Difference]: Start difference. First operand 974 states and 1493 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:43:59,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:59,983 INFO L93 Difference]: Finished difference Result 2490 states and 3807 transitions. [2022-02-20 18:43:59,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:43:59,984 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:43:59,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:43:59,984 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:43:59,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 294 transitions. [2022-02-20 18:43:59,986 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:43:59,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 294 transitions. [2022-02-20 18:43:59,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 294 transitions. [2022-02-20 18:44:00,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 294 edges. 294 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:00,266 INFO L225 Difference]: With dead ends: 2490 [2022-02-20 18:44:00,267 INFO L226 Difference]: Without dead ends: 1536 [2022-02-20 18:44:00,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:44:00,273 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 86 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 275 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:44:00,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 275 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:44:00,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2022-02-20 18:44:01,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1534. [2022-02-20 18:44:01,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:01,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1536 states. Second operand has 1534 states, 1533 states have (on average 1.5061969993476843) internal successors, (2309), 1533 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:01,213 INFO L74 IsIncluded]: Start isIncluded. First operand 1536 states. Second operand has 1534 states, 1533 states have (on average 1.5061969993476843) internal successors, (2309), 1533 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:01,215 INFO L87 Difference]: Start difference. First operand 1536 states. Second operand has 1534 states, 1533 states have (on average 1.5061969993476843) internal successors, (2309), 1533 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:01,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:01,279 INFO L93 Difference]: Finished difference Result 1536 states and 2310 transitions. [2022-02-20 18:44:01,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 2310 transitions. [2022-02-20 18:44:01,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:01,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:01,284 INFO L74 IsIncluded]: Start isIncluded. First operand has 1534 states, 1533 states have (on average 1.5061969993476843) internal successors, (2309), 1533 states have internal predecessors, (2309), 0 states have call successors, (0), 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 1536 states. [2022-02-20 18:44:01,286 INFO L87 Difference]: Start difference. First operand has 1534 states, 1533 states have (on average 1.5061969993476843) internal successors, (2309), 1533 states have internal predecessors, (2309), 0 states have call successors, (0), 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 1536 states. [2022-02-20 18:44:01,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:01,350 INFO L93 Difference]: Finished difference Result 1536 states and 2310 transitions. [2022-02-20 18:44:01,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 2310 transitions. [2022-02-20 18:44:01,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:01,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:01,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:01,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:01,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1534 states, 1533 states have (on average 1.5061969993476843) internal successors, (2309), 1533 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:01,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1534 states and 2309 transitions. [2022-02-20 18:44:01,449 INFO L78 Accepts]: Start accepts. Automaton has 1534 states and 2309 transitions. Word has length 42 [2022-02-20 18:44:01,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:01,449 INFO L470 AbstractCegarLoop]: Abstraction has 1534 states and 2309 transitions. [2022-02-20 18:44:01,449 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:44:01,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1534 states and 2309 transitions. [2022-02-20 18:44:01,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 18:44:01,450 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:01,450 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:44:01,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:44:01,450 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:01,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:01,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1650560821, now seen corresponding path program 1 times [2022-02-20 18:44:01,452 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:01,453 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213848968] [2022-02-20 18:44:01,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:01,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:01,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {19178#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6348~0 := 0;~__return_6453~0 := 0; {19180#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:01,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {19180#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {19180#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:01,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {19180#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {19180#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:01,537 INFO L290 TraceCheckUtils]: 3: Hoare triple {19180#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {19180#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:01,537 INFO L290 TraceCheckUtils]: 4: Hoare triple {19180#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {19181#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:01,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {19181#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {19181#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:01,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {19181#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {19182#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:01,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {19182#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {19182#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:01,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {19182#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {19182#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:01,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {19182#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {19182#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:01,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {19182#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {19182#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:01,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {19182#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {19182#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:01,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {19182#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {19182#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:01,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {19182#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {19182#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:01,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {19182#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {19182#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:01,541 INFO L290 TraceCheckUtils]: 15: Hoare triple {19182#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {19182#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:01,541 INFO L290 TraceCheckUtils]: 16: Hoare triple {19182#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {19182#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:01,541 INFO L290 TraceCheckUtils]: 17: Hoare triple {19182#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {19182#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:01,542 INFO L290 TraceCheckUtils]: 18: Hoare triple {19182#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6348~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6348~0; {19182#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:01,542 INFO L290 TraceCheckUtils]: 19: Hoare triple {19182#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {19182#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:01,542 INFO L290 TraceCheckUtils]: 20: Hoare triple {19182#(<= (+ ~nomsg~0 1) ~send1~0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {19182#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:01,543 INFO L290 TraceCheckUtils]: 21: Hoare triple {19182#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256); {19182#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:01,543 INFO L290 TraceCheckUtils]: 22: Hoare triple {19182#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {19182#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:01,543 INFO L290 TraceCheckUtils]: 23: Hoare triple {19182#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0); {19179#false} is VALID [2022-02-20 18:44:01,544 INFO L290 TraceCheckUtils]: 24: Hoare triple {19179#false} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {19179#false} is VALID [2022-02-20 18:44:01,544 INFO L290 TraceCheckUtils]: 25: Hoare triple {19179#false} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256); {19179#false} is VALID [2022-02-20 18:44:01,544 INFO L290 TraceCheckUtils]: 26: Hoare triple {19179#false} ~mode1~0 := 1; {19179#false} is VALID [2022-02-20 18:44:01,544 INFO L290 TraceCheckUtils]: 27: Hoare triple {19179#false} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {19179#false} is VALID [2022-02-20 18:44:01,544 INFO L290 TraceCheckUtils]: 28: Hoare triple {19179#false} assume !!(0 == ~mode2~0 % 256); {19179#false} is VALID [2022-02-20 18:44:01,544 INFO L290 TraceCheckUtils]: 29: Hoare triple {19179#false} assume !!(0 == ~alive2~0 % 256); {19179#false} is VALID [2022-02-20 18:44:01,544 INFO L290 TraceCheckUtils]: 30: Hoare triple {19179#false} assume !(~send2~0 != ~id2~0); {19179#false} is VALID [2022-02-20 18:44:01,545 INFO L290 TraceCheckUtils]: 31: Hoare triple {19179#false} ~mode2~0 := 1; {19179#false} is VALID [2022-02-20 18:44:01,545 INFO L290 TraceCheckUtils]: 32: Hoare triple {19179#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {19179#false} is VALID [2022-02-20 18:44:01,545 INFO L290 TraceCheckUtils]: 33: Hoare triple {19179#false} assume !!(0 == ~mode3~0 % 256); {19179#false} is VALID [2022-02-20 18:44:01,545 INFO L290 TraceCheckUtils]: 34: Hoare triple {19179#false} assume !!(0 == ~alive3~0 % 256); {19179#false} is VALID [2022-02-20 18:44:01,545 INFO L290 TraceCheckUtils]: 35: Hoare triple {19179#false} assume !(~send3~0 != ~id3~0); {19179#false} is VALID [2022-02-20 18:44:01,545 INFO L290 TraceCheckUtils]: 36: Hoare triple {19179#false} ~mode3~0 := 1; {19179#false} is VALID [2022-02-20 18:44:01,545 INFO L290 TraceCheckUtils]: 37: Hoare triple {19179#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {19179#false} is VALID [2022-02-20 18:44:01,546 INFO L290 TraceCheckUtils]: 38: Hoare triple {19179#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {19179#false} is VALID [2022-02-20 18:44:01,546 INFO L290 TraceCheckUtils]: 39: Hoare triple {19179#false} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1; {19179#false} is VALID [2022-02-20 18:44:01,546 INFO L290 TraceCheckUtils]: 40: Hoare triple {19179#false} ~__return_6453~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6453~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {19179#false} is VALID [2022-02-20 18:44:01,546 INFO L290 TraceCheckUtils]: 41: Hoare triple {19179#false} assume 0 == main_~assert__arg~0#1 % 256; {19179#false} is VALID [2022-02-20 18:44:01,546 INFO L290 TraceCheckUtils]: 42: Hoare triple {19179#false} assume !false; {19179#false} is VALID [2022-02-20 18:44:01,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:44:01,547 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:01,547 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213848968] [2022-02-20 18:44:01,547 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213848968] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:01,547 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:01,547 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:44:01,548 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908242192] [2022-02-20 18:44:01,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:01,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 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:44:01,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:01,548 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), 4 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:44:01,580 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:44:01,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:44:01,581 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:01,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:44:01,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:44:01,582 INFO L87 Difference]: Start difference. First operand 1534 states and 2309 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 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:44:05,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:05,626 INFO L93 Difference]: Finished difference Result 4562 states and 6887 transitions. [2022-02-20 18:44:05,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:44:05,627 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 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:44:05,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:05,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 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:44:05,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 323 transitions. [2022-02-20 18:44:05,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 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:44:05,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 323 transitions. [2022-02-20 18:44:05,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 323 transitions. [2022-02-20 18:44:05,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 323 edges. 323 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:06,270 INFO L225 Difference]: With dead ends: 4562 [2022-02-20 18:44:06,270 INFO L226 Difference]: Without dead ends: 3048 [2022-02-20 18:44:06,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:44:06,273 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 519 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:06,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [519 Valid, 137 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:44:06,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3048 states. [2022-02-20 18:44:09,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3048 to 3046. [2022-02-20 18:44:09,755 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:09,759 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3048 states. Second operand has 3046 states, 3045 states have (on average 1.4965517241379311) internal successors, (4557), 3045 states have internal predecessors, (4557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:09,763 INFO L74 IsIncluded]: Start isIncluded. First operand 3048 states. Second operand has 3046 states, 3045 states have (on average 1.4965517241379311) internal successors, (4557), 3045 states have internal predecessors, (4557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:09,766 INFO L87 Difference]: Start difference. First operand 3048 states. Second operand has 3046 states, 3045 states have (on average 1.4965517241379311) internal successors, (4557), 3045 states have internal predecessors, (4557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:10,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:10,043 INFO L93 Difference]: Finished difference Result 3048 states and 4558 transitions. [2022-02-20 18:44:10,043 INFO L276 IsEmpty]: Start isEmpty. Operand 3048 states and 4558 transitions. [2022-02-20 18:44:10,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:10,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:10,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 3046 states, 3045 states have (on average 1.4965517241379311) internal successors, (4557), 3045 states have internal predecessors, (4557), 0 states have call successors, (0), 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 3048 states. [2022-02-20 18:44:10,056 INFO L87 Difference]: Start difference. First operand has 3046 states, 3045 states have (on average 1.4965517241379311) internal successors, (4557), 3045 states have internal predecessors, (4557), 0 states have call successors, (0), 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 3048 states. [2022-02-20 18:44:10,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:10,318 INFO L93 Difference]: Finished difference Result 3048 states and 4558 transitions. [2022-02-20 18:44:10,319 INFO L276 IsEmpty]: Start isEmpty. Operand 3048 states and 4558 transitions. [2022-02-20 18:44:10,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:10,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:10,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:10,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:10,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3046 states, 3045 states have (on average 1.4965517241379311) internal successors, (4557), 3045 states have internal predecessors, (4557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:10,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3046 states to 3046 states and 4557 transitions. [2022-02-20 18:44:10,749 INFO L78 Accepts]: Start accepts. Automaton has 3046 states and 4557 transitions. Word has length 43 [2022-02-20 18:44:10,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:10,750 INFO L470 AbstractCegarLoop]: Abstraction has 3046 states and 4557 transitions. [2022-02-20 18:44:10,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 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:44:10,750 INFO L276 IsEmpty]: Start isEmpty. Operand 3046 states and 4557 transitions. [2022-02-20 18:44:10,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 18:44:10,751 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:10,751 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:44:10,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:44:10,751 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:10,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:10,752 INFO L85 PathProgramCache]: Analyzing trace with hash 836148826, now seen corresponding path program 1 times [2022-02-20 18:44:10,752 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:10,752 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985363343] [2022-02-20 18:44:10,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:10,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:10,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {35893#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6348~0 := 0;~__return_6453~0 := 0; {35893#true} is VALID [2022-02-20 18:44:10,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {35893#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {35893#true} is VALID [2022-02-20 18:44:10,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {35893#true} assume 0 == ~r1~0 % 256; {35893#true} is VALID [2022-02-20 18:44:10,849 INFO L290 TraceCheckUtils]: 3: Hoare triple {35893#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {35893#true} is VALID [2022-02-20 18:44:10,850 INFO L290 TraceCheckUtils]: 4: Hoare triple {35893#true} assume ~id1~0 >= 0; {35893#true} is VALID [2022-02-20 18:44:10,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {35893#true} assume 0 == ~st1~0; {35893#true} is VALID [2022-02-20 18:44:10,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {35893#true} assume ~send1~0 == ~id1~0; {35893#true} is VALID [2022-02-20 18:44:10,851 INFO L290 TraceCheckUtils]: 7: Hoare triple {35893#true} assume 0 == ~mode1~0 % 256; {35893#true} is VALID [2022-02-20 18:44:10,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {35893#true} assume ~id2~0 >= 0; {35893#true} is VALID [2022-02-20 18:44:10,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {35893#true} assume 0 == ~st2~0; {35893#true} is VALID [2022-02-20 18:44:10,852 INFO L290 TraceCheckUtils]: 10: Hoare triple {35893#true} assume ~send2~0 == ~id2~0; {35893#true} is VALID [2022-02-20 18:44:10,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {35893#true} assume 0 == ~mode2~0 % 256; {35893#true} is VALID [2022-02-20 18:44:10,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {35893#true} assume ~id3~0 >= 0; {35893#true} is VALID [2022-02-20 18:44:10,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {35893#true} assume 0 == ~st3~0; {35893#true} is VALID [2022-02-20 18:44:10,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {35893#true} assume ~send3~0 == ~id3~0; {35893#true} is VALID [2022-02-20 18:44:10,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {35893#true} assume 0 == ~mode3~0 % 256; {35893#true} is VALID [2022-02-20 18:44:10,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {35893#true} assume ~id1~0 != ~id2~0; {35893#true} is VALID [2022-02-20 18:44:10,853 INFO L290 TraceCheckUtils]: 17: Hoare triple {35893#true} assume ~id1~0 != ~id3~0; {35893#true} is VALID [2022-02-20 18:44:10,857 INFO L290 TraceCheckUtils]: 18: Hoare triple {35893#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6348~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6348~0; {35895#(= |ULTIMATE.start_main_~main__i2~0#1| 1)} is VALID [2022-02-20 18:44:10,857 INFO L290 TraceCheckUtils]: 19: Hoare triple {35895#(= |ULTIMATE.start_main_~main__i2~0#1| 1)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {35893#true} is VALID [2022-02-20 18:44:10,857 INFO L290 TraceCheckUtils]: 20: Hoare triple {35893#true} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {35893#true} is VALID [2022-02-20 18:44:10,857 INFO L290 TraceCheckUtils]: 21: Hoare triple {35893#true} assume !!(0 == ~mode1~0 % 256); {35893#true} is VALID [2022-02-20 18:44:10,857 INFO L290 TraceCheckUtils]: 22: Hoare triple {35893#true} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {35893#true} is VALID [2022-02-20 18:44:10,857 INFO L290 TraceCheckUtils]: 23: Hoare triple {35893#true} assume ~send1~0 != ~nomsg~0; {35893#true} is VALID [2022-02-20 18:44:10,857 INFO L290 TraceCheckUtils]: 24: Hoare triple {35893#true} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {35893#true} is VALID [2022-02-20 18:44:10,858 INFO L290 TraceCheckUtils]: 25: Hoare triple {35893#true} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256); {35893#true} is VALID [2022-02-20 18:44:10,858 INFO L290 TraceCheckUtils]: 26: Hoare triple {35893#true} ~mode1~0 := 1; {35893#true} is VALID [2022-02-20 18:44:10,858 INFO L290 TraceCheckUtils]: 27: Hoare triple {35893#true} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {35893#true} is VALID [2022-02-20 18:44:10,858 INFO L290 TraceCheckUtils]: 28: Hoare triple {35893#true} assume !!(0 == ~mode2~0 % 256); {35893#true} is VALID [2022-02-20 18:44:10,858 INFO L290 TraceCheckUtils]: 29: Hoare triple {35893#true} assume !!(0 == ~alive2~0 % 256); {35893#true} is VALID [2022-02-20 18:44:10,858 INFO L290 TraceCheckUtils]: 30: Hoare triple {35893#true} assume !(~send2~0 != ~id2~0); {35893#true} is VALID [2022-02-20 18:44:10,858 INFO L290 TraceCheckUtils]: 31: Hoare triple {35893#true} ~mode2~0 := 1; {35893#true} is VALID [2022-02-20 18:44:10,858 INFO L290 TraceCheckUtils]: 32: Hoare triple {35893#true} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {35893#true} is VALID [2022-02-20 18:44:10,858 INFO L290 TraceCheckUtils]: 33: Hoare triple {35893#true} assume !!(0 == ~mode3~0 % 256); {35893#true} is VALID [2022-02-20 18:44:10,859 INFO L290 TraceCheckUtils]: 34: Hoare triple {35893#true} assume !!(0 == ~alive3~0 % 256); {35893#true} is VALID [2022-02-20 18:44:10,859 INFO L290 TraceCheckUtils]: 35: Hoare triple {35893#true} assume !(~send3~0 != ~id3~0); {35893#true} is VALID [2022-02-20 18:44:10,859 INFO L290 TraceCheckUtils]: 36: Hoare triple {35893#true} ~mode3~0 := 1; {35893#true} is VALID [2022-02-20 18:44:10,859 INFO L290 TraceCheckUtils]: 37: Hoare triple {35893#true} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {35893#true} is VALID [2022-02-20 18:44:10,859 INFO L290 TraceCheckUtils]: 38: Hoare triple {35893#true} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {35893#true} is VALID [2022-02-20 18:44:10,859 INFO L290 TraceCheckUtils]: 39: Hoare triple {35893#true} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1; {35896#(not (= |ULTIMATE.start_main_~check__tmp~0#1| 0))} is VALID [2022-02-20 18:44:10,860 INFO L290 TraceCheckUtils]: 40: Hoare triple {35896#(not (= |ULTIMATE.start_main_~check__tmp~0#1| 0))} ~__return_6453~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6453~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {35897#(and (<= 1 |ULTIMATE.start_main_~assert__arg~0#1|) (<= (div |ULTIMATE.start_main_~assert__arg~0#1| 256) 0))} is VALID [2022-02-20 18:44:10,860 INFO L290 TraceCheckUtils]: 41: Hoare triple {35897#(and (<= 1 |ULTIMATE.start_main_~assert__arg~0#1|) (<= (div |ULTIMATE.start_main_~assert__arg~0#1| 256) 0))} assume 0 == main_~assert__arg~0#1 % 256; {35894#false} is VALID [2022-02-20 18:44:10,860 INFO L290 TraceCheckUtils]: 42: Hoare triple {35894#false} assume !false; {35894#false} is VALID [2022-02-20 18:44:10,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:44:10,862 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:10,862 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985363343] [2022-02-20 18:44:10,862 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985363343] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:10,862 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:10,862 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:44:10,862 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526528135] [2022-02-20 18:44:10,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:10,863 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:44:10,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:10,864 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:44:10,890 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:44:10,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:44:10,890 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:10,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:44:10,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:44:10,891 INFO L87 Difference]: Start difference. First operand 3046 states and 4557 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:44:20,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:20,321 INFO L93 Difference]: Finished difference Result 6264 states and 9286 transitions. [2022-02-20 18:44:20,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:44:20,322 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:44:20,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:20,322 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:44:20,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 224 transitions. [2022-02-20 18:44:20,324 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:44:20,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 224 transitions. [2022-02-20 18:44:20,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 224 transitions. [2022-02-20 18:44:20,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:22,033 INFO L225 Difference]: With dead ends: 6264 [2022-02-20 18:44:22,034 INFO L226 Difference]: Without dead ends: 6262 [2022-02-20 18:44:22,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:44:22,037 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 190 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:22,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 585 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:44:22,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6262 states. [2022-02-20 18:44:26,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6262 to 3238. [2022-02-20 18:44:26,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:26,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6262 states. Second operand has 3238 states, 3237 states have (on average 1.4670991658943466) internal successors, (4749), 3237 states have internal predecessors, (4749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:26,308 INFO L74 IsIncluded]: Start isIncluded. First operand 6262 states. Second operand has 3238 states, 3237 states have (on average 1.4670991658943466) internal successors, (4749), 3237 states have internal predecessors, (4749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:26,311 INFO L87 Difference]: Start difference. First operand 6262 states. Second operand has 3238 states, 3237 states have (on average 1.4670991658943466) internal successors, (4749), 3237 states have internal predecessors, (4749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:27,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:27,510 INFO L93 Difference]: Finished difference Result 6262 states and 9189 transitions. [2022-02-20 18:44:27,510 INFO L276 IsEmpty]: Start isEmpty. Operand 6262 states and 9189 transitions. [2022-02-20 18:44:27,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:27,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:27,520 INFO L74 IsIncluded]: Start isIncluded. First operand has 3238 states, 3237 states have (on average 1.4670991658943466) internal successors, (4749), 3237 states have internal predecessors, (4749), 0 states have call successors, (0), 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 6262 states. [2022-02-20 18:44:27,522 INFO L87 Difference]: Start difference. First operand has 3238 states, 3237 states have (on average 1.4670991658943466) internal successors, (4749), 3237 states have internal predecessors, (4749), 0 states have call successors, (0), 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 6262 states. [2022-02-20 18:44:28,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:28,737 INFO L93 Difference]: Finished difference Result 6262 states and 9189 transitions. [2022-02-20 18:44:28,737 INFO L276 IsEmpty]: Start isEmpty. Operand 6262 states and 9189 transitions. [2022-02-20 18:44:28,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:28,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:28,744 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:28,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:28,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3238 states, 3237 states have (on average 1.4670991658943466) internal successors, (4749), 3237 states have internal predecessors, (4749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:29,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3238 states to 3238 states and 4749 transitions. [2022-02-20 18:44:29,234 INFO L78 Accepts]: Start accepts. Automaton has 3238 states and 4749 transitions. Word has length 43 [2022-02-20 18:44:29,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:29,234 INFO L470 AbstractCegarLoop]: Abstraction has 3238 states and 4749 transitions. [2022-02-20 18:44:29,234 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:44:29,234 INFO L276 IsEmpty]: Start isEmpty. Operand 3238 states and 4749 transitions. [2022-02-20 18:44:29,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 18:44:29,235 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:29,235 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:44:29,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:44:29,235 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:29,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:29,236 INFO L85 PathProgramCache]: Analyzing trace with hash 161382844, now seen corresponding path program 1 times [2022-02-20 18:44:29,236 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:29,236 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368934885] [2022-02-20 18:44:29,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:29,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:29,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {61817#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6348~0 := 0;~__return_6453~0 := 0; {61817#true} is VALID [2022-02-20 18:44:29,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {61817#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {61817#true} is VALID [2022-02-20 18:44:29,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {61817#true} assume 0 == ~r1~0 % 256; {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:29,283 INFO L290 TraceCheckUtils]: 3: Hoare triple {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:29,284 INFO L290 TraceCheckUtils]: 4: Hoare triple {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 >= 0; {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:29,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:29,284 INFO L290 TraceCheckUtils]: 6: Hoare triple {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 == ~id1~0; {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:29,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:29,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 >= 0; {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:29,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:29,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 == ~id2~0; {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:29,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:29,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 >= 0; {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:29,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:29,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 == ~id3~0; {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:29,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:29,290 INFO L290 TraceCheckUtils]: 16: Hoare triple {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id2~0; {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:29,290 INFO L290 TraceCheckUtils]: 17: Hoare triple {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id3~0; {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:29,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6348~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6348~0; {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:29,291 INFO L290 TraceCheckUtils]: 19: Hoare triple {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:29,291 INFO L290 TraceCheckUtils]: 20: Hoare triple {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:29,292 INFO L290 TraceCheckUtils]: 21: Hoare triple {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode1~0 % 256); {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:29,292 INFO L290 TraceCheckUtils]: 22: Hoare triple {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:29,292 INFO L290 TraceCheckUtils]: 23: Hoare triple {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 != ~nomsg~0; {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:29,292 INFO L290 TraceCheckUtils]: 24: Hoare triple {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:29,293 INFO L290 TraceCheckUtils]: 25: Hoare triple {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256); {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:29,293 INFO L290 TraceCheckUtils]: 26: Hoare triple {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~mode1~0 := 1; {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:29,293 INFO L290 TraceCheckUtils]: 27: Hoare triple {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:29,294 INFO L290 TraceCheckUtils]: 28: Hoare triple {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode2~0 % 256); {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:29,294 INFO L290 TraceCheckUtils]: 29: Hoare triple {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~alive2~0 % 256); {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:29,294 INFO L290 TraceCheckUtils]: 30: Hoare triple {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~send2~0 != ~id2~0); {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:29,294 INFO L290 TraceCheckUtils]: 31: Hoare triple {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~mode2~0 := 1; {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:29,295 INFO L290 TraceCheckUtils]: 32: Hoare triple {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:29,295 INFO L290 TraceCheckUtils]: 33: Hoare triple {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode3~0 % 256); {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:29,295 INFO L290 TraceCheckUtils]: 34: Hoare triple {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~alive3~0 % 256); {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:29,296 INFO L290 TraceCheckUtils]: 35: Hoare triple {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~send3~0 != ~id3~0); {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:29,296 INFO L290 TraceCheckUtils]: 36: Hoare triple {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~mode3~0 := 1; {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:29,296 INFO L290 TraceCheckUtils]: 37: Hoare triple {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:29,296 INFO L290 TraceCheckUtils]: 38: Hoare triple {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:44:29,297 INFO L290 TraceCheckUtils]: 39: Hoare triple {61819#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~r1~0 % 256 < 3); {61818#false} is VALID [2022-02-20 18:44:29,297 INFO L290 TraceCheckUtils]: 40: Hoare triple {61818#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~0#1 := 0; {61818#false} is VALID [2022-02-20 18:44:29,297 INFO L290 TraceCheckUtils]: 41: Hoare triple {61818#false} ~__return_6453~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6453~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {61818#false} is VALID [2022-02-20 18:44:29,297 INFO L290 TraceCheckUtils]: 42: Hoare triple {61818#false} assume 0 == main_~assert__arg~0#1 % 256; {61818#false} is VALID [2022-02-20 18:44:29,297 INFO L290 TraceCheckUtils]: 43: Hoare triple {61818#false} assume !false; {61818#false} is VALID [2022-02-20 18:44:29,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:44:29,298 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:29,298 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368934885] [2022-02-20 18:44:29,298 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368934885] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:29,298 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:29,298 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:44:29,299 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323163531] [2022-02-20 18:44:29,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:29,299 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:44:29,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:29,299 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:44:29,328 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:44:29,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:44:29,328 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:29,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:44:29,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:44:29,329 INFO L87 Difference]: Start difference. First operand 3238 states and 4749 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:44:38,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:38,291 INFO L93 Difference]: Finished difference Result 7168 states and 10493 transitions. [2022-02-20 18:44:38,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:44:38,292 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:44:38,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:38,292 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:44:38,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 310 transitions. [2022-02-20 18:44:38,293 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:44:38,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 310 transitions. [2022-02-20 18:44:38,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 310 transitions. [2022-02-20 18:44:38,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 310 edges. 310 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:39,073 INFO L225 Difference]: With dead ends: 7168 [2022-02-20 18:44:39,073 INFO L226 Difference]: Without dead ends: 3950 [2022-02-20 18:44:39,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:44:39,076 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 66 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:39,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 214 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:44:39,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3950 states. [2022-02-20 18:44:42,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3950 to 3928. [2022-02-20 18:44:42,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:42,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3950 states. Second operand has 3928 states, 3927 states have (on average 1.452253628724217) internal successors, (5703), 3927 states have internal predecessors, (5703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:42,729 INFO L74 IsIncluded]: Start isIncluded. First operand 3950 states. Second operand has 3928 states, 3927 states have (on average 1.452253628724217) internal successors, (5703), 3927 states have internal predecessors, (5703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:42,732 INFO L87 Difference]: Start difference. First operand 3950 states. Second operand has 3928 states, 3927 states have (on average 1.452253628724217) internal successors, (5703), 3927 states have internal predecessors, (5703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:43,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:43,200 INFO L93 Difference]: Finished difference Result 3950 states and 5724 transitions. [2022-02-20 18:44:43,200 INFO L276 IsEmpty]: Start isEmpty. Operand 3950 states and 5724 transitions. [2022-02-20 18:44:43,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:43,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:43,209 INFO L74 IsIncluded]: Start isIncluded. First operand has 3928 states, 3927 states have (on average 1.452253628724217) internal successors, (5703), 3927 states have internal predecessors, (5703), 0 states have call successors, (0), 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 3950 states. [2022-02-20 18:44:43,211 INFO L87 Difference]: Start difference. First operand has 3928 states, 3927 states have (on average 1.452253628724217) internal successors, (5703), 3927 states have internal predecessors, (5703), 0 states have call successors, (0), 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 3950 states. [2022-02-20 18:44:43,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:43,686 INFO L93 Difference]: Finished difference Result 3950 states and 5724 transitions. [2022-02-20 18:44:43,686 INFO L276 IsEmpty]: Start isEmpty. Operand 3950 states and 5724 transitions. [2022-02-20 18:44:43,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:43,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:43,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:43,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:43,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3928 states, 3927 states have (on average 1.452253628724217) internal successors, (5703), 3927 states have internal predecessors, (5703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:44,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3928 states to 3928 states and 5703 transitions. [2022-02-20 18:44:44,378 INFO L78 Accepts]: Start accepts. Automaton has 3928 states and 5703 transitions. Word has length 44 [2022-02-20 18:44:44,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:44,378 INFO L470 AbstractCegarLoop]: Abstraction has 3928 states and 5703 transitions. [2022-02-20 18:44:44,378 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:44:44,378 INFO L276 IsEmpty]: Start isEmpty. Operand 3928 states and 5703 transitions. [2022-02-20 18:44:44,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:44:44,380 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:44,380 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] [2022-02-20 18:44:44,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:44:44,380 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:44,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:44,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1477612707, now seen corresponding path program 1 times [2022-02-20 18:44:44,381 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:44,381 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191722304] [2022-02-20 18:44:44,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:44,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:44,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:44,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {85304#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6348~0 := 0;~__return_6453~0 := 0; {85304#true} is VALID [2022-02-20 18:44:44,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {85304#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {85304#true} is VALID [2022-02-20 18:44:44,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {85304#true} assume 0 == ~r1~0 % 256; {85304#true} is VALID [2022-02-20 18:44:44,421 INFO L290 TraceCheckUtils]: 3: Hoare triple {85304#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {85304#true} is VALID [2022-02-20 18:44:44,421 INFO L290 TraceCheckUtils]: 4: Hoare triple {85304#true} assume ~id1~0 >= 0; {85304#true} is VALID [2022-02-20 18:44:44,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {85304#true} assume 0 == ~st1~0; {85304#true} is VALID [2022-02-20 18:44:44,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {85304#true} assume ~send1~0 == ~id1~0; {85304#true} is VALID [2022-02-20 18:44:44,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {85304#true} assume 0 == ~mode1~0 % 256; {85304#true} is VALID [2022-02-20 18:44:44,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {85304#true} assume ~id2~0 >= 0; {85304#true} is VALID [2022-02-20 18:44:44,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {85304#true} assume 0 == ~st2~0; {85304#true} is VALID [2022-02-20 18:44:44,422 INFO L290 TraceCheckUtils]: 10: Hoare triple {85304#true} assume ~send2~0 == ~id2~0; {85304#true} is VALID [2022-02-20 18:44:44,422 INFO L290 TraceCheckUtils]: 11: Hoare triple {85304#true} assume 0 == ~mode2~0 % 256; {85304#true} is VALID [2022-02-20 18:44:44,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {85304#true} assume ~id3~0 >= 0; {85304#true} is VALID [2022-02-20 18:44:44,422 INFO L290 TraceCheckUtils]: 13: Hoare triple {85304#true} assume 0 == ~st3~0; {85304#true} is VALID [2022-02-20 18:44:44,422 INFO L290 TraceCheckUtils]: 14: Hoare triple {85304#true} assume ~send3~0 == ~id3~0; {85304#true} is VALID [2022-02-20 18:44:44,422 INFO L290 TraceCheckUtils]: 15: Hoare triple {85304#true} assume 0 == ~mode3~0 % 256; {85304#true} is VALID [2022-02-20 18:44:44,423 INFO L290 TraceCheckUtils]: 16: Hoare triple {85304#true} assume ~id1~0 != ~id2~0; {85304#true} is VALID [2022-02-20 18:44:44,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {85304#true} assume ~id1~0 != ~id3~0; {85304#true} is VALID [2022-02-20 18:44:44,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {85304#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6348~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6348~0; {85304#true} is VALID [2022-02-20 18:44:44,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {85304#true} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {85304#true} is VALID [2022-02-20 18:44:44,423 INFO L290 TraceCheckUtils]: 20: Hoare triple {85304#true} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {85304#true} is VALID [2022-02-20 18:44:44,423 INFO L290 TraceCheckUtils]: 21: Hoare triple {85304#true} assume !!(0 == ~mode1~0 % 256); {85304#true} is VALID [2022-02-20 18:44:44,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {85304#true} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:44:44,424 INFO L290 TraceCheckUtils]: 23: Hoare triple {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} assume ~send1~0 != ~nomsg~0; {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:44:44,424 INFO L290 TraceCheckUtils]: 24: Hoare triple {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:44:44,425 INFO L290 TraceCheckUtils]: 25: Hoare triple {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256); {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:44:44,425 INFO L290 TraceCheckUtils]: 26: Hoare triple {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} ~mode1~0 := 1; {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:44:44,425 INFO L290 TraceCheckUtils]: 27: Hoare triple {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:44:44,426 INFO L290 TraceCheckUtils]: 28: Hoare triple {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} assume !!(0 == ~mode2~0 % 256); {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:44:44,426 INFO L290 TraceCheckUtils]: 29: Hoare triple {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} assume !!(0 == ~alive2~0 % 256); {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:44:44,426 INFO L290 TraceCheckUtils]: 30: Hoare triple {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} assume !(~send2~0 != ~id2~0); {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:44:44,427 INFO L290 TraceCheckUtils]: 31: Hoare triple {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} ~mode2~0 := 1; {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:44:44,427 INFO L290 TraceCheckUtils]: 32: Hoare triple {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:44:44,427 INFO L290 TraceCheckUtils]: 33: Hoare triple {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} assume !!(0 == ~mode3~0 % 256); {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:44:44,428 INFO L290 TraceCheckUtils]: 34: Hoare triple {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} assume !!(0 == ~alive3~0 % 256); {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:44:44,428 INFO L290 TraceCheckUtils]: 35: Hoare triple {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} assume !(~send3~0 != ~id3~0); {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:44:44,428 INFO L290 TraceCheckUtils]: 36: Hoare triple {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} ~mode3~0 := 1; {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:44:44,429 INFO L290 TraceCheckUtils]: 37: Hoare triple {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:44:44,429 INFO L290 TraceCheckUtils]: 38: Hoare triple {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:44:44,430 INFO L290 TraceCheckUtils]: 39: Hoare triple {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1; {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:44:44,430 INFO L290 TraceCheckUtils]: 40: Hoare triple {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} ~__return_6453~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6453~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:44:44,430 INFO L290 TraceCheckUtils]: 41: Hoare triple {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} assume !(0 == main_~assert__arg~0#1 % 256); {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:44:44,431 INFO L290 TraceCheckUtils]: 42: Hoare triple {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:44:44,431 INFO L290 TraceCheckUtils]: 43: Hoare triple {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} assume !!(0 == ~mode1~0 % 256); {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:44:44,431 INFO L290 TraceCheckUtils]: 44: Hoare triple {85306#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} assume !!(0 == ~alive1~0 % 256); {85305#false} is VALID [2022-02-20 18:44:44,432 INFO L290 TraceCheckUtils]: 45: Hoare triple {85305#false} assume !(~send1~0 != ~id1~0); {85305#false} is VALID [2022-02-20 18:44:44,432 INFO L290 TraceCheckUtils]: 46: Hoare triple {85305#false} ~mode1~0 := 1; {85305#false} is VALID [2022-02-20 18:44:44,432 INFO L290 TraceCheckUtils]: 47: Hoare triple {85305#false} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {85305#false} is VALID [2022-02-20 18:44:44,432 INFO L290 TraceCheckUtils]: 48: Hoare triple {85305#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {85305#false} is VALID [2022-02-20 18:44:44,432 INFO L290 TraceCheckUtils]: 49: Hoare triple {85305#false} assume main_~node2__m2~0#1 != ~nomsg~0; {85305#false} is VALID [2022-02-20 18:44:44,432 INFO L290 TraceCheckUtils]: 50: Hoare triple {85305#false} assume !(0 == ~alive2~0 % 256); {85305#false} is VALID [2022-02-20 18:44:44,432 INFO L290 TraceCheckUtils]: 51: Hoare triple {85305#false} assume !(main_~node2__m2~0#1 > ~id2~0); {85305#false} is VALID [2022-02-20 18:44:44,432 INFO L290 TraceCheckUtils]: 52: Hoare triple {85305#false} assume main_~node2__m2~0#1 == ~id2~0;~st2~0 := 1; {85305#false} is VALID [2022-02-20 18:44:44,433 INFO L290 TraceCheckUtils]: 53: Hoare triple {85305#false} ~mode2~0 := 0; {85305#false} is VALID [2022-02-20 18:44:44,433 INFO L290 TraceCheckUtils]: 54: Hoare triple {85305#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {85305#false} is VALID [2022-02-20 18:44:44,433 INFO L290 TraceCheckUtils]: 55: Hoare triple {85305#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {85305#false} is VALID [2022-02-20 18:44:44,433 INFO L290 TraceCheckUtils]: 56: Hoare triple {85305#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {85305#false} is VALID [2022-02-20 18:44:44,433 INFO L290 TraceCheckUtils]: 57: Hoare triple {85305#false} ~mode3~0 := 0; {85305#false} is VALID [2022-02-20 18:44:44,433 INFO L290 TraceCheckUtils]: 58: Hoare triple {85305#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {85305#false} is VALID [2022-02-20 18:44:44,433 INFO L290 TraceCheckUtils]: 59: Hoare triple {85305#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {85305#false} is VALID [2022-02-20 18:44:44,433 INFO L290 TraceCheckUtils]: 60: Hoare triple {85305#false} ~__return_6453~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6453~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {85305#false} is VALID [2022-02-20 18:44:44,434 INFO L290 TraceCheckUtils]: 61: Hoare triple {85305#false} assume 0 == main_~assert__arg~0#1 % 256; {85305#false} is VALID [2022-02-20 18:44:44,434 INFO L290 TraceCheckUtils]: 62: Hoare triple {85305#false} assume !false; {85305#false} is VALID [2022-02-20 18:44:44,434 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:44:44,434 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:44,434 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191722304] [2022-02-20 18:44:44,434 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191722304] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:44,434 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:44,435 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:44:44,435 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525181829] [2022-02-20 18:44:44,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:44,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:44:44,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:44,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:44,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:44,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:44:44,489 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:44,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:44:44,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:44:44,490 INFO L87 Difference]: Start difference. First operand 3928 states and 5703 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:57,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:57,471 INFO L93 Difference]: Finished difference Result 9069 states and 13163 transitions. [2022-02-20 18:44:57,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:44:57,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:44:57,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:57,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:57,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 305 transitions. [2022-02-20 18:44:57,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:57,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 305 transitions. [2022-02-20 18:44:57,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 305 transitions. [2022-02-20 18:44:57,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 305 edges. 305 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:59,210 INFO L225 Difference]: With dead ends: 9069 [2022-02-20 18:44:59,210 INFO L226 Difference]: Without dead ends: 6251 [2022-02-20 18:44:59,212 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:44:59,213 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 69 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:59,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 277 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:44:59,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6251 states. [2022-02-20 18:45:05,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6251 to 6249. [2022-02-20 18:45:05,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:05,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6251 states. Second operand has 6249 states, 6248 states have (on average 1.4322983354673495) internal successors, (8949), 6248 states have internal predecessors, (8949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:05,893 INFO L74 IsIncluded]: Start isIncluded. First operand 6251 states. Second operand has 6249 states, 6248 states have (on average 1.4322983354673495) internal successors, (8949), 6248 states have internal predecessors, (8949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:05,896 INFO L87 Difference]: Start difference. First operand 6251 states. Second operand has 6249 states, 6248 states have (on average 1.4322983354673495) internal successors, (8949), 6248 states have internal predecessors, (8949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:07,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:07,100 INFO L93 Difference]: Finished difference Result 6251 states and 8950 transitions. [2022-02-20 18:45:07,100 INFO L276 IsEmpty]: Start isEmpty. Operand 6251 states and 8950 transitions. [2022-02-20 18:45:07,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:07,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:07,113 INFO L74 IsIncluded]: Start isIncluded. First operand has 6249 states, 6248 states have (on average 1.4322983354673495) internal successors, (8949), 6248 states have internal predecessors, (8949), 0 states have call successors, (0), 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 6251 states. [2022-02-20 18:45:07,116 INFO L87 Difference]: Start difference. First operand has 6249 states, 6248 states have (on average 1.4322983354673495) internal successors, (8949), 6248 states have internal predecessors, (8949), 0 states have call successors, (0), 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 6251 states.