./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.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/combinations/Problem05_label49+token_ring.01.cil-2.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 eeee6bfce8612e4c7a8797e69f7e2696f4f49417b2ea41e83d66cf7e8ad61db4 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:26:31,791 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:26:31,796 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:26:31,822 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:26:31,823 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:26:31,825 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:26:31,826 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:26:31,830 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:26:31,831 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:26:31,834 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:26:31,835 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:26:31,836 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:26:31,836 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:26:31,838 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:26:31,839 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:26:31,841 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:26:31,841 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:26:31,842 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:26:31,843 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:26:31,846 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:26:31,847 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:26:31,848 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:26:31,849 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:26:31,849 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:26:31,855 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:26:31,855 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:26:31,855 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:26:31,856 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:26:31,856 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:26:31,857 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:26:31,857 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:26:31,858 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:26:31,859 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:26:31,859 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:26:31,860 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:26:31,860 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:26:31,861 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:26:31,861 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:26:31,861 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:26:31,862 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:26:31,862 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:26:31,863 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:26:31,887 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:26:31,888 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:26:31,888 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:26:31,888 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:26:31,889 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:26:31,889 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:26:31,889 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:26:31,889 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:26:31,890 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:26:31,890 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:26:31,890 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:26:31,891 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:26:31,891 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:26:31,891 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:26:31,891 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:26:31,891 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:26:31,891 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:26:31,891 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:26:31,892 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:26:31,892 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:26:31,892 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:26:31,892 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:26:31,892 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:26:31,892 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:26:31,892 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:26:31,893 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:26:31,893 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:26:31,893 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:26:31,893 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:26:31,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:26:31,893 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:26:31,894 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:26:31,894 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:26:31,894 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 -> eeee6bfce8612e4c7a8797e69f7e2696f4f49417b2ea41e83d66cf7e8ad61db4 [2022-02-20 19:26:32,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:26:32,105 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:26:32,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:26:32,107 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:26:32,108 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:26:32,109 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c [2022-02-20 19:26:32,159 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfd92971d/2f53ab9000744368a375bc8d389499a4/FLAGf2602d928 [2022-02-20 19:26:32,735 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:26:32,736 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c [2022-02-20 19:26:32,781 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfd92971d/2f53ab9000744368a375bc8d389499a4/FLAGf2602d928 [2022-02-20 19:26:32,885 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfd92971d/2f53ab9000744368a375bc8d389499a4 [2022-02-20 19:26:32,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:26:32,887 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:26:32,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:26:32,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:26:32,891 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:26:32,892 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:26:32" (1/1) ... [2022-02-20 19:26:32,894 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@667b6d7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:26:32, skipping insertion in model container [2022-02-20 19:26:32,894 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:26:32" (1/1) ... [2022-02-20 19:26:32,898 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:26:33,025 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:26:34,234 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/combinations/Problem05_label49+token_ring.01.cil-2.c[380593,380606] [2022-02-20 19:26:34,256 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/combinations/Problem05_label49+token_ring.01.cil-2.c[383339,383352] [2022-02-20 19:26:34,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:26:34,350 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:26:34,921 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/combinations/Problem05_label49+token_ring.01.cil-2.c[380593,380606] [2022-02-20 19:26:34,925 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/combinations/Problem05_label49+token_ring.01.cil-2.c[383339,383352] [2022-02-20 19:26:34,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:26:34,976 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:26:34,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:26:34 WrapperNode [2022-02-20 19:26:34,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:26:34,977 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:26:34,977 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:26:34,977 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:26:34,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:26:34" (1/1) ... [2022-02-20 19:26:35,046 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:26:34" (1/1) ... [2022-02-20 19:26:35,452 INFO L137 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12566 [2022-02-20 19:26:35,452 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:26:35,453 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:26:35,453 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:26:35,453 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:26:35,459 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:26:34" (1/1) ... [2022-02-20 19:26:35,460 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:26:34" (1/1) ... [2022-02-20 19:26:35,511 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:26:34" (1/1) ... [2022-02-20 19:26:35,511 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:26:34" (1/1) ... [2022-02-20 19:26:35,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:26:34" (1/1) ... [2022-02-20 19:26:35,720 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:26:34" (1/1) ... [2022-02-20 19:26:35,808 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:26:34" (1/1) ... [2022-02-20 19:26:35,889 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:26:35,905 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:26:35,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:26:35,905 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:26:35,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:26:34" (1/1) ... [2022-02-20 19:26:35,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:26:35,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:26:35,928 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 19:26:35,956 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 19:26:35,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:26:35,987 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-02-20 19:26:35,987 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-02-20 19:26:35,987 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-02-20 19:26:35,988 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-02-20 19:26:35,988 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-02-20 19:26:35,988 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-02-20 19:26:35,988 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:26:35,988 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:26:35,988 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-02-20 19:26:35,988 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-02-20 19:26:35,988 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-02-20 19:26:35,989 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-02-20 19:26:35,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:26:35,989 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-02-20 19:26:35,989 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-02-20 19:26:35,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:26:35,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:26:36,155 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:26:36,156 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:26:40,997 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:26:41,022 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:26:41,022 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-02-20 19:26:41,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:26:41 BoogieIcfgContainer [2022-02-20 19:26:41,025 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:26:41,026 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:26:41,026 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:26:41,030 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:26:41,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:26:32" (1/3) ... [2022-02-20 19:26:41,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed3ec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:26:41, skipping insertion in model container [2022-02-20 19:26:41,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:26:34" (2/3) ... [2022-02-20 19:26:41,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed3ec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:26:41, skipping insertion in model container [2022-02-20 19:26:41,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:26:41" (3/3) ... [2022-02-20 19:26:41,032 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.01.cil-2.c [2022-02-20 19:26:41,035 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:26:41,036 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:26:41,071 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:26:41,075 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 19:26:41,075 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:26:41,114 INFO L276 IsEmpty]: Start isEmpty. Operand has 2298 states, 2271 states have (on average 1.8590929106120653) internal successors, (4222), 2276 states have internal predecessors, (4222), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 19:26:41,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 19:26:41,120 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:26:41,120 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:26:41,121 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:26:41,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:26:41,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1417964819, now seen corresponding path program 1 times [2022-02-20 19:26:41,130 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:26:41,130 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103534059] [2022-02-20 19:26:41,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:26:41,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:26:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:41,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:26:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:41,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {2301#true} assume true; {2301#true} is VALID [2022-02-20 19:26:41,280 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {2301#true} {2303#(= ~M_E~0 2)} #10497#return; {2303#(= ~M_E~0 2)} is VALID [2022-02-20 19:26:41,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:26:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:41,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {2337#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume 0 == ~M_E~0;~M_E~0 := 1; {2338#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:26:41,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {2338#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {2338#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:26:41,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {2338#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {2338#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:26:41,335 INFO L290 TraceCheckUtils]: 3: Hoare triple {2338#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {2338#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:26:41,335 INFO L290 TraceCheckUtils]: 4: Hoare triple {2338#(= |old(~M_E~0)| 0)} assume true; {2338#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:26:41,337 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2338#(= |old(~M_E~0)| 0)} {2303#(= ~M_E~0 2)} #10499#return; {2302#false} is VALID [2022-02-20 19:26:41,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:26:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:41,359 INFO L290 TraceCheckUtils]: 0: Hoare triple {2339#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {2301#true} is VALID [2022-02-20 19:26:41,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {2301#true} assume 1 == ~m_pc~0; {2301#true} is VALID [2022-02-20 19:26:41,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {2301#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {2301#true} is VALID [2022-02-20 19:26:41,360 INFO L290 TraceCheckUtils]: 3: Hoare triple {2301#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {2301#true} is VALID [2022-02-20 19:26:41,360 INFO L290 TraceCheckUtils]: 4: Hoare triple {2301#true} #t~ret32#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp~1#1 := #t~ret32#1;havoc #t~ret32#1; {2301#true} is VALID [2022-02-20 19:26:41,360 INFO L290 TraceCheckUtils]: 5: Hoare triple {2301#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {2301#true} is VALID [2022-02-20 19:26:41,360 INFO L290 TraceCheckUtils]: 6: Hoare triple {2301#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {2301#true} is VALID [2022-02-20 19:26:41,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {2301#true} assume !(1 == ~t1_pc~0); {2301#true} is VALID [2022-02-20 19:26:41,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {2301#true} is_transmit1_triggered_~__retres1~1#1 := 0; {2301#true} is VALID [2022-02-20 19:26:41,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {2301#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {2301#true} is VALID [2022-02-20 19:26:41,361 INFO L290 TraceCheckUtils]: 10: Hoare triple {2301#true} #t~ret33#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp___0~0#1 := #t~ret33#1;havoc #t~ret33#1; {2301#true} is VALID [2022-02-20 19:26:41,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {2301#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {2301#true} is VALID [2022-02-20 19:26:41,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {2301#true} assume true; {2301#true} is VALID [2022-02-20 19:26:41,362 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {2301#true} {2302#false} #10501#return; {2302#false} is VALID [2022-02-20 19:26:41,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:26:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:41,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {2337#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume 1 == ~M_E~0;~M_E~0 := 2; {2301#true} is VALID [2022-02-20 19:26:41,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {2301#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {2301#true} is VALID [2022-02-20 19:26:41,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {2301#true} assume 1 == ~E_M~0;~E_M~0 := 2; {2301#true} is VALID [2022-02-20 19:26:41,369 INFO L290 TraceCheckUtils]: 3: Hoare triple {2301#true} assume 1 == ~E_1~0;~E_1~0 := 2; {2301#true} is VALID [2022-02-20 19:26:41,369 INFO L290 TraceCheckUtils]: 4: Hoare triple {2301#true} assume true; {2301#true} is VALID [2022-02-20 19:26:41,369 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2301#true} {2302#false} #10503#return; {2302#false} is VALID [2022-02-20 19:26:41,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:26:41,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:41,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {2301#true} havoc ~__retres1~2; {2301#true} is VALID [2022-02-20 19:26:41,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {2301#true} assume 0 == ~m_st~0;~__retres1~2 := 1; {2301#true} is VALID [2022-02-20 19:26:41,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {2301#true} #res := ~__retres1~2; {2301#true} is VALID [2022-02-20 19:26:41,374 INFO L290 TraceCheckUtils]: 3: Hoare triple {2301#true} assume true; {2301#true} is VALID [2022-02-20 19:26:41,374 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2301#true} {2302#false} #10505#return; {2302#false} is VALID [2022-02-20 19:26:41,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {2301#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(20, 2);call #Ultimate.allocInit(12, 3);~d~0 := 4;~c~0 := 3;~e~0 := 5;~a~0 := 1;~f~0 := 6;~b~0 := 2;~a9~0 := 18;~a27~0 := 1;~a2~0 := 10;~a16~0 := 1;~a15~0 := 1;~a12~0 := 4;~a25~0 := 1;~a20~0 := 5;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {2303#(= ~M_E~0 2)} is VALID [2022-02-20 19:26:41,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {2303#(= ~M_E~0 2)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {2303#(= ~M_E~0 2)} is VALID [2022-02-20 19:26:41,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {2303#(= ~M_E~0 2)} assume !(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~3#1;havoc main2_~__retres1~3#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1; {2303#(= ~M_E~0 2)} is VALID [2022-02-20 19:26:41,377 INFO L290 TraceCheckUtils]: 3: Hoare triple {2303#(= ~M_E~0 2)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret35#1, start_simulation_#t~ret36#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0; {2303#(= ~M_E~0 2)} is VALID [2022-02-20 19:26:41,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {2303#(= ~M_E~0 2)} call update_channels(); {2301#true} is VALID [2022-02-20 19:26:41,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {2301#true} assume true; {2301#true} is VALID [2022-02-20 19:26:41,378 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2301#true} {2303#(= ~M_E~0 2)} #10497#return; {2303#(= ~M_E~0 2)} is VALID [2022-02-20 19:26:41,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {2303#(= ~M_E~0 2)} assume { :begin_inline_init_threads } true; {2303#(= ~M_E~0 2)} is VALID [2022-02-20 19:26:41,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {2303#(= ~M_E~0 2)} assume 1 == ~m_i~0;~m_st~0 := 0; {2303#(= ~M_E~0 2)} is VALID [2022-02-20 19:26:41,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {2303#(= ~M_E~0 2)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {2303#(= ~M_E~0 2)} is VALID [2022-02-20 19:26:41,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {2303#(= ~M_E~0 2)} assume { :end_inline_init_threads } true; {2303#(= ~M_E~0 2)} is VALID [2022-02-20 19:26:41,380 INFO L272 TraceCheckUtils]: 11: Hoare triple {2303#(= ~M_E~0 2)} call fire_delta_events(); {2337#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:26:41,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {2337#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume 0 == ~M_E~0;~M_E~0 := 1; {2338#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:26:41,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {2338#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {2338#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:26:41,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {2338#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {2338#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:26:41,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {2338#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {2338#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:26:41,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {2338#(= |old(~M_E~0)| 0)} assume true; {2338#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:26:41,383 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2338#(= |old(~M_E~0)| 0)} {2303#(= ~M_E~0 2)} #10499#return; {2302#false} is VALID [2022-02-20 19:26:41,383 INFO L272 TraceCheckUtils]: 18: Hoare triple {2302#false} call activate_threads(); {2339#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:26:41,383 INFO L290 TraceCheckUtils]: 19: Hoare triple {2339#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {2301#true} is VALID [2022-02-20 19:26:41,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {2301#true} assume 1 == ~m_pc~0; {2301#true} is VALID [2022-02-20 19:26:41,384 INFO L290 TraceCheckUtils]: 21: Hoare triple {2301#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {2301#true} is VALID [2022-02-20 19:26:41,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {2301#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {2301#true} is VALID [2022-02-20 19:26:41,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {2301#true} #t~ret32#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp~1#1 := #t~ret32#1;havoc #t~ret32#1; {2301#true} is VALID [2022-02-20 19:26:41,384 INFO L290 TraceCheckUtils]: 24: Hoare triple {2301#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {2301#true} is VALID [2022-02-20 19:26:41,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {2301#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {2301#true} is VALID [2022-02-20 19:26:41,385 INFO L290 TraceCheckUtils]: 26: Hoare triple {2301#true} assume !(1 == ~t1_pc~0); {2301#true} is VALID [2022-02-20 19:26:41,385 INFO L290 TraceCheckUtils]: 27: Hoare triple {2301#true} is_transmit1_triggered_~__retres1~1#1 := 0; {2301#true} is VALID [2022-02-20 19:26:41,385 INFO L290 TraceCheckUtils]: 28: Hoare triple {2301#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {2301#true} is VALID [2022-02-20 19:26:41,385 INFO L290 TraceCheckUtils]: 29: Hoare triple {2301#true} #t~ret33#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp___0~0#1 := #t~ret33#1;havoc #t~ret33#1; {2301#true} is VALID [2022-02-20 19:26:41,386 INFO L290 TraceCheckUtils]: 30: Hoare triple {2301#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {2301#true} is VALID [2022-02-20 19:26:41,386 INFO L290 TraceCheckUtils]: 31: Hoare triple {2301#true} assume true; {2301#true} is VALID [2022-02-20 19:26:41,386 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2301#true} {2302#false} #10501#return; {2302#false} is VALID [2022-02-20 19:26:41,386 INFO L272 TraceCheckUtils]: 33: Hoare triple {2302#false} call reset_delta_events(); {2337#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:26:41,386 INFO L290 TraceCheckUtils]: 34: Hoare triple {2337#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume 1 == ~M_E~0;~M_E~0 := 2; {2301#true} is VALID [2022-02-20 19:26:41,387 INFO L290 TraceCheckUtils]: 35: Hoare triple {2301#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {2301#true} is VALID [2022-02-20 19:26:41,387 INFO L290 TraceCheckUtils]: 36: Hoare triple {2301#true} assume 1 == ~E_M~0;~E_M~0 := 2; {2301#true} is VALID [2022-02-20 19:26:41,387 INFO L290 TraceCheckUtils]: 37: Hoare triple {2301#true} assume 1 == ~E_1~0;~E_1~0 := 2; {2301#true} is VALID [2022-02-20 19:26:41,387 INFO L290 TraceCheckUtils]: 38: Hoare triple {2301#true} assume true; {2301#true} is VALID [2022-02-20 19:26:41,387 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2301#true} {2302#false} #10503#return; {2302#false} is VALID [2022-02-20 19:26:41,388 INFO L290 TraceCheckUtils]: 40: Hoare triple {2302#false} assume !false; {2302#false} is VALID [2022-02-20 19:26:41,388 INFO L290 TraceCheckUtils]: 41: Hoare triple {2302#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret29#1, eval_#t~nondet30#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet31#1, eval_~tmp_ndt_2~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {2302#false} is VALID [2022-02-20 19:26:41,388 INFO L290 TraceCheckUtils]: 42: Hoare triple {2302#false} assume !false; {2302#false} is VALID [2022-02-20 19:26:41,388 INFO L272 TraceCheckUtils]: 43: Hoare triple {2302#false} call eval_#t~ret29#1 := exists_runnable_thread(); {2301#true} is VALID [2022-02-20 19:26:41,388 INFO L290 TraceCheckUtils]: 44: Hoare triple {2301#true} havoc ~__retres1~2; {2301#true} is VALID [2022-02-20 19:26:41,389 INFO L290 TraceCheckUtils]: 45: Hoare triple {2301#true} assume 0 == ~m_st~0;~__retres1~2 := 1; {2301#true} is VALID [2022-02-20 19:26:41,389 INFO L290 TraceCheckUtils]: 46: Hoare triple {2301#true} #res := ~__retres1~2; {2301#true} is VALID [2022-02-20 19:26:41,389 INFO L290 TraceCheckUtils]: 47: Hoare triple {2301#true} assume true; {2301#true} is VALID [2022-02-20 19:26:41,389 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {2301#true} {2302#false} #10505#return; {2302#false} is VALID [2022-02-20 19:26:41,389 INFO L290 TraceCheckUtils]: 49: Hoare triple {2302#false} assume -2147483648 <= eval_#t~ret29#1 && eval_#t~ret29#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret29#1;havoc eval_#t~ret29#1; {2302#false} is VALID [2022-02-20 19:26:41,390 INFO L290 TraceCheckUtils]: 50: Hoare triple {2302#false} assume 0 != eval_~tmp~0#1; {2302#false} is VALID [2022-02-20 19:26:41,390 INFO L290 TraceCheckUtils]: 51: Hoare triple {2302#false} assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;assume -2147483648 <= eval_#t~nondet30#1 && eval_#t~nondet30#1 <= 2147483647;eval_~tmp_ndt_1~0#1 := eval_#t~nondet30#1;havoc eval_#t~nondet30#1; {2302#false} is VALID [2022-02-20 19:26:41,390 INFO L290 TraceCheckUtils]: 52: Hoare triple {2302#false} assume 0 != eval_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet27#1, master_#t~nondet28#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet27#1 && master_#t~nondet27#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet27#1;havoc master_#t~nondet27#1; {2302#false} is VALID [2022-02-20 19:26:41,390 INFO L290 TraceCheckUtils]: 53: Hoare triple {2302#false} assume !(0 == ~m_pc~0); {2302#false} is VALID [2022-02-20 19:26:41,390 INFO L290 TraceCheckUtils]: 54: Hoare triple {2302#false} assume 1 == ~m_pc~0; {2302#false} is VALID [2022-02-20 19:26:41,391 INFO L290 TraceCheckUtils]: 55: Hoare triple {2302#false} assume ~token~0 != 1 + ~local~0; {2302#false} is VALID [2022-02-20 19:26:41,391 INFO L272 TraceCheckUtils]: 56: Hoare triple {2302#false} call error(); {2302#false} is VALID [2022-02-20 19:26:41,391 INFO L290 TraceCheckUtils]: 57: Hoare triple {2302#false} assume !false; {2302#false} is VALID [2022-02-20 19:26:41,392 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 19:26:41,392 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:26:41,392 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103534059] [2022-02-20 19:26:41,393 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103534059] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:26:41,393 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:26:41,393 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:26:41,394 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318170650] [2022-02-20 19:26:41,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:26:41,398 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-02-20 19:26:41,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:26:41,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:26:41,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:26:41,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:26:41,443 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:26:41,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:26:41,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:26:41,470 INFO L87 Difference]: Start difference. First operand has 2298 states, 2271 states have (on average 1.8590929106120653) internal successors, (4222), 2276 states have internal predecessors, (4222), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:26:51,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:26:51,191 INFO L93 Difference]: Finished difference Result 4727 states and 8720 transitions. [2022-02-20 19:26:51,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:26:51,191 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-02-20 19:26:51,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:26:51,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:26:51,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 8720 transitions. [2022-02-20 19:26:51,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:26:51,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 8720 transitions. [2022-02-20 19:26:51,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 8720 transitions. [2022-02-20 19:26:56,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8720 edges. 8720 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:26:57,190 INFO L225 Difference]: With dead ends: 4727 [2022-02-20 19:26:57,191 INFO L226 Difference]: Without dead ends: 2368 [2022-02-20 19:26:57,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:26:57,203 INFO L933 BasicCegarLoop]: 4199 mSDtfsCounter, 4329 mSDsluCounter, 12380 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4337 SdHoareTripleChecker+Valid, 16579 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:26:57,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4337 Valid, 16579 Invalid, 494 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [80 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:26:57,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2022-02-20 19:26:57,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2325. [2022-02-20 19:26:57,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:26:57,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2368 states. Second operand has 2325 states, 2283 states have (on average 1.838370565045992) internal successors, (4197), 2287 states have internal predecessors, (4197), 27 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-02-20 19:26:57,319 INFO L74 IsIncluded]: Start isIncluded. First operand 2368 states. Second operand has 2325 states, 2283 states have (on average 1.838370565045992) internal successors, (4197), 2287 states have internal predecessors, (4197), 27 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-02-20 19:26:57,323 INFO L87 Difference]: Start difference. First operand 2368 states. Second operand has 2325 states, 2283 states have (on average 1.838370565045992) internal successors, (4197), 2287 states have internal predecessors, (4197), 27 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-02-20 19:26:57,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:26:57,478 INFO L93 Difference]: Finished difference Result 2368 states and 4316 transitions. [2022-02-20 19:26:57,479 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 4316 transitions. [2022-02-20 19:26:57,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:26:57,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:26:57,496 INFO L74 IsIncluded]: Start isIncluded. First operand has 2325 states, 2283 states have (on average 1.838370565045992) internal successors, (4197), 2287 states have internal predecessors, (4197), 27 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) Second operand 2368 states. [2022-02-20 19:26:57,501 INFO L87 Difference]: Start difference. First operand has 2325 states, 2283 states have (on average 1.838370565045992) internal successors, (4197), 2287 states have internal predecessors, (4197), 27 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) Second operand 2368 states. [2022-02-20 19:26:57,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:26:57,660 INFO L93 Difference]: Finished difference Result 2368 states and 4316 transitions. [2022-02-20 19:26:57,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 4316 transitions. [2022-02-20 19:26:57,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:26:57,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:26:57,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:26:57,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:26:57,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2325 states, 2283 states have (on average 1.838370565045992) internal successors, (4197), 2287 states have internal predecessors, (4197), 27 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-02-20 19:26:57,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2325 states to 2325 states and 4252 transitions. [2022-02-20 19:26:57,837 INFO L78 Accepts]: Start accepts. Automaton has 2325 states and 4252 transitions. Word has length 58 [2022-02-20 19:26:57,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:26:57,838 INFO L470 AbstractCegarLoop]: Abstraction has 2325 states and 4252 transitions. [2022-02-20 19:26:57,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:26:57,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2325 states and 4252 transitions. [2022-02-20 19:26:57,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 19:26:57,841 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:26:57,841 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:26:57,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:26:57,841 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:26:57,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:26:57,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1082743281, now seen corresponding path program 1 times [2022-02-20 19:26:57,843 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:26:57,843 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357931751] [2022-02-20 19:26:57,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:26:57,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:26:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:57,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:26:57,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:57,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {14375#true} assume true; {14375#true} is VALID [2022-02-20 19:26:57,898 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {14375#true} {14377#(= ~T1_E~0 ~M_E~0)} #10497#return; {14377#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:26:57,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:26:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:57,933 INFO L290 TraceCheckUtils]: 0: Hoare triple {14411#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {14412#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:26:57,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {14412#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {14413#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:26:57,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {14413#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {14413#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:26:57,934 INFO L290 TraceCheckUtils]: 3: Hoare triple {14413#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {14413#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:26:57,935 INFO L290 TraceCheckUtils]: 4: Hoare triple {14413#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {14413#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:26:57,935 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {14413#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {14377#(= ~T1_E~0 ~M_E~0)} #10499#return; {14376#false} is VALID [2022-02-20 19:26:57,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:26:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:57,964 INFO L290 TraceCheckUtils]: 0: Hoare triple {14414#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {14375#true} is VALID [2022-02-20 19:26:57,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {14375#true} assume 1 == ~m_pc~0; {14375#true} is VALID [2022-02-20 19:26:57,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {14375#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {14375#true} is VALID [2022-02-20 19:26:57,967 INFO L290 TraceCheckUtils]: 3: Hoare triple {14375#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {14375#true} is VALID [2022-02-20 19:26:57,967 INFO L290 TraceCheckUtils]: 4: Hoare triple {14375#true} #t~ret32#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp~1#1 := #t~ret32#1;havoc #t~ret32#1; {14375#true} is VALID [2022-02-20 19:26:57,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {14375#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {14375#true} is VALID [2022-02-20 19:26:57,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {14375#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {14375#true} is VALID [2022-02-20 19:26:57,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {14375#true} assume !(1 == ~t1_pc~0); {14375#true} is VALID [2022-02-20 19:26:57,969 INFO L290 TraceCheckUtils]: 8: Hoare triple {14375#true} is_transmit1_triggered_~__retres1~1#1 := 0; {14375#true} is VALID [2022-02-20 19:26:57,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {14375#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {14375#true} is VALID [2022-02-20 19:26:57,971 INFO L290 TraceCheckUtils]: 10: Hoare triple {14375#true} #t~ret33#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp___0~0#1 := #t~ret33#1;havoc #t~ret33#1; {14375#true} is VALID [2022-02-20 19:26:57,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {14375#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {14375#true} is VALID [2022-02-20 19:26:57,971 INFO L290 TraceCheckUtils]: 12: Hoare triple {14375#true} assume true; {14375#true} is VALID [2022-02-20 19:26:57,971 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {14375#true} {14376#false} #10501#return; {14376#false} is VALID [2022-02-20 19:26:57,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:26:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:57,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {14411#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {14375#true} is VALID [2022-02-20 19:26:57,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {14375#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {14375#true} is VALID [2022-02-20 19:26:57,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {14375#true} assume 1 == ~E_M~0;~E_M~0 := 2; {14375#true} is VALID [2022-02-20 19:26:57,977 INFO L290 TraceCheckUtils]: 3: Hoare triple {14375#true} assume 1 == ~E_1~0;~E_1~0 := 2; {14375#true} is VALID [2022-02-20 19:26:57,977 INFO L290 TraceCheckUtils]: 4: Hoare triple {14375#true} assume true; {14375#true} is VALID [2022-02-20 19:26:57,977 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {14375#true} {14376#false} #10503#return; {14376#false} is VALID [2022-02-20 19:26:57,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:26:57,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:57,982 INFO L290 TraceCheckUtils]: 0: Hoare triple {14375#true} havoc ~__retres1~2; {14375#true} is VALID [2022-02-20 19:26:57,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {14375#true} assume 0 == ~m_st~0;~__retres1~2 := 1; {14375#true} is VALID [2022-02-20 19:26:57,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {14375#true} #res := ~__retres1~2; {14375#true} is VALID [2022-02-20 19:26:57,983 INFO L290 TraceCheckUtils]: 3: Hoare triple {14375#true} assume true; {14375#true} is VALID [2022-02-20 19:26:57,983 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {14375#true} {14376#false} #10505#return; {14376#false} is VALID [2022-02-20 19:26:57,985 INFO L290 TraceCheckUtils]: 0: Hoare triple {14375#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(20, 2);call #Ultimate.allocInit(12, 3);~d~0 := 4;~c~0 := 3;~e~0 := 5;~a~0 := 1;~f~0 := 6;~b~0 := 2;~a9~0 := 18;~a27~0 := 1;~a2~0 := 10;~a16~0 := 1;~a15~0 := 1;~a12~0 := 4;~a25~0 := 1;~a20~0 := 5;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {14377#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:26:57,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {14377#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {14377#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:26:57,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {14377#(= ~T1_E~0 ~M_E~0)} assume !(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~3#1;havoc main2_~__retres1~3#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1; {14377#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:26:57,986 INFO L290 TraceCheckUtils]: 3: Hoare triple {14377#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret35#1, start_simulation_#t~ret36#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0; {14377#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:26:57,986 INFO L272 TraceCheckUtils]: 4: Hoare triple {14377#(= ~T1_E~0 ~M_E~0)} call update_channels(); {14375#true} is VALID [2022-02-20 19:26:57,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {14375#true} assume true; {14375#true} is VALID [2022-02-20 19:26:57,993 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {14375#true} {14377#(= ~T1_E~0 ~M_E~0)} #10497#return; {14377#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:26:57,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {14377#(= ~T1_E~0 ~M_E~0)} assume { :begin_inline_init_threads } true; {14377#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:26:57,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {14377#(= ~T1_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {14377#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:26:57,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {14377#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {14377#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:26:57,994 INFO L290 TraceCheckUtils]: 10: Hoare triple {14377#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_threads } true; {14377#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:26:57,995 INFO L272 TraceCheckUtils]: 11: Hoare triple {14377#(= ~T1_E~0 ~M_E~0)} call fire_delta_events(); {14411#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:26:57,995 INFO L290 TraceCheckUtils]: 12: Hoare triple {14411#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {14412#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:26:57,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {14412#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {14413#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:26:57,996 INFO L290 TraceCheckUtils]: 14: Hoare triple {14413#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {14413#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:26:57,996 INFO L290 TraceCheckUtils]: 15: Hoare triple {14413#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {14413#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:26:57,997 INFO L290 TraceCheckUtils]: 16: Hoare triple {14413#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {14413#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:26:57,997 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {14413#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {14377#(= ~T1_E~0 ~M_E~0)} #10499#return; {14376#false} is VALID [2022-02-20 19:26:57,997 INFO L272 TraceCheckUtils]: 18: Hoare triple {14376#false} call activate_threads(); {14414#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:26:57,998 INFO L290 TraceCheckUtils]: 19: Hoare triple {14414#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {14375#true} is VALID [2022-02-20 19:26:57,998 INFO L290 TraceCheckUtils]: 20: Hoare triple {14375#true} assume 1 == ~m_pc~0; {14375#true} is VALID [2022-02-20 19:26:57,998 INFO L290 TraceCheckUtils]: 21: Hoare triple {14375#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {14375#true} is VALID [2022-02-20 19:26:57,998 INFO L290 TraceCheckUtils]: 22: Hoare triple {14375#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {14375#true} is VALID [2022-02-20 19:26:57,998 INFO L290 TraceCheckUtils]: 23: Hoare triple {14375#true} #t~ret32#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp~1#1 := #t~ret32#1;havoc #t~ret32#1; {14375#true} is VALID [2022-02-20 19:26:57,998 INFO L290 TraceCheckUtils]: 24: Hoare triple {14375#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {14375#true} is VALID [2022-02-20 19:26:57,999 INFO L290 TraceCheckUtils]: 25: Hoare triple {14375#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {14375#true} is VALID [2022-02-20 19:26:57,999 INFO L290 TraceCheckUtils]: 26: Hoare triple {14375#true} assume !(1 == ~t1_pc~0); {14375#true} is VALID [2022-02-20 19:26:57,999 INFO L290 TraceCheckUtils]: 27: Hoare triple {14375#true} is_transmit1_triggered_~__retres1~1#1 := 0; {14375#true} is VALID [2022-02-20 19:26:57,999 INFO L290 TraceCheckUtils]: 28: Hoare triple {14375#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {14375#true} is VALID [2022-02-20 19:26:57,999 INFO L290 TraceCheckUtils]: 29: Hoare triple {14375#true} #t~ret33#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp___0~0#1 := #t~ret33#1;havoc #t~ret33#1; {14375#true} is VALID [2022-02-20 19:26:58,000 INFO L290 TraceCheckUtils]: 30: Hoare triple {14375#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {14375#true} is VALID [2022-02-20 19:26:58,000 INFO L290 TraceCheckUtils]: 31: Hoare triple {14375#true} assume true; {14375#true} is VALID [2022-02-20 19:26:58,000 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14375#true} {14376#false} #10501#return; {14376#false} is VALID [2022-02-20 19:26:58,000 INFO L272 TraceCheckUtils]: 33: Hoare triple {14376#false} call reset_delta_events(); {14411#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:26:58,000 INFO L290 TraceCheckUtils]: 34: Hoare triple {14411#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {14375#true} is VALID [2022-02-20 19:26:58,001 INFO L290 TraceCheckUtils]: 35: Hoare triple {14375#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {14375#true} is VALID [2022-02-20 19:26:58,001 INFO L290 TraceCheckUtils]: 36: Hoare triple {14375#true} assume 1 == ~E_M~0;~E_M~0 := 2; {14375#true} is VALID [2022-02-20 19:26:58,001 INFO L290 TraceCheckUtils]: 37: Hoare triple {14375#true} assume 1 == ~E_1~0;~E_1~0 := 2; {14375#true} is VALID [2022-02-20 19:26:58,001 INFO L290 TraceCheckUtils]: 38: Hoare triple {14375#true} assume true; {14375#true} is VALID [2022-02-20 19:26:58,001 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {14375#true} {14376#false} #10503#return; {14376#false} is VALID [2022-02-20 19:26:58,002 INFO L290 TraceCheckUtils]: 40: Hoare triple {14376#false} assume !false; {14376#false} is VALID [2022-02-20 19:26:58,002 INFO L290 TraceCheckUtils]: 41: Hoare triple {14376#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret29#1, eval_#t~nondet30#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet31#1, eval_~tmp_ndt_2~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {14376#false} is VALID [2022-02-20 19:26:58,002 INFO L290 TraceCheckUtils]: 42: Hoare triple {14376#false} assume !false; {14376#false} is VALID [2022-02-20 19:26:58,002 INFO L272 TraceCheckUtils]: 43: Hoare triple {14376#false} call eval_#t~ret29#1 := exists_runnable_thread(); {14375#true} is VALID [2022-02-20 19:26:58,002 INFO L290 TraceCheckUtils]: 44: Hoare triple {14375#true} havoc ~__retres1~2; {14375#true} is VALID [2022-02-20 19:26:58,002 INFO L290 TraceCheckUtils]: 45: Hoare triple {14375#true} assume 0 == ~m_st~0;~__retres1~2 := 1; {14375#true} is VALID [2022-02-20 19:26:58,003 INFO L290 TraceCheckUtils]: 46: Hoare triple {14375#true} #res := ~__retres1~2; {14375#true} is VALID [2022-02-20 19:26:58,003 INFO L290 TraceCheckUtils]: 47: Hoare triple {14375#true} assume true; {14375#true} is VALID [2022-02-20 19:26:58,003 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {14375#true} {14376#false} #10505#return; {14376#false} is VALID [2022-02-20 19:26:58,003 INFO L290 TraceCheckUtils]: 49: Hoare triple {14376#false} assume -2147483648 <= eval_#t~ret29#1 && eval_#t~ret29#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret29#1;havoc eval_#t~ret29#1; {14376#false} is VALID [2022-02-20 19:26:58,003 INFO L290 TraceCheckUtils]: 50: Hoare triple {14376#false} assume 0 != eval_~tmp~0#1; {14376#false} is VALID [2022-02-20 19:26:58,003 INFO L290 TraceCheckUtils]: 51: Hoare triple {14376#false} assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;assume -2147483648 <= eval_#t~nondet30#1 && eval_#t~nondet30#1 <= 2147483647;eval_~tmp_ndt_1~0#1 := eval_#t~nondet30#1;havoc eval_#t~nondet30#1; {14376#false} is VALID [2022-02-20 19:26:58,004 INFO L290 TraceCheckUtils]: 52: Hoare triple {14376#false} assume 0 != eval_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet27#1, master_#t~nondet28#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet27#1 && master_#t~nondet27#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet27#1;havoc master_#t~nondet27#1; {14376#false} is VALID [2022-02-20 19:26:58,004 INFO L290 TraceCheckUtils]: 53: Hoare triple {14376#false} assume !(0 == ~m_pc~0); {14376#false} is VALID [2022-02-20 19:26:58,004 INFO L290 TraceCheckUtils]: 54: Hoare triple {14376#false} assume 1 == ~m_pc~0; {14376#false} is VALID [2022-02-20 19:26:58,004 INFO L290 TraceCheckUtils]: 55: Hoare triple {14376#false} assume ~token~0 != 1 + ~local~0; {14376#false} is VALID [2022-02-20 19:26:58,004 INFO L272 TraceCheckUtils]: 56: Hoare triple {14376#false} call error(); {14376#false} is VALID [2022-02-20 19:26:58,005 INFO L290 TraceCheckUtils]: 57: Hoare triple {14376#false} assume !false; {14376#false} is VALID [2022-02-20 19:26:58,006 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 19:26:58,006 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:26:58,007 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357931751] [2022-02-20 19:26:58,007 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357931751] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:26:58,007 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:26:58,007 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:26:58,008 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750161261] [2022-02-20 19:26:58,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:26:58,009 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-02-20 19:26:58,009 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:26:58,009 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:26:58,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:26:58,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:26:58,041 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:26:58,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:26:58,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:26:58,042 INFO L87 Difference]: Start difference. First operand 2325 states and 4252 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:27:08,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:27:08,394 INFO L93 Difference]: Finished difference Result 2676 states and 4760 transitions. [2022-02-20 19:27:08,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:27:08,395 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-02-20 19:27:08,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:27:08,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:27:08,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4461 transitions. [2022-02-20 19:27:08,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:27:08,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4461 transitions. [2022-02-20 19:27:08,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 4461 transitions. [2022-02-20 19:27:11,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4461 edges. 4461 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:27:11,611 INFO L225 Difference]: With dead ends: 2676 [2022-02-20 19:27:11,612 INFO L226 Difference]: Without dead ends: 2481 [2022-02-20 19:27:11,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:27:11,614 INFO L933 BasicCegarLoop]: 4200 mSDtfsCounter, 4245 mSDsluCounter, 16382 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4253 SdHoareTripleChecker+Valid, 20582 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:27:11,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4253 Valid, 20582 Invalid, 706 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [57 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 19:27:11,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2481 states. [2022-02-20 19:27:11,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2481 to 2415. [2022-02-20 19:27:11,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:27:11,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2481 states. Second operand has 2415 states, 2356 states have (on average 1.8259762308998302) internal successors, (4302), 2361 states have internal predecessors, (4302), 37 states have call successors, (37), 19 states have call predecessors, (37), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2022-02-20 19:27:11,657 INFO L74 IsIncluded]: Start isIncluded. First operand 2481 states. Second operand has 2415 states, 2356 states have (on average 1.8259762308998302) internal successors, (4302), 2361 states have internal predecessors, (4302), 37 states have call successors, (37), 19 states have call predecessors, (37), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2022-02-20 19:27:11,661 INFO L87 Difference]: Start difference. First operand 2481 states. Second operand has 2415 states, 2356 states have (on average 1.8259762308998302) internal successors, (4302), 2361 states have internal predecessors, (4302), 37 states have call successors, (37), 19 states have call predecessors, (37), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2022-02-20 19:27:11,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:27:11,825 INFO L93 Difference]: Finished difference Result 2481 states and 4476 transitions. [2022-02-20 19:27:11,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 4476 transitions. [2022-02-20 19:27:11,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:27:11,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:27:11,845 INFO L74 IsIncluded]: Start isIncluded. First operand has 2415 states, 2356 states have (on average 1.8259762308998302) internal successors, (4302), 2361 states have internal predecessors, (4302), 37 states have call successors, (37), 19 states have call predecessors, (37), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) Second operand 2481 states. [2022-02-20 19:27:11,850 INFO L87 Difference]: Start difference. First operand has 2415 states, 2356 states have (on average 1.8259762308998302) internal successors, (4302), 2361 states have internal predecessors, (4302), 37 states have call successors, (37), 19 states have call predecessors, (37), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) Second operand 2481 states. [2022-02-20 19:27:12,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:27:12,016 INFO L93 Difference]: Finished difference Result 2481 states and 4476 transitions. [2022-02-20 19:27:12,019 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 4476 transitions. [2022-02-20 19:27:12,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:27:12,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:27:12,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:27:12,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:27:12,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2415 states, 2356 states have (on average 1.8259762308998302) internal successors, (4302), 2361 states have internal predecessors, (4302), 37 states have call successors, (37), 19 states have call predecessors, (37), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2022-02-20 19:27:12,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2415 states to 2415 states and 4379 transitions. [2022-02-20 19:27:12,192 INFO L78 Accepts]: Start accepts. Automaton has 2415 states and 4379 transitions. Word has length 58 [2022-02-20 19:27:12,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:27:12,192 INFO L470 AbstractCegarLoop]: Abstraction has 2415 states and 4379 transitions. [2022-02-20 19:27:12,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:27:12,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2415 states and 4379 transitions. [2022-02-20 19:27:12,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 19:27:12,193 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:27:12,193 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:27:12,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:27:12,194 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:27:12,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:27:12,194 INFO L85 PathProgramCache]: Analyzing trace with hash -189256943, now seen corresponding path program 1 times [2022-02-20 19:27:12,194 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:27:12,194 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288691662] [2022-02-20 19:27:12,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:27:12,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:27:12,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:12,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:27:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:12,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {24803#true} assume true; {24803#true} is VALID [2022-02-20 19:27:12,220 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {24803#true} {24805#(= ~E_M~0 ~M_E~0)} #10497#return; {24805#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:27:12,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:27:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:12,247 INFO L290 TraceCheckUtils]: 0: Hoare triple {24839#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {24840#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:27:12,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {24840#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {24840#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:27:12,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {24840#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_M~0;~E_M~0 := 1; {24841#(not (= |old(~E_M~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:27:12,250 INFO L290 TraceCheckUtils]: 3: Hoare triple {24841#(not (= |old(~E_M~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {24841#(not (= |old(~E_M~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:27:12,251 INFO L290 TraceCheckUtils]: 4: Hoare triple {24841#(not (= |old(~E_M~0)| |old(~M_E~0)|))} assume true; {24841#(not (= |old(~E_M~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:27:12,251 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {24841#(not (= |old(~E_M~0)| |old(~M_E~0)|))} {24805#(= ~E_M~0 ~M_E~0)} #10499#return; {24804#false} is VALID [2022-02-20 19:27:12,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:27:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:12,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {24842#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {24803#true} is VALID [2022-02-20 19:27:12,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {24803#true} assume 1 == ~m_pc~0; {24803#true} is VALID [2022-02-20 19:27:12,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {24803#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {24803#true} is VALID [2022-02-20 19:27:12,271 INFO L290 TraceCheckUtils]: 3: Hoare triple {24803#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {24803#true} is VALID [2022-02-20 19:27:12,271 INFO L290 TraceCheckUtils]: 4: Hoare triple {24803#true} #t~ret32#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp~1#1 := #t~ret32#1;havoc #t~ret32#1; {24803#true} is VALID [2022-02-20 19:27:12,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {24803#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {24803#true} is VALID [2022-02-20 19:27:12,272 INFO L290 TraceCheckUtils]: 6: Hoare triple {24803#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {24803#true} is VALID [2022-02-20 19:27:12,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {24803#true} assume !(1 == ~t1_pc~0); {24803#true} is VALID [2022-02-20 19:27:12,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {24803#true} is_transmit1_triggered_~__retres1~1#1 := 0; {24803#true} is VALID [2022-02-20 19:27:12,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {24803#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {24803#true} is VALID [2022-02-20 19:27:12,272 INFO L290 TraceCheckUtils]: 10: Hoare triple {24803#true} #t~ret33#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp___0~0#1 := #t~ret33#1;havoc #t~ret33#1; {24803#true} is VALID [2022-02-20 19:27:12,272 INFO L290 TraceCheckUtils]: 11: Hoare triple {24803#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {24803#true} is VALID [2022-02-20 19:27:12,273 INFO L290 TraceCheckUtils]: 12: Hoare triple {24803#true} assume true; {24803#true} is VALID [2022-02-20 19:27:12,273 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {24803#true} {24804#false} #10501#return; {24804#false} is VALID [2022-02-20 19:27:12,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:27:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:12,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {24839#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {24803#true} is VALID [2022-02-20 19:27:12,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {24803#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {24803#true} is VALID [2022-02-20 19:27:12,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {24803#true} assume 1 == ~E_M~0;~E_M~0 := 2; {24803#true} is VALID [2022-02-20 19:27:12,278 INFO L290 TraceCheckUtils]: 3: Hoare triple {24803#true} assume 1 == ~E_1~0;~E_1~0 := 2; {24803#true} is VALID [2022-02-20 19:27:12,278 INFO L290 TraceCheckUtils]: 4: Hoare triple {24803#true} assume true; {24803#true} is VALID [2022-02-20 19:27:12,278 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {24803#true} {24804#false} #10503#return; {24804#false} is VALID [2022-02-20 19:27:12,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:27:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:12,281 INFO L290 TraceCheckUtils]: 0: Hoare triple {24803#true} havoc ~__retres1~2; {24803#true} is VALID [2022-02-20 19:27:12,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {24803#true} assume 0 == ~m_st~0;~__retres1~2 := 1; {24803#true} is VALID [2022-02-20 19:27:12,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {24803#true} #res := ~__retres1~2; {24803#true} is VALID [2022-02-20 19:27:12,282 INFO L290 TraceCheckUtils]: 3: Hoare triple {24803#true} assume true; {24803#true} is VALID [2022-02-20 19:27:12,282 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {24803#true} {24804#false} #10505#return; {24804#false} is VALID [2022-02-20 19:27:12,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {24803#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(20, 2);call #Ultimate.allocInit(12, 3);~d~0 := 4;~c~0 := 3;~e~0 := 5;~a~0 := 1;~f~0 := 6;~b~0 := 2;~a9~0 := 18;~a27~0 := 1;~a2~0 := 10;~a16~0 := 1;~a15~0 := 1;~a12~0 := 4;~a25~0 := 1;~a20~0 := 5;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {24805#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:27:12,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {24805#(= ~E_M~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {24805#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:27:12,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {24805#(= ~E_M~0 ~M_E~0)} assume !(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~3#1;havoc main2_~__retres1~3#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1; {24805#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:27:12,284 INFO L290 TraceCheckUtils]: 3: Hoare triple {24805#(= ~E_M~0 ~M_E~0)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret35#1, start_simulation_#t~ret36#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0; {24805#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:27:12,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {24805#(= ~E_M~0 ~M_E~0)} call update_channels(); {24803#true} is VALID [2022-02-20 19:27:12,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {24803#true} assume true; {24803#true} is VALID [2022-02-20 19:27:12,285 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {24803#true} {24805#(= ~E_M~0 ~M_E~0)} #10497#return; {24805#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:27:12,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {24805#(= ~E_M~0 ~M_E~0)} assume { :begin_inline_init_threads } true; {24805#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:27:12,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {24805#(= ~E_M~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {24805#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:27:12,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {24805#(= ~E_M~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {24805#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:27:12,286 INFO L290 TraceCheckUtils]: 10: Hoare triple {24805#(= ~E_M~0 ~M_E~0)} assume { :end_inline_init_threads } true; {24805#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:27:12,287 INFO L272 TraceCheckUtils]: 11: Hoare triple {24805#(= ~E_M~0 ~M_E~0)} call fire_delta_events(); {24839#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:27:12,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {24839#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {24840#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:27:12,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {24840#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {24840#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:27:12,288 INFO L290 TraceCheckUtils]: 14: Hoare triple {24840#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_M~0;~E_M~0 := 1; {24841#(not (= |old(~E_M~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:27:12,288 INFO L290 TraceCheckUtils]: 15: Hoare triple {24841#(not (= |old(~E_M~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {24841#(not (= |old(~E_M~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:27:12,288 INFO L290 TraceCheckUtils]: 16: Hoare triple {24841#(not (= |old(~E_M~0)| |old(~M_E~0)|))} assume true; {24841#(not (= |old(~E_M~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:27:12,289 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {24841#(not (= |old(~E_M~0)| |old(~M_E~0)|))} {24805#(= ~E_M~0 ~M_E~0)} #10499#return; {24804#false} is VALID [2022-02-20 19:27:12,289 INFO L272 TraceCheckUtils]: 18: Hoare triple {24804#false} call activate_threads(); {24842#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:27:12,289 INFO L290 TraceCheckUtils]: 19: Hoare triple {24842#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {24803#true} is VALID [2022-02-20 19:27:12,289 INFO L290 TraceCheckUtils]: 20: Hoare triple {24803#true} assume 1 == ~m_pc~0; {24803#true} is VALID [2022-02-20 19:27:12,290 INFO L290 TraceCheckUtils]: 21: Hoare triple {24803#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {24803#true} is VALID [2022-02-20 19:27:12,290 INFO L290 TraceCheckUtils]: 22: Hoare triple {24803#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {24803#true} is VALID [2022-02-20 19:27:12,290 INFO L290 TraceCheckUtils]: 23: Hoare triple {24803#true} #t~ret32#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp~1#1 := #t~ret32#1;havoc #t~ret32#1; {24803#true} is VALID [2022-02-20 19:27:12,290 INFO L290 TraceCheckUtils]: 24: Hoare triple {24803#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {24803#true} is VALID [2022-02-20 19:27:12,290 INFO L290 TraceCheckUtils]: 25: Hoare triple {24803#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {24803#true} is VALID [2022-02-20 19:27:12,290 INFO L290 TraceCheckUtils]: 26: Hoare triple {24803#true} assume !(1 == ~t1_pc~0); {24803#true} is VALID [2022-02-20 19:27:12,291 INFO L290 TraceCheckUtils]: 27: Hoare triple {24803#true} is_transmit1_triggered_~__retres1~1#1 := 0; {24803#true} is VALID [2022-02-20 19:27:12,291 INFO L290 TraceCheckUtils]: 28: Hoare triple {24803#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {24803#true} is VALID [2022-02-20 19:27:12,291 INFO L290 TraceCheckUtils]: 29: Hoare triple {24803#true} #t~ret33#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp___0~0#1 := #t~ret33#1;havoc #t~ret33#1; {24803#true} is VALID [2022-02-20 19:27:12,291 INFO L290 TraceCheckUtils]: 30: Hoare triple {24803#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {24803#true} is VALID [2022-02-20 19:27:12,291 INFO L290 TraceCheckUtils]: 31: Hoare triple {24803#true} assume true; {24803#true} is VALID [2022-02-20 19:27:12,291 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {24803#true} {24804#false} #10501#return; {24804#false} is VALID [2022-02-20 19:27:12,291 INFO L272 TraceCheckUtils]: 33: Hoare triple {24804#false} call reset_delta_events(); {24839#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:27:12,292 INFO L290 TraceCheckUtils]: 34: Hoare triple {24839#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {24803#true} is VALID [2022-02-20 19:27:12,292 INFO L290 TraceCheckUtils]: 35: Hoare triple {24803#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {24803#true} is VALID [2022-02-20 19:27:12,292 INFO L290 TraceCheckUtils]: 36: Hoare triple {24803#true} assume 1 == ~E_M~0;~E_M~0 := 2; {24803#true} is VALID [2022-02-20 19:27:12,292 INFO L290 TraceCheckUtils]: 37: Hoare triple {24803#true} assume 1 == ~E_1~0;~E_1~0 := 2; {24803#true} is VALID [2022-02-20 19:27:12,292 INFO L290 TraceCheckUtils]: 38: Hoare triple {24803#true} assume true; {24803#true} is VALID [2022-02-20 19:27:12,292 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {24803#true} {24804#false} #10503#return; {24804#false} is VALID [2022-02-20 19:27:12,293 INFO L290 TraceCheckUtils]: 40: Hoare triple {24804#false} assume !false; {24804#false} is VALID [2022-02-20 19:27:12,293 INFO L290 TraceCheckUtils]: 41: Hoare triple {24804#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret29#1, eval_#t~nondet30#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet31#1, eval_~tmp_ndt_2~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {24804#false} is VALID [2022-02-20 19:27:12,293 INFO L290 TraceCheckUtils]: 42: Hoare triple {24804#false} assume !false; {24804#false} is VALID [2022-02-20 19:27:12,293 INFO L272 TraceCheckUtils]: 43: Hoare triple {24804#false} call eval_#t~ret29#1 := exists_runnable_thread(); {24803#true} is VALID [2022-02-20 19:27:12,293 INFO L290 TraceCheckUtils]: 44: Hoare triple {24803#true} havoc ~__retres1~2; {24803#true} is VALID [2022-02-20 19:27:12,294 INFO L290 TraceCheckUtils]: 45: Hoare triple {24803#true} assume 0 == ~m_st~0;~__retres1~2 := 1; {24803#true} is VALID [2022-02-20 19:27:12,294 INFO L290 TraceCheckUtils]: 46: Hoare triple {24803#true} #res := ~__retres1~2; {24803#true} is VALID [2022-02-20 19:27:12,294 INFO L290 TraceCheckUtils]: 47: Hoare triple {24803#true} assume true; {24803#true} is VALID [2022-02-20 19:27:12,294 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {24803#true} {24804#false} #10505#return; {24804#false} is VALID [2022-02-20 19:27:12,294 INFO L290 TraceCheckUtils]: 49: Hoare triple {24804#false} assume -2147483648 <= eval_#t~ret29#1 && eval_#t~ret29#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret29#1;havoc eval_#t~ret29#1; {24804#false} is VALID [2022-02-20 19:27:12,294 INFO L290 TraceCheckUtils]: 50: Hoare triple {24804#false} assume 0 != eval_~tmp~0#1; {24804#false} is VALID [2022-02-20 19:27:12,295 INFO L290 TraceCheckUtils]: 51: Hoare triple {24804#false} assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;assume -2147483648 <= eval_#t~nondet30#1 && eval_#t~nondet30#1 <= 2147483647;eval_~tmp_ndt_1~0#1 := eval_#t~nondet30#1;havoc eval_#t~nondet30#1; {24804#false} is VALID [2022-02-20 19:27:12,295 INFO L290 TraceCheckUtils]: 52: Hoare triple {24804#false} assume 0 != eval_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet27#1, master_#t~nondet28#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet27#1 && master_#t~nondet27#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet27#1;havoc master_#t~nondet27#1; {24804#false} is VALID [2022-02-20 19:27:12,295 INFO L290 TraceCheckUtils]: 53: Hoare triple {24804#false} assume !(0 == ~m_pc~0); {24804#false} is VALID [2022-02-20 19:27:12,295 INFO L290 TraceCheckUtils]: 54: Hoare triple {24804#false} assume 1 == ~m_pc~0; {24804#false} is VALID [2022-02-20 19:27:12,295 INFO L290 TraceCheckUtils]: 55: Hoare triple {24804#false} assume ~token~0 != 1 + ~local~0; {24804#false} is VALID [2022-02-20 19:27:12,295 INFO L272 TraceCheckUtils]: 56: Hoare triple {24804#false} call error(); {24804#false} is VALID [2022-02-20 19:27:12,296 INFO L290 TraceCheckUtils]: 57: Hoare triple {24804#false} assume !false; {24804#false} is VALID [2022-02-20 19:27:12,296 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 19:27:12,296 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:27:12,296 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288691662] [2022-02-20 19:27:12,296 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288691662] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:27:12,296 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:27:12,297 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:27:12,297 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086945092] [2022-02-20 19:27:12,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:27:12,297 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-02-20 19:27:12,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:27:12,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:27:12,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:27:12,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:27:12,330 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:27:12,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:27:12,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:27:12,331 INFO L87 Difference]: Start difference. First operand 2415 states and 4379 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:27:22,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:27:22,415 INFO L93 Difference]: Finished difference Result 3027 states and 5257 transitions. [2022-02-20 19:27:22,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 19:27:22,415 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-02-20 19:27:22,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:27:22,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:27:22,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 4498 transitions. [2022-02-20 19:27:22,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:27:22,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 4498 transitions. [2022-02-20 19:27:22,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 4498 transitions. [2022-02-20 19:27:25,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4498 edges. 4498 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:27:25,554 INFO L225 Difference]: With dead ends: 3027 [2022-02-20 19:27:25,554 INFO L226 Difference]: Without dead ends: 2742 [2022-02-20 19:27:25,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:27:25,556 INFO L933 BasicCegarLoop]: 4190 mSDtfsCounter, 4299 mSDsluCounter, 16374 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4309 SdHoareTripleChecker+Valid, 20564 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:27:25,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4309 Valid, 20564 Invalid, 709 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:27:25,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2742 states. [2022-02-20 19:27:25,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2742 to 2590. [2022-02-20 19:27:25,614 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:27:25,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2742 states. Second operand has 2590 states, 2499 states have (on average 1.8043217286914766) internal successors, (4509), 2506 states have internal predecessors, (4509), 55 states have call successors, (55), 31 states have call predecessors, (55), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-02-20 19:27:25,621 INFO L74 IsIncluded]: Start isIncluded. First operand 2742 states. Second operand has 2590 states, 2499 states have (on average 1.8043217286914766) internal successors, (4509), 2506 states have internal predecessors, (4509), 55 states have call successors, (55), 31 states have call predecessors, (55), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-02-20 19:27:25,624 INFO L87 Difference]: Start difference. First operand 2742 states. Second operand has 2590 states, 2499 states have (on average 1.8043217286914766) internal successors, (4509), 2506 states have internal predecessors, (4509), 55 states have call successors, (55), 31 states have call predecessors, (55), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-02-20 19:27:25,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:27:25,812 INFO L93 Difference]: Finished difference Result 2742 states and 4843 transitions. [2022-02-20 19:27:25,812 INFO L276 IsEmpty]: Start isEmpty. Operand 2742 states and 4843 transitions. [2022-02-20 19:27:25,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:27:25,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:27:25,821 INFO L74 IsIncluded]: Start isIncluded. First operand has 2590 states, 2499 states have (on average 1.8043217286914766) internal successors, (4509), 2506 states have internal predecessors, (4509), 55 states have call successors, (55), 31 states have call predecessors, (55), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) Second operand 2742 states. [2022-02-20 19:27:25,823 INFO L87 Difference]: Start difference. First operand has 2590 states, 2499 states have (on average 1.8043217286914766) internal successors, (4509), 2506 states have internal predecessors, (4509), 55 states have call successors, (55), 31 states have call predecessors, (55), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) Second operand 2742 states. [2022-02-20 19:27:26,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:27:26,015 INFO L93 Difference]: Finished difference Result 2742 states and 4843 transitions. [2022-02-20 19:27:26,015 INFO L276 IsEmpty]: Start isEmpty. Operand 2742 states and 4843 transitions. [2022-02-20 19:27:26,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:27:26,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:27:26,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:27:26,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:27:26,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2590 states, 2499 states have (on average 1.8043217286914766) internal successors, (4509), 2506 states have internal predecessors, (4509), 55 states have call successors, (55), 31 states have call predecessors, (55), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-02-20 19:27:26,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 4630 transitions. [2022-02-20 19:27:26,209 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 4630 transitions. Word has length 58 [2022-02-20 19:27:26,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:27:26,210 INFO L470 AbstractCegarLoop]: Abstraction has 2590 states and 4630 transitions. [2022-02-20 19:27:26,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:27:26,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 4630 transitions. [2022-02-20 19:27:26,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 19:27:26,211 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:27:26,211 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:27:26,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:27:26,211 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:27:26,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:27:26,212 INFO L85 PathProgramCache]: Analyzing trace with hash 2056322511, now seen corresponding path program 1 times [2022-02-20 19:27:26,212 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:27:26,212 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656119212] [2022-02-20 19:27:26,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:27:26,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:27:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:26,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:27:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:26,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {36448#true} assume true; {36448#true} is VALID [2022-02-20 19:27:26,237 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {36448#true} {36450#(= ~E_1~0 ~M_E~0)} #10497#return; {36450#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:27:26,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:27:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:26,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {36484#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {36485#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:27:26,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {36485#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {36485#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:27:26,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {36485#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {36485#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:27:26,261 INFO L290 TraceCheckUtils]: 3: Hoare triple {36485#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_1~0;~E_1~0 := 1; {36486#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:27:26,261 INFO L290 TraceCheckUtils]: 4: Hoare triple {36486#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume true; {36486#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:27:26,262 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {36486#(not (= |old(~E_1~0)| |old(~M_E~0)|))} {36450#(= ~E_1~0 ~M_E~0)} #10499#return; {36449#false} is VALID [2022-02-20 19:27:26,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:27:26,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:26,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {36487#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {36448#true} is VALID [2022-02-20 19:27:26,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {36448#true} assume 1 == ~m_pc~0; {36448#true} is VALID [2022-02-20 19:27:26,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {36448#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {36448#true} is VALID [2022-02-20 19:27:26,279 INFO L290 TraceCheckUtils]: 3: Hoare triple {36448#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {36448#true} is VALID [2022-02-20 19:27:26,279 INFO L290 TraceCheckUtils]: 4: Hoare triple {36448#true} #t~ret32#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp~1#1 := #t~ret32#1;havoc #t~ret32#1; {36448#true} is VALID [2022-02-20 19:27:26,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {36448#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {36448#true} is VALID [2022-02-20 19:27:26,279 INFO L290 TraceCheckUtils]: 6: Hoare triple {36448#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {36448#true} is VALID [2022-02-20 19:27:26,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {36448#true} assume !(1 == ~t1_pc~0); {36448#true} is VALID [2022-02-20 19:27:26,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {36448#true} is_transmit1_triggered_~__retres1~1#1 := 0; {36448#true} is VALID [2022-02-20 19:27:26,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {36448#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {36448#true} is VALID [2022-02-20 19:27:26,280 INFO L290 TraceCheckUtils]: 10: Hoare triple {36448#true} #t~ret33#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp___0~0#1 := #t~ret33#1;havoc #t~ret33#1; {36448#true} is VALID [2022-02-20 19:27:26,280 INFO L290 TraceCheckUtils]: 11: Hoare triple {36448#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {36448#true} is VALID [2022-02-20 19:27:26,280 INFO L290 TraceCheckUtils]: 12: Hoare triple {36448#true} assume true; {36448#true} is VALID [2022-02-20 19:27:26,280 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {36448#true} {36449#false} #10501#return; {36449#false} is VALID [2022-02-20 19:27:26,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:27:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:26,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {36484#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {36448#true} is VALID [2022-02-20 19:27:26,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {36448#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {36448#true} is VALID [2022-02-20 19:27:26,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {36448#true} assume 1 == ~E_M~0;~E_M~0 := 2; {36448#true} is VALID [2022-02-20 19:27:26,286 INFO L290 TraceCheckUtils]: 3: Hoare triple {36448#true} assume 1 == ~E_1~0;~E_1~0 := 2; {36448#true} is VALID [2022-02-20 19:27:26,286 INFO L290 TraceCheckUtils]: 4: Hoare triple {36448#true} assume true; {36448#true} is VALID [2022-02-20 19:27:26,286 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {36448#true} {36449#false} #10503#return; {36449#false} is VALID [2022-02-20 19:27:26,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:27:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:26,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {36448#true} havoc ~__retres1~2; {36448#true} is VALID [2022-02-20 19:27:26,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {36448#true} assume 0 == ~m_st~0;~__retres1~2 := 1; {36448#true} is VALID [2022-02-20 19:27:26,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {36448#true} #res := ~__retres1~2; {36448#true} is VALID [2022-02-20 19:27:26,290 INFO L290 TraceCheckUtils]: 3: Hoare triple {36448#true} assume true; {36448#true} is VALID [2022-02-20 19:27:26,290 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {36448#true} {36449#false} #10505#return; {36449#false} is VALID [2022-02-20 19:27:26,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {36448#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(20, 2);call #Ultimate.allocInit(12, 3);~d~0 := 4;~c~0 := 3;~e~0 := 5;~a~0 := 1;~f~0 := 6;~b~0 := 2;~a9~0 := 18;~a27~0 := 1;~a2~0 := 10;~a16~0 := 1;~a15~0 := 1;~a12~0 := 4;~a25~0 := 1;~a20~0 := 5;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {36450#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:27:26,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {36450#(= ~E_1~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {36450#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:27:26,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {36450#(= ~E_1~0 ~M_E~0)} assume !(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~3#1;havoc main2_~__retres1~3#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1; {36450#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:27:26,292 INFO L290 TraceCheckUtils]: 3: Hoare triple {36450#(= ~E_1~0 ~M_E~0)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret35#1, start_simulation_#t~ret36#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0; {36450#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:27:26,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {36450#(= ~E_1~0 ~M_E~0)} call update_channels(); {36448#true} is VALID [2022-02-20 19:27:26,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {36448#true} assume true; {36448#true} is VALID [2022-02-20 19:27:26,293 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {36448#true} {36450#(= ~E_1~0 ~M_E~0)} #10497#return; {36450#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:27:26,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {36450#(= ~E_1~0 ~M_E~0)} assume { :begin_inline_init_threads } true; {36450#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:27:26,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {36450#(= ~E_1~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {36450#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:27:26,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {36450#(= ~E_1~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {36450#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:27:26,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {36450#(= ~E_1~0 ~M_E~0)} assume { :end_inline_init_threads } true; {36450#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:27:26,295 INFO L272 TraceCheckUtils]: 11: Hoare triple {36450#(= ~E_1~0 ~M_E~0)} call fire_delta_events(); {36484#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:27:26,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {36484#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {36485#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:27:26,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {36485#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {36485#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:27:26,296 INFO L290 TraceCheckUtils]: 14: Hoare triple {36485#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {36485#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:27:26,296 INFO L290 TraceCheckUtils]: 15: Hoare triple {36485#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_1~0;~E_1~0 := 1; {36486#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:27:26,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {36486#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume true; {36486#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:27:26,297 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {36486#(not (= |old(~E_1~0)| |old(~M_E~0)|))} {36450#(= ~E_1~0 ~M_E~0)} #10499#return; {36449#false} is VALID [2022-02-20 19:27:26,297 INFO L272 TraceCheckUtils]: 18: Hoare triple {36449#false} call activate_threads(); {36487#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:27:26,297 INFO L290 TraceCheckUtils]: 19: Hoare triple {36487#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {36448#true} is VALID [2022-02-20 19:27:26,297 INFO L290 TraceCheckUtils]: 20: Hoare triple {36448#true} assume 1 == ~m_pc~0; {36448#true} is VALID [2022-02-20 19:27:26,297 INFO L290 TraceCheckUtils]: 21: Hoare triple {36448#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {36448#true} is VALID [2022-02-20 19:27:26,297 INFO L290 TraceCheckUtils]: 22: Hoare triple {36448#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {36448#true} is VALID [2022-02-20 19:27:26,298 INFO L290 TraceCheckUtils]: 23: Hoare triple {36448#true} #t~ret32#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp~1#1 := #t~ret32#1;havoc #t~ret32#1; {36448#true} is VALID [2022-02-20 19:27:26,298 INFO L290 TraceCheckUtils]: 24: Hoare triple {36448#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {36448#true} is VALID [2022-02-20 19:27:26,298 INFO L290 TraceCheckUtils]: 25: Hoare triple {36448#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {36448#true} is VALID [2022-02-20 19:27:26,298 INFO L290 TraceCheckUtils]: 26: Hoare triple {36448#true} assume !(1 == ~t1_pc~0); {36448#true} is VALID [2022-02-20 19:27:26,298 INFO L290 TraceCheckUtils]: 27: Hoare triple {36448#true} is_transmit1_triggered_~__retres1~1#1 := 0; {36448#true} is VALID [2022-02-20 19:27:26,298 INFO L290 TraceCheckUtils]: 28: Hoare triple {36448#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {36448#true} is VALID [2022-02-20 19:27:26,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {36448#true} #t~ret33#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp___0~0#1 := #t~ret33#1;havoc #t~ret33#1; {36448#true} is VALID [2022-02-20 19:27:26,299 INFO L290 TraceCheckUtils]: 30: Hoare triple {36448#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {36448#true} is VALID [2022-02-20 19:27:26,299 INFO L290 TraceCheckUtils]: 31: Hoare triple {36448#true} assume true; {36448#true} is VALID [2022-02-20 19:27:26,299 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {36448#true} {36449#false} #10501#return; {36449#false} is VALID [2022-02-20 19:27:26,299 INFO L272 TraceCheckUtils]: 33: Hoare triple {36449#false} call reset_delta_events(); {36484#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:27:26,299 INFO L290 TraceCheckUtils]: 34: Hoare triple {36484#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {36448#true} is VALID [2022-02-20 19:27:26,299 INFO L290 TraceCheckUtils]: 35: Hoare triple {36448#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {36448#true} is VALID [2022-02-20 19:27:26,299 INFO L290 TraceCheckUtils]: 36: Hoare triple {36448#true} assume 1 == ~E_M~0;~E_M~0 := 2; {36448#true} is VALID [2022-02-20 19:27:26,300 INFO L290 TraceCheckUtils]: 37: Hoare triple {36448#true} assume 1 == ~E_1~0;~E_1~0 := 2; {36448#true} is VALID [2022-02-20 19:27:26,300 INFO L290 TraceCheckUtils]: 38: Hoare triple {36448#true} assume true; {36448#true} is VALID [2022-02-20 19:27:26,300 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {36448#true} {36449#false} #10503#return; {36449#false} is VALID [2022-02-20 19:27:26,300 INFO L290 TraceCheckUtils]: 40: Hoare triple {36449#false} assume !false; {36449#false} is VALID [2022-02-20 19:27:26,300 INFO L290 TraceCheckUtils]: 41: Hoare triple {36449#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret29#1, eval_#t~nondet30#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet31#1, eval_~tmp_ndt_2~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {36449#false} is VALID [2022-02-20 19:27:26,300 INFO L290 TraceCheckUtils]: 42: Hoare triple {36449#false} assume !false; {36449#false} is VALID [2022-02-20 19:27:26,300 INFO L272 TraceCheckUtils]: 43: Hoare triple {36449#false} call eval_#t~ret29#1 := exists_runnable_thread(); {36448#true} is VALID [2022-02-20 19:27:26,301 INFO L290 TraceCheckUtils]: 44: Hoare triple {36448#true} havoc ~__retres1~2; {36448#true} is VALID [2022-02-20 19:27:26,301 INFO L290 TraceCheckUtils]: 45: Hoare triple {36448#true} assume 0 == ~m_st~0;~__retres1~2 := 1; {36448#true} is VALID [2022-02-20 19:27:26,301 INFO L290 TraceCheckUtils]: 46: Hoare triple {36448#true} #res := ~__retres1~2; {36448#true} is VALID [2022-02-20 19:27:26,301 INFO L290 TraceCheckUtils]: 47: Hoare triple {36448#true} assume true; {36448#true} is VALID [2022-02-20 19:27:26,301 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {36448#true} {36449#false} #10505#return; {36449#false} is VALID [2022-02-20 19:27:26,301 INFO L290 TraceCheckUtils]: 49: Hoare triple {36449#false} assume -2147483648 <= eval_#t~ret29#1 && eval_#t~ret29#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret29#1;havoc eval_#t~ret29#1; {36449#false} is VALID [2022-02-20 19:27:26,301 INFO L290 TraceCheckUtils]: 50: Hoare triple {36449#false} assume 0 != eval_~tmp~0#1; {36449#false} is VALID [2022-02-20 19:27:26,302 INFO L290 TraceCheckUtils]: 51: Hoare triple {36449#false} assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;assume -2147483648 <= eval_#t~nondet30#1 && eval_#t~nondet30#1 <= 2147483647;eval_~tmp_ndt_1~0#1 := eval_#t~nondet30#1;havoc eval_#t~nondet30#1; {36449#false} is VALID [2022-02-20 19:27:26,302 INFO L290 TraceCheckUtils]: 52: Hoare triple {36449#false} assume 0 != eval_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet27#1, master_#t~nondet28#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet27#1 && master_#t~nondet27#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet27#1;havoc master_#t~nondet27#1; {36449#false} is VALID [2022-02-20 19:27:26,302 INFO L290 TraceCheckUtils]: 53: Hoare triple {36449#false} assume !(0 == ~m_pc~0); {36449#false} is VALID [2022-02-20 19:27:26,302 INFO L290 TraceCheckUtils]: 54: Hoare triple {36449#false} assume 1 == ~m_pc~0; {36449#false} is VALID [2022-02-20 19:27:26,302 INFO L290 TraceCheckUtils]: 55: Hoare triple {36449#false} assume ~token~0 != 1 + ~local~0; {36449#false} is VALID [2022-02-20 19:27:26,302 INFO L272 TraceCheckUtils]: 56: Hoare triple {36449#false} call error(); {36449#false} is VALID [2022-02-20 19:27:26,302 INFO L290 TraceCheckUtils]: 57: Hoare triple {36449#false} assume !false; {36449#false} is VALID [2022-02-20 19:27:26,303 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 19:27:26,303 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:27:26,303 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656119212] [2022-02-20 19:27:26,303 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656119212] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:27:26,303 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:27:26,303 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:27:26,304 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257155299] [2022-02-20 19:27:26,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:27:26,304 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-02-20 19:27:26,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:27:26,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:27:26,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:27:26,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:27:26,337 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:27:26,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:27:26,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:27:26,338 INFO L87 Difference]: Start difference. First operand 2590 states and 4630 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)