./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.12.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.12.cil-2.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'afc452e582a18ce642d1e41e01e6f77614ca2cc57c3cb5416c5427160b30d0ba'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.12.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 afc452e582a18ce642d1e41e01e6f77614ca2cc57c3cb5416c5427160b30d0ba --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:47:28,773 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:47:28,859 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 01:47:28,865 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:47:28,867 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:47:28,891 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:47:28,892 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:47:28,892 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:47:28,892 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:47:28,892 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:47:28,892 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:47:28,892 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:47:28,893 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:47:28,893 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:47:28,893 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:47:28,893 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:47:28,893 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:47:28,893 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:47:28,893 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:47:28,893 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:47:28,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:47:28,893 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:47:28,893 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:47:28,893 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:47:28,894 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:47:28,894 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:47:28,894 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:47:28,894 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:47:28,894 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:47:28,894 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:47:28,894 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:47:28,894 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:47:28,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:47:28,894 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:47:28,894 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:47:28,895 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:47:28,895 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:47:28,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:47:28,895 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:47:28,895 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:47:28,895 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:47:28,897 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:47:28,897 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> afc452e582a18ce642d1e41e01e6f77614ca2cc57c3cb5416c5427160b30d0ba [2024-11-07 01:47:29,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:47:29,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:47:29,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:47:29,185 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:47:29,185 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:47:29,186 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.12.cil-2.c [2024-11-07 01:47:30,457 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:47:30,692 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:47:30,696 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.12.cil-2.c [2024-11-07 01:47:30,711 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b58bb125b/445112f11d594ef89ba6738e08a1f373/FLAG2a7d7b36c [2024-11-07 01:47:30,723 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b58bb125b/445112f11d594ef89ba6738e08a1f373 [2024-11-07 01:47:30,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:47:30,726 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:47:30,727 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:47:30,727 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:47:30,731 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:47:30,731 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:47:30" (1/1) ... [2024-11-07 01:47:30,732 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2166fe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:30, skipping insertion in model container [2024-11-07 01:47:30,732 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:47:30" (1/1) ... [2024-11-07 01:47:30,768 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:47:30,898 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.12.cil-2.c[914,927] [2024-11-07 01:47:30,952 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.12.cil-2.c[7125,7138] [2024-11-07 01:47:31,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:47:31,077 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:47:31,086 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.12.cil-2.c[914,927] [2024-11-07 01:47:31,104 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.12.cil-2.c[7125,7138] [2024-11-07 01:47:31,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:47:31,182 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:47:31,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:31 WrapperNode [2024-11-07 01:47:31,183 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:47:31,184 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:47:31,184 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:47:31,184 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:47:31,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:31" (1/1) ... [2024-11-07 01:47:31,204 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:31" (1/1) ... [2024-11-07 01:47:31,258 INFO L138 Inliner]: procedures = 77, calls = 94, calls flagged for inlining = 46, calls inlined = 46, statements flattened = 1069 [2024-11-07 01:47:31,261 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:47:31,262 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:47:31,262 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:47:31,262 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:47:31,274 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:31" (1/1) ... [2024-11-07 01:47:31,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:31" (1/1) ... [2024-11-07 01:47:31,283 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:31" (1/1) ... [2024-11-07 01:47:31,310 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-07 01:47:31,313 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:31" (1/1) ... [2024-11-07 01:47:31,313 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:31" (1/1) ... [2024-11-07 01:47:31,334 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:31" (1/1) ... [2024-11-07 01:47:31,354 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:31" (1/1) ... [2024-11-07 01:47:31,358 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:31" (1/1) ... [2024-11-07 01:47:31,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:31" (1/1) ... [2024-11-07 01:47:31,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:47:31,377 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:47:31,378 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:47:31,378 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:47:31,379 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:31" (1/1) ... [2024-11-07 01:47:31,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:47:31,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:47:31,410 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 01:47:31,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 01:47:31,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:47:31,438 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 01:47:31,439 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 01:47:31,439 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-07 01:47:31,439 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-07 01:47:31,439 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-07 01:47:31,439 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-07 01:47:31,439 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-07 01:47:31,439 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-07 01:47:31,439 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-07 01:47:31,440 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-07 01:47:31,440 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-07 01:47:31,440 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-07 01:47:31,440 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-07 01:47:31,440 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-07 01:47:31,440 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-07 01:47:31,440 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-07 01:47:31,440 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-07 01:47:31,441 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-07 01:47:31,441 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-07 01:47:31,441 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-07 01:47:31,441 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-07 01:47:31,441 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-07 01:47:31,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:47:31,441 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-07 01:47:31,442 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-07 01:47:31,442 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-07 01:47:31,442 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-07 01:47:31,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:47:31,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:47:31,442 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-07 01:47:31,442 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-07 01:47:31,604 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:47:31,607 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:47:32,676 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2024-11-07 01:47:32,677 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:47:32,705 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:47:32,706 INFO L316 CfgBuilder]: Removed 19 assume(true) statements. [2024-11-07 01:47:32,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:47:32 BoogieIcfgContainer [2024-11-07 01:47:32,706 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:47:32,709 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:47:32,709 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:47:32,716 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:47:32,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:47:30" (1/3) ... [2024-11-07 01:47:32,717 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab43b59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:47:32, skipping insertion in model container [2024-11-07 01:47:32,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:31" (2/3) ... [2024-11-07 01:47:32,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab43b59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:47:32, skipping insertion in model container [2024-11-07 01:47:32,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:47:32" (3/3) ... [2024-11-07 01:47:32,719 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.12.cil-2.c [2024-11-07 01:47:32,733 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:47:32,734 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:47:32,811 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:47:32,821 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;@7aef3d57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:47:32,822 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:47:32,831 INFO L276 IsEmpty]: Start isEmpty. Operand has 497 states, 439 states have (on average 1.6218678815489749) internal successors, (712), 446 states have internal predecessors, (712), 41 states have call successors, (41), 14 states have call predecessors, (41), 14 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-07 01:47:32,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-07 01:47:32,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:32,841 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] [2024-11-07 01:47:32,842 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:32,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:32,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1755234456, now seen corresponding path program 1 times [2024-11-07 01:47:32,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:32,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299344861] [2024-11-07 01:47:32,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:32,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:33,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:33,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:47:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:33,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:47:33,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:33,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:47:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:33,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:47:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:33,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:47:33,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:33,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:47:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:33,385 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-07 01:47:33,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:33,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299344861] [2024-11-07 01:47:33,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299344861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:33,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:33,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:47:33,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437983228] [2024-11-07 01:47:33,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:33,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:47:33,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:33,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:47:33,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:47:33,414 INFO L87 Difference]: Start difference. First operand has 497 states, 439 states have (on average 1.6218678815489749) internal successors, (712), 446 states have internal predecessors, (712), 41 states have call successors, (41), 14 states have call predecessors, (41), 14 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 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-07 01:47:34,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:34,920 INFO L93 Difference]: Finished difference Result 1102 states and 1748 transitions. [2024-11-07 01:47:34,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:47:34,922 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 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 59 [2024-11-07 01:47:34,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:34,936 INFO L225 Difference]: With dead ends: 1102 [2024-11-07 01:47:34,936 INFO L226 Difference]: Without dead ends: 623 [2024-11-07 01:47:34,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:47:34,946 INFO L432 NwaCegarLoop]: 428 mSDtfsCounter, 1569 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 1315 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1574 SdHoareTripleChecker+Valid, 1854 SdHoareTripleChecker+Invalid, 1555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 1315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:34,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1574 Valid, 1854 Invalid, 1555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 1315 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 01:47:34,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2024-11-07 01:47:35,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 583. [2024-11-07 01:47:35,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 507 states have (on average 1.5128205128205128) internal successors, (767), 514 states have internal predecessors, (767), 52 states have call successors, (52), 21 states have call predecessors, (52), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2024-11-07 01:47:35,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 873 transitions. [2024-11-07 01:47:35,054 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 873 transitions. Word has length 59 [2024-11-07 01:47:35,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:35,054 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 873 transitions. [2024-11-07 01:47:35,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 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-07 01:47:35,055 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 873 transitions. [2024-11-07 01:47:35,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-07 01:47:35,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:35,058 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] [2024-11-07 01:47:35,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:47:35,059 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:35,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:35,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1777083209, now seen corresponding path program 1 times [2024-11-07 01:47:35,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:35,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905289027] [2024-11-07 01:47:35,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:35,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:35,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:35,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:35,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:47:35,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:35,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:47:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:35,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:47:35,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:35,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:47:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:35,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:47:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:35,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:47:35,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:35,306 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-07 01:47:35,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:35,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905289027] [2024-11-07 01:47:35,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905289027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:35,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:35,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:47:35,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308310495] [2024-11-07 01:47:35,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:35,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:47:35,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:35,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:47:35,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:47:35,309 INFO L87 Difference]: Start difference. First operand 583 states and 873 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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-07 01:47:36,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:36,694 INFO L93 Difference]: Finished difference Result 932 states and 1352 transitions. [2024-11-07 01:47:36,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 01:47:36,696 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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 59 [2024-11-07 01:47:36,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:36,704 INFO L225 Difference]: With dead ends: 932 [2024-11-07 01:47:36,704 INFO L226 Difference]: Without dead ends: 754 [2024-11-07 01:47:36,706 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-07 01:47:36,708 INFO L432 NwaCegarLoop]: 452 mSDtfsCounter, 1851 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 1560 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1883 SdHoareTripleChecker+Valid, 2047 SdHoareTripleChecker+Invalid, 1749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 1560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:36,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1883 Valid, 2047 Invalid, 1749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 1560 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 01:47:36,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-11-07 01:47:36,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 679. [2024-11-07 01:47:36,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 583 states have (on average 1.4939965694682675) internal successors, (871), 592 states have internal predecessors, (871), 63 states have call successors, (63), 28 states have call predecessors, (63), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) [2024-11-07 01:47:36,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 1007 transitions. [2024-11-07 01:47:36,772 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 1007 transitions. Word has length 59 [2024-11-07 01:47:36,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:36,772 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 1007 transitions. [2024-11-07 01:47:36,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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-07 01:47:36,773 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1007 transitions. [2024-11-07 01:47:36,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-07 01:47:36,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:36,775 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] [2024-11-07 01:47:36,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:47:36,775 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:36,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:36,775 INFO L85 PathProgramCache]: Analyzing trace with hash -883596871, now seen corresponding path program 1 times [2024-11-07 01:47:36,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:36,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769801365] [2024-11-07 01:47:36,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:36,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:36,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:36,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:47:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:36,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:47:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:36,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:47:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:36,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:47:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:36,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:47:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:37,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:47:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:37,004 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-07 01:47:37,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:37,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769801365] [2024-11-07 01:47:37,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769801365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:37,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:37,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:47:37,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139776482] [2024-11-07 01:47:37,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:37,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:47:37,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:37,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:47:37,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:47:37,007 INFO L87 Difference]: Start difference. First operand 679 states and 1007 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 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-07 01:47:38,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:38,293 INFO L93 Difference]: Finished difference Result 979 states and 1419 transitions. [2024-11-07 01:47:38,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:47:38,293 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 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 59 [2024-11-07 01:47:38,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:38,298 INFO L225 Difference]: With dead ends: 979 [2024-11-07 01:47:38,298 INFO L226 Difference]: Without dead ends: 711 [2024-11-07 01:47:38,299 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-07 01:47:38,300 INFO L432 NwaCegarLoop]: 421 mSDtfsCounter, 966 mSDsluCounter, 2195 mSDsCounter, 0 mSdLazyCounter, 1939 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 967 SdHoareTripleChecker+Valid, 2616 SdHoareTripleChecker+Invalid, 2073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:38,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [967 Valid, 2616 Invalid, 2073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1939 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 01:47:38,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-11-07 01:47:38,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 684. [2024-11-07 01:47:38,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 587 states have (on average 1.4872231686541737) internal successors, (873), 596 states have internal predecessors, (873), 63 states have call successors, (63), 28 states have call predecessors, (63), 32 states have return successors, (74), 63 states have call predecessors, (74), 60 states have call successors, (74) [2024-11-07 01:47:38,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1010 transitions. [2024-11-07 01:47:38,343 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1010 transitions. Word has length 59 [2024-11-07 01:47:38,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:38,343 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 1010 transitions. [2024-11-07 01:47:38,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 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-07 01:47:38,343 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1010 transitions. [2024-11-07 01:47:38,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-07 01:47:38,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:38,346 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] [2024-11-07 01:47:38,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:47:38,346 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:38,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:38,346 INFO L85 PathProgramCache]: Analyzing trace with hash -608837257, now seen corresponding path program 1 times [2024-11-07 01:47:38,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:38,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906590823] [2024-11-07 01:47:38,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:38,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:38,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:38,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:47:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:38,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:47:38,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:38,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:47:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:38,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:47:38,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:38,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:47:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:38,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:47:38,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:38,543 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-07 01:47:38,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:38,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906590823] [2024-11-07 01:47:38,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906590823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:38,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:38,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:47:38,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206638834] [2024-11-07 01:47:38,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:38,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:47:38,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:38,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:47:38,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:47:38,545 INFO L87 Difference]: Start difference. First operand 684 states and 1010 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 6 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-07 01:47:40,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:40,601 INFO L93 Difference]: Finished difference Result 2352 states and 3288 transitions. [2024-11-07 01:47:40,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-07 01:47:40,602 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 6 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 59 [2024-11-07 01:47:40,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:40,617 INFO L225 Difference]: With dead ends: 2352 [2024-11-07 01:47:40,617 INFO L226 Difference]: Without dead ends: 2079 [2024-11-07 01:47:40,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-11-07 01:47:40,623 INFO L432 NwaCegarLoop]: 545 mSDtfsCounter, 2620 mSDsluCounter, 2143 mSDsCounter, 0 mSdLazyCounter, 2156 mSolverCounterSat, 419 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2634 SdHoareTripleChecker+Valid, 2688 SdHoareTripleChecker+Invalid, 2575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 419 IncrementalHoareTripleChecker+Valid, 2156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:40,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2634 Valid, 2688 Invalid, 2575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [419 Valid, 2156 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 01:47:40,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2024-11-07 01:47:40,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 1821. [2024-11-07 01:47:40,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1484 states have (on average 1.3800539083557952) internal successors, (2048), 1513 states have internal predecessors, (2048), 180 states have call successors, (180), 130 states have call predecessors, (180), 155 states have return successors, (260), 181 states have call predecessors, (260), 177 states have call successors, (260) [2024-11-07 01:47:40,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2488 transitions. [2024-11-07 01:47:40,787 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2488 transitions. Word has length 59 [2024-11-07 01:47:40,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:40,789 INFO L471 AbstractCegarLoop]: Abstraction has 1821 states and 2488 transitions. [2024-11-07 01:47:40,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 6 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-07 01:47:40,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2488 transitions. [2024-11-07 01:47:40,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-07 01:47:40,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:40,793 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] [2024-11-07 01:47:40,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:47:40,794 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:40,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:40,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1580511944, now seen corresponding path program 1 times [2024-11-07 01:47:40,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:40,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126051029] [2024-11-07 01:47:40,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:40,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:40,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:40,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:47:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:40,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:47:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:40,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:47:40,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:40,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:47:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:40,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:47:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:40,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:47:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:40,935 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-07 01:47:40,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:40,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126051029] [2024-11-07 01:47:40,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126051029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:40,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:40,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:47:40,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24330407] [2024-11-07 01:47:40,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:40,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:47:40,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:40,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:47:40,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:47:40,936 INFO L87 Difference]: Start difference. First operand 1821 states and 2488 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 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-07 01:47:42,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:42,193 INFO L93 Difference]: Finished difference Result 3416 states and 4602 transitions. [2024-11-07 01:47:42,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 01:47:42,194 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 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 59 [2024-11-07 01:47:42,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:42,205 INFO L225 Difference]: With dead ends: 3416 [2024-11-07 01:47:42,205 INFO L226 Difference]: Without dead ends: 2006 [2024-11-07 01:47:42,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:47:42,212 INFO L432 NwaCegarLoop]: 420 mSDtfsCounter, 968 mSDsluCounter, 2195 mSDsCounter, 0 mSdLazyCounter, 1931 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 2615 SdHoareTripleChecker+Invalid, 2065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:42,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 2615 Invalid, 2065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1931 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:47:42,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states. [2024-11-07 01:47:42,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 1866. [2024-11-07 01:47:42,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1866 states, 1520 states have (on average 1.3651315789473684) internal successors, (2075), 1549 states have internal predecessors, (2075), 180 states have call successors, (180), 130 states have call predecessors, (180), 164 states have return successors, (272), 190 states have call predecessors, (272), 177 states have call successors, (272) [2024-11-07 01:47:42,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 2527 transitions. [2024-11-07 01:47:42,383 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 2527 transitions. Word has length 59 [2024-11-07 01:47:42,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:42,383 INFO L471 AbstractCegarLoop]: Abstraction has 1866 states and 2527 transitions. [2024-11-07 01:47:42,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 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-07 01:47:42,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 2527 transitions. [2024-11-07 01:47:42,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-07 01:47:42,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:42,385 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] [2024-11-07 01:47:42,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:47:42,385 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:42,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:42,386 INFO L85 PathProgramCache]: Analyzing trace with hash 909017018, now seen corresponding path program 1 times [2024-11-07 01:47:42,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:42,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751851907] [2024-11-07 01:47:42,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:42,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:42,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:42,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:47:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:42,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:47:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:42,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:47:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:42,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:47:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:42,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:47:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:42,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:47:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:42,591 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-07 01:47:42,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:42,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751851907] [2024-11-07 01:47:42,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751851907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:42,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:42,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:47:42,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876146782] [2024-11-07 01:47:42,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:42,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:47:42,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:42,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:47:42,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:47:42,594 INFO L87 Difference]: Start difference. First operand 1866 states and 2527 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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-07 01:47:43,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:43,740 INFO L93 Difference]: Finished difference Result 3301 states and 4364 transitions. [2024-11-07 01:47:43,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 01:47:43,741 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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 59 [2024-11-07 01:47:43,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:43,752 INFO L225 Difference]: With dead ends: 3301 [2024-11-07 01:47:43,753 INFO L226 Difference]: Without dead ends: 2065 [2024-11-07 01:47:43,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-11-07 01:47:43,758 INFO L432 NwaCegarLoop]: 390 mSDtfsCounter, 1456 mSDsluCounter, 1763 mSDsCounter, 0 mSdLazyCounter, 1557 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 2153 SdHoareTripleChecker+Invalid, 1701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:43,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1485 Valid, 2153 Invalid, 1701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1557 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:47:43,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2065 states. [2024-11-07 01:47:43,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2065 to 1844. [2024-11-07 01:47:43,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1844 states, 1506 states have (on average 1.3618857901726427) internal successors, (2051), 1529 states have internal predecessors, (2051), 180 states have call successors, (180), 130 states have call predecessors, (180), 156 states have return successors, (256), 188 states have call predecessors, (256), 177 states have call successors, (256) [2024-11-07 01:47:43,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 2487 transitions. [2024-11-07 01:47:43,884 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 2487 transitions. Word has length 59 [2024-11-07 01:47:43,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:43,885 INFO L471 AbstractCegarLoop]: Abstraction has 1844 states and 2487 transitions. [2024-11-07 01:47:43,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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-07 01:47:43,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 2487 transitions. [2024-11-07 01:47:43,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-07 01:47:43,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:43,889 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] [2024-11-07 01:47:43,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:47:43,889 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:43,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:43,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1085127688, now seen corresponding path program 1 times [2024-11-07 01:47:43,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:43,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010047132] [2024-11-07 01:47:43,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:43,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 01:47:43,903 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 01:47:43,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 01:47:43,957 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 01:47:43,957 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 01:47:43,958 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-07 01:47:43,960 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-07 01:47:43,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:47:43,963 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:47:44,092 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 01:47:44,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:47:44 BoogieIcfgContainer [2024-11-07 01:47:44,097 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 01:47:44,098 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 01:47:44,098 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 01:47:44,098 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 01:47:44,099 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:47:32" (3/4) ... [2024-11-07 01:47:44,100 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-07 01:47:44,215 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 01:47:44,215 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 01:47:44,216 INFO L158 Benchmark]: Toolchain (without parser) took 13489.82ms. Allocated memory was 117.4MB in the beginning and 268.4MB in the end (delta: 151.0MB). Free memory was 90.5MB in the beginning and 95.9MB in the end (delta: -5.3MB). Peak memory consumption was 147.3MB. Max. memory is 16.1GB. [2024-11-07 01:47:44,217 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 117.4MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 01:47:44,219 INFO L158 Benchmark]: CACSL2BoogieTranslator took 456.24ms. Allocated memory is still 117.4MB. Free memory was 90.4MB in the beginning and 65.0MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 01:47:44,220 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.99ms. Allocated memory is still 117.4MB. Free memory was 65.0MB in the beginning and 60.5MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 01:47:44,220 INFO L158 Benchmark]: Boogie Preprocessor took 114.72ms. Allocated memory is still 117.4MB. Free memory was 60.5MB in the beginning and 55.1MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 01:47:44,220 INFO L158 Benchmark]: RCFGBuilder took 1328.78ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 55.1MB in the beginning and 119.8MB in the end (delta: -64.7MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. [2024-11-07 01:47:44,220 INFO L158 Benchmark]: TraceAbstraction took 11388.96ms. Allocated memory was 176.2MB in the beginning and 268.4MB in the end (delta: 92.3MB). Free memory was 119.1MB in the beginning and 118.4MB in the end (delta: 761.3kB). Peak memory consumption was 95.5MB. Max. memory is 16.1GB. [2024-11-07 01:47:44,220 INFO L158 Benchmark]: Witness Printer took 116.89ms. Allocated memory is still 268.4MB. Free memory was 118.4MB in the beginning and 95.9MB in the end (delta: 22.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 01:47:44,222 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.24ms. Allocated memory is still 117.4MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 456.24ms. Allocated memory is still 117.4MB. Free memory was 90.4MB in the beginning and 65.0MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.99ms. Allocated memory is still 117.4MB. Free memory was 65.0MB in the beginning and 60.5MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 114.72ms. Allocated memory is still 117.4MB. Free memory was 60.5MB in the beginning and 55.1MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1328.78ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 55.1MB in the beginning and 119.8MB in the end (delta: -64.7MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. * TraceAbstraction took 11388.96ms. Allocated memory was 176.2MB in the beginning and 268.4MB in the end (delta: 92.3MB). Free memory was 119.1MB in the beginning and 118.4MB in the end (delta: 761.3kB). Peak memory consumption was 95.5MB. Max. memory is 16.1GB. * Witness Printer took 116.89ms. Allocated memory is still 268.4MB. Free memory was 118.4MB in the beginning and 95.9MB in the end (delta: 22.5MB). Peak memory consumption was 25.2MB. 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 t12_pc = 0; [L513] int m_st ; [L514] int t1_st ; [L515] int t2_st ; [L516] int t3_st ; [L517] int t4_st ; [L518] int t5_st ; [L519] int t6_st ; [L520] int t7_st ; [L521] int t8_st ; [L522] int t9_st ; [L523] int t10_st ; [L524] int t11_st ; [L525] int t12_st ; [L526] int m_i ; [L527] int t1_i ; [L528] int t2_i ; [L529] int t3_i ; [L530] int t4_i ; [L531] int t5_i ; [L532] int t6_i ; [L533] int t7_i ; [L534] int t8_i ; [L535] int t9_i ; [L536] int t10_i ; [L537] int t11_i ; [L538] int t12_i ; [L539] int M_E = 2; [L540] int T1_E = 2; [L541] int T2_E = 2; [L542] int T3_E = 2; [L543] int T4_E = 2; [L544] int T5_E = 2; [L545] int T6_E = 2; [L546] int T7_E = 2; [L547] int T8_E = 2; [L548] int T9_E = 2; [L549] int T10_E = 2; [L550] int T11_E = 2; [L551] int T12_E = 2; [L552] int E_M = 2; [L553] int E_1 = 2; [L554] int E_2 = 2; [L555] int E_3 = 2; [L556] int E_4 = 2; [L557] int E_5 = 2; [L558] int E_6 = 2; [L559] int E_7 = 2; [L560] int E_8 = 2; [L561] int E_9 = 2; [L562] int E_10 = 2; [L563] int E_11 = 2; [L564] int E_12 = 2; [L579] int token ; [L581] int local ; VAL [E_10=2, E_11=2, E_12=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, T12_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, t12_i=0, t12_pc=0, t12_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] [L2337] COND TRUE __VERIFIER_nondet_int() [L2338] 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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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_12=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, T12_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, t12_i=0, t12_pc=0, t12_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, 497 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 11.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9512 SdHoareTripleChecker+Valid, 7.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9430 mSDsluCounter, 13973 SdHoareTripleChecker+Invalid, 5.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11317 mSDsCounter, 1260 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10458 IncrementalHoareTripleChecker+Invalid, 11718 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1260 mSolverCounterUnsat, 2656 mSDtfsCounter, 10458 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 233 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1866occurred 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, 761 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 348 ConstructedInterpolants, 0 QuantifiedInterpolants, 789 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-07 01:47:44,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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