./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.11.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.11.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d10d961b0039dc8700247ef3f425eca54baa7810b507915bf9a44d0387922dc2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 09:57:27,547 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 09:57:27,623 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 09:57:27,629 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 09:57:27,629 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 09:57:27,655 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 09:57:27,656 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 09:57:27,657 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 09:57:27,657 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 09:57:27,659 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 09:57:27,659 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 09:57:27,660 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 09:57:27,660 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 09:57:27,662 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 09:57:27,663 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 09:57:27,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 09:57:27,663 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 09:57:27,663 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 09:57:27,664 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 09:57:27,664 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 09:57:27,664 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 09:57:27,667 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 09:57:27,667 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 09:57:27,668 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 09:57:27,668 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 09:57:27,668 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 09:57:27,668 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 09:57:27,668 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 09:57:27,669 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 09:57:27,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 09:57:27,669 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 09:57:27,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 09:57:27,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 09:57:27,670 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 09:57:27,670 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 09:57:27,670 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 09:57:27,670 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 09:57:27,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 09:57:27,671 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 09:57:27,671 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 09:57:27,671 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 09:57:27,672 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 09:57:27,672 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d10d961b0039dc8700247ef3f425eca54baa7810b507915bf9a44d0387922dc2 [2024-11-16 09:57:27,950 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 09:57:27,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 09:57:27,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 09:57:27,978 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 09:57:27,978 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 09:57:27,979 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.11.cil-2.c [2024-11-16 09:57:29,466 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 09:57:29,721 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 09:57:29,722 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.11.cil-2.c [2024-11-16 09:57:29,747 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/789fcc5f1/b0a66b2e1a6544c1b6ff883d1eb3c7be/FLAG555ddcf4e [2024-11-16 09:57:29,760 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/789fcc5f1/b0a66b2e1a6544c1b6ff883d1eb3c7be [2024-11-16 09:57:29,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 09:57:29,763 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 09:57:29,764 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 09:57:29,765 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 09:57:29,769 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 09:57:29,770 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:57:29" (1/1) ... [2024-11-16 09:57:29,770 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a4f9c68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:29, skipping insertion in model container [2024-11-16 09:57:29,771 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:57:29" (1/1) ... [2024-11-16 09:57:29,814 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 09:57:30,010 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.11.cil-2.c[914,927] [2024-11-16 09:57:30,092 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.11.cil-2.c[7125,7138] [2024-11-16 09:57:30,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 09:57:30,219 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 09:57:30,230 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.11.cil-2.c[914,927] [2024-11-16 09:57:30,257 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.11.cil-2.c[7125,7138] [2024-11-16 09:57:30,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 09:57:30,354 INFO L204 MainTranslator]: Completed translation [2024-11-16 09:57:30,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:30 WrapperNode [2024-11-16 09:57:30,355 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 09:57:30,356 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 09:57:30,357 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 09:57:30,357 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 09:57:30,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:30" (1/1) ... [2024-11-16 09:57:30,383 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:30" (1/1) ... [2024-11-16 09:57:30,424 INFO L138 Inliner]: procedures = 75, calls = 91, calls flagged for inlining = 44, calls inlined = 44, statements flattened = 991 [2024-11-16 09:57:30,424 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 09:57:30,425 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 09:57:30,425 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 09:57:30,425 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 09:57:30,436 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:30" (1/1) ... [2024-11-16 09:57:30,436 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:30" (1/1) ... [2024-11-16 09:57:30,441 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:30" (1/1) ... [2024-11-16 09:57:30,466 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 09:57:30,467 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:30" (1/1) ... [2024-11-16 09:57:30,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:30" (1/1) ... [2024-11-16 09:57:30,479 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:30" (1/1) ... [2024-11-16 09:57:30,480 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:30" (1/1) ... [2024-11-16 09:57:30,486 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:30" (1/1) ... [2024-11-16 09:57:30,492 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:30" (1/1) ... [2024-11-16 09:57:30,497 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 09:57:30,498 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 09:57:30,498 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 09:57:30,498 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 09:57:30,499 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:30" (1/1) ... [2024-11-16 09:57:30,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 09:57:30,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:57:30,537 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 09:57:30,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 09:57:30,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 09:57:30,595 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-16 09:57:30,595 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-16 09:57:30,595 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-16 09:57:30,595 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-16 09:57:30,596 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-16 09:57:30,596 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-16 09:57:30,596 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-16 09:57:30,596 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-16 09:57:30,596 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-16 09:57:30,597 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-16 09:57:30,598 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-16 09:57:30,598 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-16 09:57:30,598 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-16 09:57:30,598 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-16 09:57:30,598 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-16 09:57:30,598 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-16 09:57:30,598 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-16 09:57:30,598 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-16 09:57:30,598 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-16 09:57:30,599 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-16 09:57:30,599 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-16 09:57:30,599 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-16 09:57:30,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 09:57:30,599 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-16 09:57:30,599 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-16 09:57:30,599 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-16 09:57:30,599 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-16 09:57:30,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 09:57:30,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 09:57:30,599 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-16 09:57:30,599 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-16 09:57:30,758 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 09:57:30,760 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 09:57:31,856 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2024-11-16 09:57:31,856 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 09:57:31,893 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 09:57:31,895 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 09:57:31,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 09:57:31 BoogieIcfgContainer [2024-11-16 09:57:31,895 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 09:57:31,898 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 09:57:31,898 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 09:57:31,901 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 09:57:31,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 09:57:29" (1/3) ... [2024-11-16 09:57:31,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@587bc477 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:57:31, skipping insertion in model container [2024-11-16 09:57:31,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:30" (2/3) ... [2024-11-16 09:57:31,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@587bc477 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:57:31, skipping insertion in model container [2024-11-16 09:57:31,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 09:57:31" (3/3) ... [2024-11-16 09:57:31,905 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.11.cil-2.c [2024-11-16 09:57:31,917 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 09:57:31,917 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-16 09:57:32,002 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 09:57:32,009 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2a4bfd43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 09:57:32,009 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-16 09:57:32,016 INFO L276 IsEmpty]: Start isEmpty. Operand has 545 states, 488 states have (on average 1.5245901639344261) internal successors, (744), 495 states have internal predecessors, (744), 40 states have call successors, (40), 14 states have call predecessors, (40), 14 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-16 09:57:32,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-16 09:57:32,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:57:32,026 INFO L215 NwaCegarLoop]: 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, 1, 1, 1, 1] [2024-11-16 09:57:32,027 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:57:32,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:57:32,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1527082259, now seen corresponding path program 1 times [2024-11-16 09:57:32,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:57:32,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333395147] [2024-11-16 09:57:32,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:57:32,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:57:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:32,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:57:32,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:32,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 09:57:32,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:32,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 09:57:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:32,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 09:57:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:32,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 09:57:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:32,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 09:57:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:32,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 09:57:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:32,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:57:32,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:57:32,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333395147] [2024-11-16 09:57:32,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333395147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:57:32,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:57:32,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 09:57:32,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745699814] [2024-11-16 09:57:32,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:57:32,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 09:57:32,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:57:32,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 09:57:32,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:57:32,593 INFO L87 Difference]: Start difference. First operand has 545 states, 488 states have (on average 1.5245901639344261) internal successors, (744), 495 states have internal predecessors, (744), 40 states have call successors, (40), 14 states have call predecessors, (40), 14 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-16 09:57:34,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:57:34,022 INFO L93 Difference]: Finished difference Result 1198 states and 1809 transitions. [2024-11-16 09:57:34,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 09:57:34,025 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 63 [2024-11-16 09:57:34,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:57:34,043 INFO L225 Difference]: With dead ends: 1198 [2024-11-16 09:57:34,043 INFO L226 Difference]: Without dead ends: 667 [2024-11-16 09:57:34,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-16 09:57:34,057 INFO L432 NwaCegarLoop]: 463 mSDtfsCounter, 1184 mSDsluCounter, 1960 mSDsCounter, 0 mSdLazyCounter, 1316 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1189 SdHoareTripleChecker+Valid, 2423 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 1316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-16 09:57:34,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1189 Valid, 2423 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 1316 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-16 09:57:34,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2024-11-16 09:57:34,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 626. [2024-11-16 09:57:34,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 551 states have (on average 1.4446460980036298) internal successors, (796), 558 states have internal predecessors, (796), 51 states have call successors, (51), 21 states have call predecessors, (51), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) [2024-11-16 09:57:34,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 900 transitions. [2024-11-16 09:57:34,204 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 900 transitions. Word has length 63 [2024-11-16 09:57:34,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:57:34,205 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 900 transitions. [2024-11-16 09:57:34,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-16 09:57:34,205 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 900 transitions. [2024-11-16 09:57:34,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-16 09:57:34,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:57:34,209 INFO L215 NwaCegarLoop]: 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, 1, 1, 1, 1] [2024-11-16 09:57:34,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 09:57:34,210 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:57:34,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:57:34,211 INFO L85 PathProgramCache]: Analyzing trace with hash -822431382, now seen corresponding path program 1 times [2024-11-16 09:57:34,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:57:34,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002502107] [2024-11-16 09:57:34,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:57:34,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:57:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:34,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:57:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:34,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 09:57:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:34,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 09:57:34,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:34,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 09:57:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:34,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 09:57:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:34,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 09:57:34,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:34,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 09:57:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:34,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:57:34,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:57:34,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002502107] [2024-11-16 09:57:34,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002502107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:57:34,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:57:34,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 09:57:34,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845307604] [2024-11-16 09:57:34,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:57:34,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 09:57:34,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:57:34,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 09:57:34,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:57:34,505 INFO L87 Difference]: Start difference. First operand 626 states and 900 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-16 09:57:35,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:57:35,939 INFO L93 Difference]: Finished difference Result 1016 states and 1420 transitions. [2024-11-16 09:57:35,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 09:57:35,940 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 63 [2024-11-16 09:57:35,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:57:35,947 INFO L225 Difference]: With dead ends: 1016 [2024-11-16 09:57:35,947 INFO L226 Difference]: Without dead ends: 811 [2024-11-16 09:57:35,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-16 09:57:35,949 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 1467 mSDsluCounter, 2231 mSDsCounter, 0 mSdLazyCounter, 1572 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1497 SdHoareTripleChecker+Valid, 2730 SdHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-16 09:57:35,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1497 Valid, 2730 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1572 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-16 09:57:35,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2024-11-16 09:57:35,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 735. [2024-11-16 09:57:35,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 640 states have (on average 1.4265625) internal successors, (913), 649 states have internal predecessors, (913), 62 states have call successors, (62), 28 states have call predecessors, (62), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) [2024-11-16 09:57:36,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1047 transitions. [2024-11-16 09:57:36,002 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1047 transitions. Word has length 63 [2024-11-16 09:57:36,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:57:36,002 INFO L471 AbstractCegarLoop]: Abstraction has 735 states and 1047 transitions. [2024-11-16 09:57:36,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-16 09:57:36,003 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1047 transitions. [2024-11-16 09:57:36,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-16 09:57:36,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:57:36,010 INFO L215 NwaCegarLoop]: 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, 1, 1, 1, 1] [2024-11-16 09:57:36,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 09:57:36,011 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:57:36,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:57:36,011 INFO L85 PathProgramCache]: Analyzing trace with hash -830190741, now seen corresponding path program 1 times [2024-11-16 09:57:36,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:57:36,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589364766] [2024-11-16 09:57:36,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:57:36,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:57:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:36,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:57:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:36,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 09:57:36,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:36,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 09:57:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:36,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 09:57:36,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:36,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 09:57:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:36,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 09:57:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:36,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 09:57:36,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:36,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:57:36,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:57:36,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589364766] [2024-11-16 09:57:36,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589364766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:57:36,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:57:36,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 09:57:36,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464702552] [2024-11-16 09:57:36,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:57:36,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 09:57:36,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:57:36,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 09:57:36,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-16 09:57:36,233 INFO L87 Difference]: Start difference. First operand 735 states and 1047 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 09:57:37,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:57:37,572 INFO L93 Difference]: Finished difference Result 1075 states and 1499 transitions. [2024-11-16 09:57:37,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 09:57:37,573 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (8), 5 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 63 [2024-11-16 09:57:37,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:57:37,579 INFO L225 Difference]: With dead ends: 1075 [2024-11-16 09:57:37,580 INFO L226 Difference]: Without dead ends: 767 [2024-11-16 09:57:37,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-16 09:57:37,582 INFO L432 NwaCegarLoop]: 454 mSDtfsCounter, 610 mSDsluCounter, 2775 mSDsCounter, 0 mSdLazyCounter, 1897 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 3229 SdHoareTripleChecker+Invalid, 1984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 09:57:37,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 3229 Invalid, 1984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1897 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 09:57:37,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2024-11-16 09:57:37,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 740. [2024-11-16 09:57:37,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 644 states have (on average 1.420807453416149) internal successors, (915), 653 states have internal predecessors, (915), 62 states have call successors, (62), 28 states have call predecessors, (62), 32 states have return successors, (73), 62 states have call predecessors, (73), 59 states have call successors, (73) [2024-11-16 09:57:37,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1050 transitions. [2024-11-16 09:57:37,631 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1050 transitions. Word has length 63 [2024-11-16 09:57:37,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:57:37,631 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1050 transitions. [2024-11-16 09:57:37,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 09:57:37,632 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1050 transitions. [2024-11-16 09:57:37,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-16 09:57:37,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:57:37,635 INFO L215 NwaCegarLoop]: 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, 1, 1, 1, 1] [2024-11-16 09:57:37,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 09:57:37,635 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:57:37,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:57:37,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1120109514, now seen corresponding path program 1 times [2024-11-16 09:57:37,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:57:37,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366769226] [2024-11-16 09:57:37,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:57:37,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:57:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:37,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:57:37,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:37,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 09:57:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:37,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 09:57:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:37,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 09:57:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:37,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 09:57:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:37,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 09:57:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:37,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 09:57:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:37,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:57:37,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:57:37,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366769226] [2024-11-16 09:57:37,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366769226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:57:37,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:57:37,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 09:57:37,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554852642] [2024-11-16 09:57:37,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:57:37,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 09:57:37,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:57:37,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 09:57:37,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-16 09:57:37,795 INFO L87 Difference]: Start difference. First operand 740 states and 1050 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-16 09:57:39,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:57:39,824 INFO L93 Difference]: Finished difference Result 2274 states and 3054 transitions. [2024-11-16 09:57:39,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-16 09:57:39,825 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 63 [2024-11-16 09:57:39,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:57:39,834 INFO L225 Difference]: With dead ends: 2274 [2024-11-16 09:57:39,834 INFO L226 Difference]: Without dead ends: 1943 [2024-11-16 09:57:39,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2024-11-16 09:57:39,837 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 4214 mSDsluCounter, 2097 mSDsCounter, 0 mSdLazyCounter, 1733 mSolverCounterSat, 645 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4228 SdHoareTripleChecker+Valid, 2611 SdHoareTripleChecker+Invalid, 2378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 645 IncrementalHoareTripleChecker+Valid, 1733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-16 09:57:39,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4228 Valid, 2611 Invalid, 2378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [645 Valid, 1733 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-16 09:57:39,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2024-11-16 09:57:39,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1774. [2024-11-16 09:57:39,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1774 states, 1492 states have (on average 1.331769436997319) internal successors, (1987), 1516 states have internal predecessors, (1987), 150 states have call successors, (150), 111 states have call predecessors, (150), 130 states have return successors, (187), 149 states have call predecessors, (187), 147 states have call successors, (187) [2024-11-16 09:57:39,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1774 states and 2324 transitions. [2024-11-16 09:57:39,953 INFO L78 Accepts]: Start accepts. Automaton has 1774 states and 2324 transitions. Word has length 63 [2024-11-16 09:57:39,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:57:39,953 INFO L471 AbstractCegarLoop]: Abstraction has 1774 states and 2324 transitions. [2024-11-16 09:57:39,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-16 09:57:39,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states and 2324 transitions. [2024-11-16 09:57:39,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-16 09:57:39,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:57:39,955 INFO L215 NwaCegarLoop]: 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, 1, 1, 1, 1] [2024-11-16 09:57:39,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 09:57:39,955 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:57:39,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:57:39,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1338327027, now seen corresponding path program 1 times [2024-11-16 09:57:39,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:57:39,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261473944] [2024-11-16 09:57:39,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:57:39,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:57:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:40,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:57:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:40,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 09:57:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:40,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 09:57:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:40,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 09:57:40,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:40,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 09:57:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:40,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 09:57:40,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:40,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 09:57:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:40,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:57:40,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:57:40,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261473944] [2024-11-16 09:57:40,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261473944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:57:40,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:57:40,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 09:57:40,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172954137] [2024-11-16 09:57:40,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:57:40,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 09:57:40,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:57:40,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 09:57:40,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-16 09:57:40,133 INFO L87 Difference]: Start difference. First operand 1774 states and 2324 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 09:57:41,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:57:41,344 INFO L93 Difference]: Finished difference Result 3235 states and 4167 transitions. [2024-11-16 09:57:41,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 09:57:41,345 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (8), 5 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 63 [2024-11-16 09:57:41,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:57:41,355 INFO L225 Difference]: With dead ends: 3235 [2024-11-16 09:57:41,355 INFO L226 Difference]: Without dead ends: 1876 [2024-11-16 09:57:41,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-16 09:57:41,358 INFO L432 NwaCegarLoop]: 451 mSDtfsCounter, 916 mSDsluCounter, 2401 mSDsCounter, 0 mSdLazyCounter, 1809 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 2852 SdHoareTripleChecker+Invalid, 1941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:57:41,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 2852 Invalid, 1941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1809 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 09:57:41,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2024-11-16 09:57:41,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1804. [2024-11-16 09:57:41,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1516 states have (on average 1.321240105540897) internal successors, (2003), 1540 states have internal predecessors, (2003), 150 states have call successors, (150), 111 states have call predecessors, (150), 136 states have return successors, (193), 155 states have call predecessors, (193), 147 states have call successors, (193) [2024-11-16 09:57:41,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2346 transitions. [2024-11-16 09:57:41,474 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2346 transitions. Word has length 63 [2024-11-16 09:57:41,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:57:41,475 INFO L471 AbstractCegarLoop]: Abstraction has 1804 states and 2346 transitions. [2024-11-16 09:57:41,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 09:57:41,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2346 transitions. [2024-11-16 09:57:41,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-16 09:57:41,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:57:41,477 INFO L215 NwaCegarLoop]: 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, 1, 1, 1, 1] [2024-11-16 09:57:41,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 09:57:41,480 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:57:41,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:57:41,481 INFO L85 PathProgramCache]: Analyzing trace with hash -376713010, now seen corresponding path program 1 times [2024-11-16 09:57:41,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:57:41,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266688854] [2024-11-16 09:57:41,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:57:41,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:57:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:41,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:57:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:41,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 09:57:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:41,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 09:57:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:41,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 09:57:41,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:41,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 09:57:41,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:41,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 09:57:41,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:41,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 09:57:41,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:41,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:57:41,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:57:41,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266688854] [2024-11-16 09:57:41,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266688854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:57:41,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:57:41,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 09:57:41,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920102076] [2024-11-16 09:57:41,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:57:41,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 09:57:41,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:57:41,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 09:57:41,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:57:41,645 INFO L87 Difference]: Start difference. First operand 1804 states and 2346 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-16 09:57:42,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:57:42,879 INFO L93 Difference]: Finished difference Result 3194 states and 4028 transitions. [2024-11-16 09:57:42,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 09:57:42,880 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 63 [2024-11-16 09:57:42,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:57:42,890 INFO L225 Difference]: With dead ends: 3194 [2024-11-16 09:57:42,890 INFO L226 Difference]: Without dead ends: 2061 [2024-11-16 09:57:42,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-11-16 09:57:42,894 INFO L432 NwaCegarLoop]: 426 mSDtfsCounter, 1428 mSDsluCounter, 1967 mSDsCounter, 0 mSdLazyCounter, 1490 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1456 SdHoareTripleChecker+Valid, 2393 SdHoareTripleChecker+Invalid, 1625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:57:42,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1456 Valid, 2393 Invalid, 1625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1490 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 09:57:42,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2061 states. [2024-11-16 09:57:43,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2061 to 1738. [2024-11-16 09:57:43,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1466 states have (on average 1.3192360163710777) internal successors, (1934), 1485 states have internal predecessors, (1934), 144 states have call successors, (144), 106 states have call predecessors, (144), 126 states have return successors, (178), 148 states have call predecessors, (178), 141 states have call successors, (178) [2024-11-16 09:57:43,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2256 transitions. [2024-11-16 09:57:43,021 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2256 transitions. Word has length 63 [2024-11-16 09:57:43,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:57:43,023 INFO L471 AbstractCegarLoop]: Abstraction has 1738 states and 2256 transitions. [2024-11-16 09:57:43,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-16 09:57:43,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2256 transitions. [2024-11-16 09:57:43,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-16 09:57:43,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:57:43,024 INFO L215 NwaCegarLoop]: 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, 1, 1, 1, 1] [2024-11-16 09:57:43,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 09:57:43,025 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:57:43,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:57:43,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1880197997, now seen corresponding path program 1 times [2024-11-16 09:57:43,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:57:43,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17687347] [2024-11-16 09:57:43,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:57:43,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:57:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 09:57:43,041 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 09:57:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 09:57:43,101 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 09:57:43,101 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 09:57:43,102 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-16 09:57:43,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-16 09:57:43,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 09:57:43,108 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:57:43,228 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 09:57:43,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 09:57:43 BoogieIcfgContainer [2024-11-16 09:57:43,231 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 09:57:43,232 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 09:57:43,232 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 09:57:43,232 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 09:57:43,232 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 09:57:31" (3/4) ... [2024-11-16 09:57:43,233 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 09:57:43,358 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 09:57:43,358 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 09:57:43,359 INFO L158 Benchmark]: Toolchain (without parser) took 13595.73ms. Allocated memory was 195.0MB in the beginning and 302.0MB in the end (delta: 107.0MB). Free memory was 166.5MB in the beginning and 150.1MB in the end (delta: 16.4MB). Peak memory consumption was 124.1MB. Max. memory is 16.1GB. [2024-11-16 09:57:43,359 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 195.0MB. Free memory is still 171.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 09:57:43,359 INFO L158 Benchmark]: CACSL2BoogieTranslator took 591.28ms. Allocated memory is still 195.0MB. Free memory was 166.5MB in the beginning and 138.1MB in the end (delta: 28.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-16 09:57:43,360 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.07ms. Allocated memory is still 195.0MB. Free memory was 138.1MB in the beginning and 133.2MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 09:57:43,360 INFO L158 Benchmark]: Boogie Preprocessor took 72.27ms. Allocated memory is still 195.0MB. Free memory was 133.2MB in the beginning and 129.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 09:57:43,362 INFO L158 Benchmark]: IcfgBuilder took 1397.41ms. Allocated memory is still 195.0MB. Free memory was 129.0MB in the beginning and 131.6MB in the end (delta: -2.6MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2024-11-16 09:57:43,362 INFO L158 Benchmark]: TraceAbstraction took 11333.47ms. Allocated memory was 195.0MB in the beginning and 302.0MB in the end (delta: 107.0MB). Free memory was 130.5MB in the beginning and 171.0MB in the end (delta: -40.5MB). Peak memory consumption was 68.5MB. Max. memory is 16.1GB. [2024-11-16 09:57:43,363 INFO L158 Benchmark]: Witness Printer took 127.02ms. Allocated memory is still 302.0MB. Free memory was 171.0MB in the beginning and 150.1MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-16 09:57:43,364 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 195.0MB. Free memory is still 171.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 591.28ms. Allocated memory is still 195.0MB. Free memory was 166.5MB in the beginning and 138.1MB in the end (delta: 28.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.07ms. Allocated memory is still 195.0MB. Free memory was 138.1MB in the beginning and 133.2MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.27ms. Allocated memory is still 195.0MB. Free memory was 133.2MB in the beginning and 129.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1397.41ms. Allocated memory is still 195.0MB. Free memory was 129.0MB in the beginning and 131.6MB in the end (delta: -2.6MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * TraceAbstraction took 11333.47ms. Allocated memory was 195.0MB in the beginning and 302.0MB in the end (delta: 107.0MB). Free memory was 130.5MB in the beginning and 171.0MB in the end (delta: -40.5MB). Peak memory consumption was 68.5MB. Max. memory is 16.1GB. * Witness Printer took 127.02ms. Allocated memory is still 302.0MB. Free memory was 171.0MB in the beginning and 150.1MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * 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 t6_pc = 0; [L507] int t7_pc = 0; [L508] int t8_pc = 0; [L509] int t9_pc = 0; [L510] int t10_pc = 0; [L511] int t11_pc = 0; [L512] int m_st ; [L513] int t1_st ; [L514] int t2_st ; [L515] int t3_st ; [L516] int t4_st ; [L517] int t5_st ; [L518] int t6_st ; [L519] int t7_st ; [L520] int t8_st ; [L521] int t9_st ; [L522] int t10_st ; [L523] int t11_st ; [L524] int m_i ; [L525] int t1_i ; [L526] int t2_i ; [L527] int t3_i ; [L528] int t4_i ; [L529] int t5_i ; [L530] int t6_i ; [L531] int t7_i ; [L532] int t8_i ; [L533] int t9_i ; [L534] int t10_i ; [L535] int t11_i ; [L536] int M_E = 2; [L537] int T1_E = 2; [L538] int T2_E = 2; [L539] int T3_E = 2; [L540] int T4_E = 2; [L541] int T5_E = 2; [L542] int T6_E = 2; [L543] int T7_E = 2; [L544] int T8_E = 2; [L545] int T9_E = 2; [L546] int T10_E = 2; [L547] int T11_E = 2; [L548] int E_M = 2; [L549] int E_1 = 2; [L550] int E_2 = 2; [L551] int E_3 = 2; [L552] int E_4 = 2; [L553] int E_5 = 2; [L554] int E_6 = 2; [L555] int E_7 = 2; [L556] int E_8 = 2; [L557] int E_9 = 2; [L558] int E_10 = 2; [L559] int E_11 = 2; [L573] int token ; [L575] int local ; VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L2212] COND TRUE __VERIFIER_nondet_int() [L2213] 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 [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L478] RET init_model1() [L479] CALL start_simulation1() [L414] int kernel_st ; [L415] int tmp ; [L419] kernel_st = 0 VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L420] CALL update_channels1() VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \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, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L230] COND FALSE !((int )q_req_up == 1) VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \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, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L420] RET update_channels1() VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L421] CALL init_threads1() [L245] COND TRUE (int )p_dw_i == 1 [L246] p_dw_st = 0 VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L250] COND TRUE (int )c_dr_i == 1 [L251] c_dr_st = 0 VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L421] RET init_threads1() [L422] CALL fire_delta_events1() VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \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, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L283] COND FALSE !((int )q_read_ev == 0) VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \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, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L288] COND FALSE !((int )q_write_ev == 0) VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \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, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L422] RET fire_delta_events1() VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L423] CALL activate_threads1() VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \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, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L316] int tmp ; [L317] int tmp___0 ; VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \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, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L321] CALL, EXPR is_do_write_p_triggered() VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \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, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L70] int __retres1 ; VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \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, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L73] COND FALSE !((int )p_dw_pc == 1) VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \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, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L83] __retres1 = 0 VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \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, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L85] return (__retres1); VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L321] RET, EXPR is_do_write_p_triggered() VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \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, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L321] tmp = is_do_write_p_triggered() [L323] COND FALSE !(\read(tmp)) VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \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, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L329] CALL, EXPR is_do_read_c_triggered() VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \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, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L89] int __retres1 ; VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \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, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L92] COND FALSE !((int )c_dr_pc == 1) VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \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, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L102] __retres1 = 0 VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \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, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L104] return (__retres1); VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L329] RET, EXPR is_do_read_c_triggered() VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \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, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L329] tmp___0 = is_do_read_c_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \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, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L423] RET activate_threads1() VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L424] CALL reset_delta_events1() VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \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, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L301] COND FALSE !((int )q_read_ev == 1) VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \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, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L306] COND FALSE !((int )q_write_ev == 1) VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \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, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L424] RET reset_delta_events1() VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L427] COND TRUE 1 VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L430] kernel_st = 1 [L431] CALL eval1() [L341] int tmp ; [L342] int tmp___0 ; [L343] int tmp___1 ; VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L347] COND TRUE 1 VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L350] CALL, EXPR exists_runnable_thread1() VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L260] int __retres1 ; VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L263] COND TRUE (int )p_dw_st == 0 [L264] __retres1 = 1 VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, __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, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L276] return (__retres1); VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \result=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L350] RET, EXPR exists_runnable_thread1() VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L350] tmp___1 = exists_runnable_thread1() [L352] COND TRUE \read(tmp___1) VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L357] COND TRUE (int )p_dw_st == 0 [L359] tmp = __VERIFIER_nondet_int() [L361] COND FALSE !(\read(tmp)) VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L367] CALL error1() VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L28] reach_error() VAL [E_10=2, E_11=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] - UnprovableResult [Line: 496]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 545 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 11.1s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9899 SdHoareTripleChecker+Valid, 6.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9819 mSDsluCounter, 16238 SdHoareTripleChecker+Invalid, 5.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13431 mSDsCounter, 1315 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9817 IncrementalHoareTripleChecker+Invalid, 11132 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1315 mSolverCounterUnsat, 2807 mSDtfsCounter, 9817 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 227 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1804occurred in iteration=5, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 6 MinimizatonAttempts, 708 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 441 NumberOfCodeBlocks, 441 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 372 ConstructedInterpolants, 0 QuantifiedInterpolants, 744 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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! [2024-11-16 09:57:43,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE