/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-2+token_ring.05.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 08:22:26,265 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 08:22:26,266 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 08:22:26,321 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 08:22:26,322 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 08:22:26,322 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 08:22:26,323 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 08:22:26,324 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 08:22:26,326 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 08:22:26,326 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 08:22:26,327 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 08:22:26,328 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 08:22:26,328 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 08:22:26,328 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 08:22:26,329 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 08:22:26,330 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 08:22:26,330 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 08:22:26,334 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 08:22:26,339 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 08:22:26,343 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 08:22:26,345 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 08:22:26,348 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 08:22:26,350 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 08:22:26,351 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 08:22:26,356 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 08:22:26,356 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 08:22:26,356 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 08:22:26,357 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 08:22:26,357 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 08:22:26,358 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 08:22:26,358 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 08:22:26,358 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 08:22:26,359 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 08:22:26,359 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 08:22:26,360 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 08:22:26,360 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 08:22:26,360 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 08:22:26,360 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 08:22:26,360 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 08:22:26,361 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 08:22:26,361 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 08:22:26,365 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 08:22:26,390 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 08:22:26,390 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 08:22:26,391 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 08:22:26,391 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 08:22:26,391 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 08:22:26,392 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 08:22:26,392 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 08:22:26,392 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 08:22:26,392 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 08:22:26,392 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 08:22:26,393 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 08:22:26,393 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 08:22:26,393 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 08:22:26,393 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 08:22:26,393 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 08:22:26,394 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 08:22:26,394 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 08:22:26,394 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 08:22:26,394 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 08:22:26,394 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 08:22:26,394 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 08:22:26,394 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 08:22:26,394 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 08:22:26,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 08:22:26,395 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 08:22:26,395 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 08:22:26,395 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 08:22:26,395 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 08:22:26,396 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 08:22:26,396 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 08:22:26,396 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 08:22:26,396 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 08:22:26,396 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 08:22:26,396 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 08:22:26,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 08:22:26,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 08:22:26,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 08:22:26,574 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 08:22:26,574 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 08:22:26,575 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-2+token_ring.05.cil-1.c [2022-01-10 08:22:26,633 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a24d8de40/77e388851e4849de90c869b8c5d995f6/FLAGf886b874d [2022-01-10 08:22:27,037 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 08:22:27,037 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-2+token_ring.05.cil-1.c [2022-01-10 08:22:27,061 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a24d8de40/77e388851e4849de90c869b8c5d995f6/FLAGf886b874d [2022-01-10 08:22:27,072 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a24d8de40/77e388851e4849de90c869b8c5d995f6 [2022-01-10 08:22:27,074 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 08:22:27,076 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 08:22:27,078 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 08:22:27,078 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 08:22:27,080 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 08:22:27,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:22:27" (1/1) ... [2022-01-10 08:22:27,081 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1582ee73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:22:27, skipping insertion in model container [2022-01-10 08:22:27,081 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:22:27" (1/1) ... [2022-01-10 08:22:27,086 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 08:22:27,145 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 08:22:27,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-2+token_ring.05.cil-1.c[914,927] [2022-01-10 08:22:27,328 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-2+token_ring.05.cil-1.c[7125,7138] [2022-01-10 08:22:27,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 08:22:27,387 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 08:22:27,397 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-2+token_ring.05.cil-1.c[914,927] [2022-01-10 08:22:27,420 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-2+token_ring.05.cil-1.c[7125,7138] [2022-01-10 08:22:27,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 08:22:27,454 INFO L208 MainTranslator]: Completed translation [2022-01-10 08:22:27,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:22:27 WrapperNode [2022-01-10 08:22:27,455 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 08:22:27,456 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 08:22:27,456 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 08:22:27,456 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 08:22:27,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:22:27" (1/1) ... [2022-01-10 08:22:27,471 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:22:27" (1/1) ... [2022-01-10 08:22:27,495 INFO L137 Inliner]: procedures = 64, calls = 73, calls flagged for inlining = 32, calls inlined = 32, statements flattened = 610 [2022-01-10 08:22:27,496 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 08:22:27,496 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 08:22:27,496 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 08:22:27,496 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 08:22:27,502 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:22:27" (1/1) ... [2022-01-10 08:22:27,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:22:27" (1/1) ... [2022-01-10 08:22:27,506 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:22:27" (1/1) ... [2022-01-10 08:22:27,506 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:22:27" (1/1) ... [2022-01-10 08:22:27,518 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:22:27" (1/1) ... [2022-01-10 08:22:27,525 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:22:27" (1/1) ... [2022-01-10 08:22:27,527 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:22:27" (1/1) ... [2022-01-10 08:22:27,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 08:22:27,530 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 08:22:27,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 08:22:27,531 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 08:22:27,531 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:22:27" (1/1) ... [2022-01-10 08:22:27,548 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 08:22:27,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 08:22:27,567 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-01-10 08:22:27,572 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-01-10 08:22:27,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 08:22:27,597 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-01-10 08:22:27,597 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-01-10 08:22:27,597 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-01-10 08:22:27,597 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-01-10 08:22:27,599 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-01-10 08:22:27,599 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-01-10 08:22:27,599 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-01-10 08:22:27,599 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-01-10 08:22:27,599 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-01-10 08:22:27,599 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-01-10 08:22:27,599 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-01-10 08:22:27,599 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-01-10 08:22:27,599 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-01-10 08:22:27,599 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-01-10 08:22:27,600 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-01-10 08:22:27,600 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-01-10 08:22:27,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 08:22:27,600 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-01-10 08:22:27,600 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-01-10 08:22:27,600 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-01-10 08:22:27,600 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-01-10 08:22:27,600 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-01-10 08:22:27,600 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-01-10 08:22:27,600 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-01-10 08:22:27,600 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-01-10 08:22:27,600 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-01-10 08:22:27,600 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-01-10 08:22:27,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 08:22:27,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 08:22:27,601 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-01-10 08:22:27,601 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-01-10 08:22:27,685 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 08:22:27,686 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 08:22:28,115 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 08:22:28,121 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 08:22:28,121 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2022-01-10 08:22:28,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:22:28 BoogieIcfgContainer [2022-01-10 08:22:28,123 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 08:22:28,124 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 08:22:28,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 08:22:28,126 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 08:22:28,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 08:22:27" (1/3) ... [2022-01-10 08:22:28,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1213d096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:22:28, skipping insertion in model container [2022-01-10 08:22:28,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:22:27" (2/3) ... [2022-01-10 08:22:28,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1213d096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:22:28, skipping insertion in model container [2022-01-10 08:22:28,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:22:28" (3/3) ... [2022-01-10 08:22:28,127 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.05.cil-1.c [2022-01-10 08:22:28,130 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 08:22:28,130 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-10 08:22:28,158 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 08:22:28,162 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-01-10 08:22:28,162 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-10 08:22:28,179 INFO L276 IsEmpty]: Start isEmpty. Operand has 309 states, 258 states have (on average 1.5968992248062015) internal successors, (412), 265 states have internal predecessors, (412), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2022-01-10 08:22:28,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-10 08:22:28,187 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:22:28,188 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, 1] [2022-01-10 08:22:28,188 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:22:28,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:22:28,195 INFO L85 PathProgramCache]: Analyzing trace with hash 961710808, now seen corresponding path program 1 times [2022-01-10 08:22:28,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:22:28,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [959922504] [2022-01-10 08:22:28,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:22:28,205 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:22:28,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:22:28,207 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:22:28,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 08:22:28,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:22:28,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:22:28,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:22:28,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 08:22:28,456 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:22:28,457 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:22:28,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [959922504] [2022-01-10 08:22:28,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [959922504] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:22:28,457 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:22:28,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:22:28,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236522776] [2022-01-10 08:22:28,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:22:28,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:22:28,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:22:28,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:22:28,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:22:28,540 INFO L87 Difference]: Start difference. First operand has 309 states, 258 states have (on average 1.5968992248062015) internal successors, (412), 265 states have internal predecessors, (412), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 08:22:28,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:22:28,609 INFO L93 Difference]: Finished difference Result 597 states and 925 transitions. [2022-01-10 08:22:28,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:22:28,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-01-10 08:22:28,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:22:28,620 INFO L225 Difference]: With dead ends: 597 [2022-01-10 08:22:28,621 INFO L226 Difference]: Without dead ends: 299 [2022-01-10 08:22:28,624 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:22:28,626 INFO L933 BasicCegarLoop]: 447 mSDtfsCounter, 128 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 08:22:28,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 760 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:22:28,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-01-10 08:22:28,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2022-01-10 08:22:28,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 250 states have (on average 1.5) internal successors, (375), 255 states have internal predecessors, (375), 34 states have call successors, (34), 14 states have call predecessors, (34), 13 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-01-10 08:22:28,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 440 transitions. [2022-01-10 08:22:28,695 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 440 transitions. Word has length 59 [2022-01-10 08:22:28,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:22:28,696 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 440 transitions. [2022-01-10 08:22:28,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 08:22:28,697 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 440 transitions. [2022-01-10 08:22:28,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-10 08:22:28,705 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:22:28,705 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, 1] [2022-01-10 08:22:28,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-01-10 08:22:28,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:22:28,933 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:22:28,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:22:28,936 INFO L85 PathProgramCache]: Analyzing trace with hash 977229526, now seen corresponding path program 1 times [2022-01-10 08:22:28,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:22:28,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1801080200] [2022-01-10 08:22:28,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:22:28,938 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:22:28,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:22:28,940 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:22:28,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 08:22:29,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:22:29,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 08:22:29,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:22:29,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 08:22:29,140 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:22:29,140 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:22:29,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1801080200] [2022-01-10 08:22:29,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1801080200] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:22:29,140 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:22:29,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 08:22:29,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171156261] [2022-01-10 08:22:29,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:22:29,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 08:22:29,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:22:29,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 08:22:29,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:22:29,142 INFO L87 Difference]: Start difference. First operand 299 states and 440 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 08:22:29,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:22:29,568 INFO L93 Difference]: Finished difference Result 492 states and 710 transitions. [2022-01-10 08:22:29,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 08:22:29,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-01-10 08:22:29,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:22:29,573 INFO L225 Difference]: With dead ends: 492 [2022-01-10 08:22:29,573 INFO L226 Difference]: Without dead ends: 403 [2022-01-10 08:22:29,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 08:22:29,574 INFO L933 BasicCegarLoop]: 443 mSDtfsCounter, 332 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 08:22:29,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [339 Valid, 1119 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 08:22:29,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-01-10 08:22:29,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 395. [2022-01-10 08:22:29,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 326 states have (on average 1.469325153374233) internal successors, (479), 333 states have internal predecessors, (479), 45 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (47), 43 states have call predecessors, (47), 42 states have call successors, (47) [2022-01-10 08:22:29,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 571 transitions. [2022-01-10 08:22:29,592 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 571 transitions. Word has length 59 [2022-01-10 08:22:29,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:22:29,593 INFO L470 AbstractCegarLoop]: Abstraction has 395 states and 571 transitions. [2022-01-10 08:22:29,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 08:22:29,593 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 571 transitions. [2022-01-10 08:22:29,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-10 08:22:29,594 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:22:29,594 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, 1] [2022-01-10 08:22:29,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-01-10 08:22:29,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:22:29,800 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:22:29,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:22:29,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1739879157, now seen corresponding path program 1 times [2022-01-10 08:22:29,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:22:29,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1530580901] [2022-01-10 08:22:29,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:22:29,802 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:22:29,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:22:29,803 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:22:29,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 08:22:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:22:29,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 08:22:29,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:22:29,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 08:22:29,973 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:22:29,973 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:22:29,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1530580901] [2022-01-10 08:22:29,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1530580901] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:22:29,973 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:22:29,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 08:22:29,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595423280] [2022-01-10 08:22:29,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:22:29,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 08:22:29,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:22:29,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 08:22:29,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:22:29,975 INFO L87 Difference]: Start difference. First operand 395 states and 571 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 08:22:30,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:22:30,405 INFO L93 Difference]: Finished difference Result 789 states and 1125 transitions. [2022-01-10 08:22:30,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 08:22:30,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-01-10 08:22:30,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:22:30,409 INFO L225 Difference]: With dead ends: 789 [2022-01-10 08:22:30,410 INFO L226 Difference]: Without dead ends: 609 [2022-01-10 08:22:30,411 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 08:22:30,411 INFO L933 BasicCegarLoop]: 446 mSDtfsCounter, 324 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 08:22:30,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [331 Valid, 1124 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 08:22:30,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2022-01-10 08:22:30,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 600. [2022-01-10 08:22:30,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 487 states have (on average 1.4229979466119096) internal successors, (693), 502 states have internal predecessors, (693), 67 states have call successors, (67), 35 states have call predecessors, (67), 44 states have return successors, (89), 67 states have call predecessors, (89), 64 states have call successors, (89) [2022-01-10 08:22:30,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 849 transitions. [2022-01-10 08:22:30,451 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 849 transitions. Word has length 59 [2022-01-10 08:22:30,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:22:30,451 INFO L470 AbstractCegarLoop]: Abstraction has 600 states and 849 transitions. [2022-01-10 08:22:30,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 08:22:30,452 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 849 transitions. [2022-01-10 08:22:30,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-10 08:22:30,453 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:22:30,453 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, 1] [2022-01-10 08:22:30,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-01-10 08:22:30,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:22:30,659 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:22:30,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:22:30,659 INFO L85 PathProgramCache]: Analyzing trace with hash 639220789, now seen corresponding path program 1 times [2022-01-10 08:22:30,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:22:30,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1336760853] [2022-01-10 08:22:30,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:22:30,660 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:22:30,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:22:30,661 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:22:30,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 08:22:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:22:30,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 08:22:30,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:22:30,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 08:22:30,830 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:22:30,830 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:22:30,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1336760853] [2022-01-10 08:22:30,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1336760853] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:22:30,830 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:22:30,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 08:22:30,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474541390] [2022-01-10 08:22:30,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:22:30,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 08:22:30,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:22:30,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 08:22:30,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 08:22:30,832 INFO L87 Difference]: Start difference. First operand 600 states and 849 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 08:22:30,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:22:30,869 INFO L93 Difference]: Finished difference Result 991 states and 1382 transitions. [2022-01-10 08:22:30,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 08:22:30,870 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-01-10 08:22:30,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:22:30,872 INFO L225 Difference]: With dead ends: 991 [2022-01-10 08:22:30,873 INFO L226 Difference]: Without dead ends: 620 [2022-01-10 08:22:30,874 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 08:22:30,874 INFO L933 BasicCegarLoop]: 438 mSDtfsCounter, 7 mSDsluCounter, 1746 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2184 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 08:22:30,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 2184 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:22:30,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2022-01-10 08:22:30,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 610. [2022-01-10 08:22:30,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 495 states have (on average 1.412121212121212) internal successors, (699), 510 states have internal predecessors, (699), 67 states have call successors, (67), 35 states have call predecessors, (67), 46 states have return successors, (91), 69 states have call predecessors, (91), 64 states have call successors, (91) [2022-01-10 08:22:30,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 857 transitions. [2022-01-10 08:22:30,896 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 857 transitions. Word has length 59 [2022-01-10 08:22:30,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:22:30,897 INFO L470 AbstractCegarLoop]: Abstraction has 610 states and 857 transitions. [2022-01-10 08:22:30,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 08:22:30,897 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 857 transitions. [2022-01-10 08:22:30,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-10 08:22:30,898 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:22:30,898 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, 1] [2022-01-10 08:22:30,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-01-10 08:22:31,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:22:31,105 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:22:31,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:22:31,106 INFO L85 PathProgramCache]: Analyzing trace with hash 913980403, now seen corresponding path program 1 times [2022-01-10 08:22:31,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:22:31,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1795139957] [2022-01-10 08:22:31,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:22:31,106 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:22:31,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:22:31,107 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:22:31,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 08:22:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:22:31,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 08:22:31,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:22:31,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 08:22:31,284 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:22:31,284 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:22:31,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1795139957] [2022-01-10 08:22:31,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1795139957] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:22:31,284 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:22:31,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 08:22:31,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663699679] [2022-01-10 08:22:31,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:22:31,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 08:22:31,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:22:31,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 08:22:31,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 08:22:31,286 INFO L87 Difference]: Start difference. First operand 610 states and 857 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 08:22:31,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:22:31,319 INFO L93 Difference]: Finished difference Result 1005 states and 1388 transitions. [2022-01-10 08:22:31,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 08:22:31,320 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-01-10 08:22:31,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:22:31,322 INFO L225 Difference]: With dead ends: 1005 [2022-01-10 08:22:31,322 INFO L226 Difference]: Without dead ends: 624 [2022-01-10 08:22:31,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 08:22:31,323 INFO L933 BasicCegarLoop]: 438 mSDtfsCounter, 4 mSDsluCounter, 1747 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2185 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 08:22:31,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 2185 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:22:31,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2022-01-10 08:22:31,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 620. [2022-01-10 08:22:31,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 503 states have (on average 1.4015904572564613) internal successors, (705), 518 states have internal predecessors, (705), 67 states have call successors, (67), 35 states have call predecessors, (67), 48 states have return successors, (93), 71 states have call predecessors, (93), 64 states have call successors, (93) [2022-01-10 08:22:31,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 865 transitions. [2022-01-10 08:22:31,343 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 865 transitions. Word has length 59 [2022-01-10 08:22:31,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:22:31,343 INFO L470 AbstractCegarLoop]: Abstraction has 620 states and 865 transitions. [2022-01-10 08:22:31,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 08:22:31,343 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 865 transitions. [2022-01-10 08:22:31,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-10 08:22:31,344 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:22:31,344 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, 1] [2022-01-10 08:22:31,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-01-10 08:22:31,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:22:31,551 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:22:31,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:22:31,552 INFO L85 PathProgramCache]: Analyzing trace with hash -891457931, now seen corresponding path program 1 times [2022-01-10 08:22:31,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:22:31,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629406684] [2022-01-10 08:22:31,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:22:31,552 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:22:31,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:22:31,553 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:22:31,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 08:22:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 08:22:31,660 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 08:22:31,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 08:22:31,827 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-01-10 08:22:31,827 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 08:22:31,828 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-01-10 08:22:31,829 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-01-10 08:22:31,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-01-10 08:22:32,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:22:32,038 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-01-10 08:22:32,040 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 08:22:32,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 08:22:32 BoogieIcfgContainer [2022-01-10 08:22:32,145 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 08:22:32,145 INFO L158 Benchmark]: Toolchain (without parser) took 5069.54ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 124.0MB in the beginning and 180.9MB in the end (delta: -56.9MB). Peak memory consumption was 88.3MB. Max. memory is 8.0GB. [2022-01-10 08:22:32,145 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 176.2MB. Free memory is still 140.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 08:22:32,145 INFO L158 Benchmark]: CACSL2BoogieTranslator took 377.38ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 123.8MB in the beginning and 179.9MB in the end (delta: -56.1MB). Peak memory consumption was 6.2MB. Max. memory is 8.0GB. [2022-01-10 08:22:32,146 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.95ms. Allocated memory is still 211.8MB. Free memory was 179.9MB in the beginning and 176.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-01-10 08:22:32,146 INFO L158 Benchmark]: Boogie Preprocessor took 33.90ms. Allocated memory is still 211.8MB. Free memory was 176.5MB in the beginning and 173.6MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 08:22:32,146 INFO L158 Benchmark]: RCFGBuilder took 592.30ms. Allocated memory is still 211.8MB. Free memory was 173.3MB in the beginning and 141.4MB in the end (delta: 31.9MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-01-10 08:22:32,146 INFO L158 Benchmark]: TraceAbstraction took 4020.99ms. Allocated memory is still 211.8MB. Free memory was 140.8MB in the beginning and 180.9MB in the end (delta: -40.1MB). Peak memory consumption was 69.6MB. Max. memory is 8.0GB. [2022-01-10 08:22:32,147 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 176.2MB. Free memory is still 140.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 377.38ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 123.8MB in the beginning and 179.9MB in the end (delta: -56.1MB). Peak memory consumption was 6.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.95ms. Allocated memory is still 211.8MB. Free memory was 179.9MB in the beginning and 176.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.90ms. Allocated memory is still 211.8MB. Free memory was 176.5MB in the beginning and 173.6MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 592.30ms. Allocated memory is still 211.8MB. Free memory was 173.3MB in the beginning and 141.4MB in the end (delta: 31.9MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 4020.99ms. Allocated memory is still 211.8MB. Free memory was 140.8MB in the beginning and 180.9MB in the end (delta: -40.1MB). Peak memory consumption was 69.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 28]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int t2_pc = 0; [L503] int t3_pc = 0; [L504] int t4_pc = 0; [L505] int t5_pc = 0; [L506] int m_st ; [L507] int t1_st ; [L508] int t2_st ; [L509] int t3_st ; [L510] int t4_st ; [L511] int t5_st ; [L512] int m_i ; [L513] int t1_i ; [L514] int t2_i ; [L515] int t3_i ; [L516] int t4_i ; [L517] int t5_i ; [L518] int M_E = 2; [L519] int T1_E = 2; [L520] int T2_E = 2; [L521] int T3_E = 2; [L522] int T4_E = 2; [L523] int T5_E = 2; [L524] int E_M = 2; [L525] int E_1 = 2; [L526] int E_2 = 2; [L527] int E_3 = 2; [L528] int E_4 = 2; [L529] int E_5 = 2; [L537] int token ; [L539] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L1462] COND TRUE __VERIFIER_nondet_int() [L1463] CALL main1() [L474] int __retres1 ; [L478] CALL init_model1() [L460] q_free = 1 [L461] q_write_ev = 2 [L462] q_read_ev = q_write_ev [L463] p_num_write = 0 [L464] p_dw_pc = 0 [L465] p_dw_i = 1 [L466] c_num_read = 0 [L467] c_dr_pc = 0 [L468] c_dr_i = 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L478] RET init_model1() [L479] CALL start_simulation1() [L414] int kernel_st ; [L415] int tmp ; [L419] kernel_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L420] CALL update_channels1() VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L230] COND FALSE !((int )q_req_up == 1) VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L420] RET update_channels1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L421] CALL init_threads1() [L245] COND TRUE (int )p_dw_i == 1 [L246] p_dw_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L250] COND TRUE (int )c_dr_i == 1 [L251] c_dr_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L421] RET init_threads1() [L422] CALL fire_delta_events1() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L283] COND FALSE !((int )q_read_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L288] COND FALSE !((int )q_write_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L422] RET fire_delta_events1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L423] CALL activate_threads1() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L316] int tmp ; [L317] int tmp___0 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L321] CALL, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L70] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L73] COND FALSE !((int )p_dw_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L83] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L85] return (__retres1); VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L321] RET, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, is_do_write_p_triggered()=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L321] tmp = is_do_write_p_triggered() [L323] COND FALSE !(\read(tmp)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, tmp=0, token=0] [L329] CALL, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L89] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L92] COND FALSE !((int )c_dr_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L102] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L104] return (__retres1); VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L329] RET, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, is_do_read_c_triggered()=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, tmp=0, token=0] [L329] tmp___0 = is_do_read_c_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, tmp=0, tmp___0=0, token=0] [L423] RET activate_threads1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L424] CALL reset_delta_events1() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L301] COND FALSE !((int )q_read_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L306] COND FALSE !((int )q_write_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L424] RET reset_delta_events1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L427] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L430] kernel_st = 1 [L431] CALL eval1() [L341] int tmp ; [L342] int tmp___0 ; [L343] int tmp___1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L347] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L350] CALL, EXPR exists_runnable_thread1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L260] int __retres1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L263] COND TRUE (int )p_dw_st == 0 [L264] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L276] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L350] RET, EXPR exists_runnable_thread1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, exists_runnable_thread1()=1, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L350] tmp___1 = exists_runnable_thread1() [L352] COND TRUE \read(tmp___1) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, tmp___1=1, token=0] [L357] COND TRUE (int )p_dw_st == 0 [L359] tmp = __VERIFIER_nondet_int() [L361] COND FALSE !(\read(tmp)) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, tmp=0, tmp___1=1, token=0] [L367] CALL error1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L28] reach_error() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] - UnprovableResult [Line: 496]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 309 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 810 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 795 mSDsluCounter, 7372 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5160 mSDsCounter, 118 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1039 IncrementalHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 118 mSolverCounterUnsat, 2212 mSDtfsCounter, 1039 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 294 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=620occurred in iteration=5, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 31 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 354 NumberOfCodeBlocks, 354 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 290 ConstructedInterpolants, 0 QuantifiedInterpolants, 382 SizeOfPredicates, 3 NumberOfNonLiveVariables, 836 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-01-10 08:22:32,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...