./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.07.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.07.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fb1091d73aa20044da5f23529d9b458b78a9fc672c28c9226a1c2bddab62484e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 16:20:30,760 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 16:20:30,812 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 16:20:30,816 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 16:20:30,817 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 16:20:30,839 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 16:20:30,840 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 16:20:30,840 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 16:20:30,841 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 16:20:30,844 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 16:20:30,844 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 16:20:30,844 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 16:20:30,844 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 16:20:30,845 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 16:20:30,846 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 16:20:30,846 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 16:20:30,846 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 16:20:30,846 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 16:20:30,846 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 16:20:30,847 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 16:20:30,847 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 16:20:30,847 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 16:20:30,847 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 16:20:30,847 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 16:20:30,848 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 16:20:30,848 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 16:20:30,848 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 16:20:30,848 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 16:20:30,848 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 16:20:30,849 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 16:20:30,849 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 16:20:30,850 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 16:20:30,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 16:20:30,850 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 16:20:30,850 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 16:20:30,851 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 16:20:30,851 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 16:20:30,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 16:20:30,851 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 16:20:30,851 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 16:20:30,851 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 16:20:30,852 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 16:20:30,852 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fb1091d73aa20044da5f23529d9b458b78a9fc672c28c9226a1c2bddab62484e [2024-11-18 16:20:31,039 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 16:20:31,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 16:20:31,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 16:20:31,063 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 16:20:31,063 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 16:20:31,064 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.07.cil-1.c [2024-11-18 16:20:32,295 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 16:20:32,463 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 16:20:32,464 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.07.cil-1.c [2024-11-18 16:20:32,477 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/660cd9f28/8fb73474e9254742894cec594ed3af8e/FLAG91c84c350 [2024-11-18 16:20:32,487 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/660cd9f28/8fb73474e9254742894cec594ed3af8e [2024-11-18 16:20:32,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 16:20:32,490 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 16:20:32,491 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 16:20:32,491 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 16:20:32,495 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 16:20:32,496 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:20:32" (1/1) ... [2024-11-18 16:20:32,496 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a66083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:20:32, skipping insertion in model container [2024-11-18 16:20:32,497 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:20:32" (1/1) ... [2024-11-18 16:20:32,536 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 16:20:32,685 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.07.cil-1.c[914,927] [2024-11-18 16:20:32,720 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.07.cil-1.c[7125,7138] [2024-11-18 16:20:32,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 16:20:32,804 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 16:20:32,814 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.07.cil-1.c[914,927] [2024-11-18 16:20:32,828 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.07.cil-1.c[7125,7138] [2024-11-18 16:20:32,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 16:20:32,884 INFO L204 MainTranslator]: Completed translation [2024-11-18 16:20:32,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:20:32 WrapperNode [2024-11-18 16:20:32,884 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 16:20:32,886 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 16:20:32,886 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 16:20:32,886 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 16:20:32,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:20:32" (1/1) ... [2024-11-18 16:20:32,907 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:20:32" (1/1) ... [2024-11-18 16:20:32,937 INFO L138 Inliner]: procedures = 67, calls = 79, calls flagged for inlining = 36, calls inlined = 36, statements flattened = 769 [2024-11-18 16:20:32,938 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 16:20:32,938 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 16:20:32,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 16:20:32,938 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 16:20:32,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:20:32" (1/1) ... [2024-11-18 16:20:32,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:20:32" (1/1) ... [2024-11-18 16:20:32,949 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:20:32" (1/1) ... [2024-11-18 16:20:32,968 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-18 16:20:32,968 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:20:32" (1/1) ... [2024-11-18 16:20:32,969 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:20:32" (1/1) ... [2024-11-18 16:20:32,980 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:20:32" (1/1) ... [2024-11-18 16:20:32,990 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:20:32" (1/1) ... [2024-11-18 16:20:32,996 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:20:32" (1/1) ... [2024-11-18 16:20:33,001 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:20:32" (1/1) ... [2024-11-18 16:20:33,007 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 16:20:33,008 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 16:20:33,008 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 16:20:33,008 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 16:20:33,009 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:20:32" (1/1) ... [2024-11-18 16:20:33,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 16:20:33,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:20:33,040 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 16:20:33,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 16:20:33,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 16:20:33,078 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-18 16:20:33,078 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-18 16:20:33,078 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-18 16:20:33,079 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-18 16:20:33,080 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-18 16:20:33,080 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-18 16:20:33,080 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-18 16:20:33,080 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-18 16:20:33,080 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-18 16:20:33,080 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-18 16:20:33,080 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-18 16:20:33,080 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-18 16:20:33,080 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-18 16:20:33,080 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-18 16:20:33,081 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-18 16:20:33,081 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-18 16:20:33,081 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-18 16:20:33,081 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-18 16:20:33,081 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-18 16:20:33,081 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-18 16:20:33,081 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-18 16:20:33,081 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-18 16:20:33,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 16:20:33,081 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-18 16:20:33,081 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-18 16:20:33,081 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-18 16:20:33,082 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-18 16:20:33,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 16:20:33,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 16:20:33,082 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-18 16:20:33,082 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-18 16:20:33,225 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 16:20:33,227 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 16:20:33,839 INFO L? ?]: Removed 97 outVars from TransFormulas that were not future-live. [2024-11-18 16:20:33,839 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 16:20:33,856 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 16:20:33,856 INFO L316 CfgBuilder]: Removed 14 assume(true) statements. [2024-11-18 16:20:33,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:20:33 BoogieIcfgContainer [2024-11-18 16:20:33,856 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 16:20:33,858 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 16:20:33,860 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 16:20:33,862 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 16:20:33,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 04:20:32" (1/3) ... [2024-11-18 16:20:33,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fc1d659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:20:33, skipping insertion in model container [2024-11-18 16:20:33,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:20:32" (2/3) ... [2024-11-18 16:20:33,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fc1d659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:20:33, skipping insertion in model container [2024-11-18 16:20:33,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:20:33" (3/3) ... [2024-11-18 16:20:33,864 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.07.cil-1.c [2024-11-18 16:20:33,875 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 16:20:33,875 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-18 16:20:33,926 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 16:20:33,930 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;@4bfcf46c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 16:20:33,931 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-18 16:20:33,935 INFO L276 IsEmpty]: Start isEmpty. Operand has 367 states, 314 states have (on average 1.5987261146496816) internal successors, (502), 321 states have internal predecessors, (502), 36 states have call successors, (36), 14 states have call predecessors, (36), 14 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-18 16:20:33,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-18 16:20:33,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:20:33,944 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-18 16:20:33,945 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:20:33,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:20:33,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1654146371, now seen corresponding path program 1 times [2024-11-18 16:20:33,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:20:33,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201072357] [2024-11-18 16:20:33,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:20:33,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:20:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:20:34,193 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-18 16:20:34,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:20:34,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201072357] [2024-11-18 16:20:34,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201072357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:20:34,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:20:34,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 16:20:34,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627406354] [2024-11-18 16:20:34,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:20:34,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:20:34,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:20:34,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:20:34,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 16:20:34,256 INFO L87 Difference]: Start difference. First operand has 367 states, 314 states have (on average 1.5987261146496816) internal successors, (502), 321 states have internal predecessors, (502), 36 states have call successors, (36), 14 states have call predecessors, (36), 14 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-18 16:20:34,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:20:34,365 INFO L93 Difference]: Finished difference Result 712 states and 1111 transitions. [2024-11-18 16:20:34,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:20:34,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2024-11-18 16:20:34,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:20:34,381 INFO L225 Difference]: With dead ends: 712 [2024-11-18 16:20:34,381 INFO L226 Difference]: Without dead ends: 357 [2024-11-18 16:20:34,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 16:20:34,388 INFO L432 NwaCegarLoop]: 537 mSDtfsCounter, 132 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:20:34,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 940 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:20:34,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-18 16:20:34,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2024-11-18 16:20:34,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 306 states have (on average 1.5065359477124183) internal successors, (461), 311 states have internal predecessors, (461), 36 states have call successors, (36), 14 states have call predecessors, (36), 13 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-18 16:20:34,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 530 transitions. [2024-11-18 16:20:34,445 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 530 transitions. Word has length 59 [2024-11-18 16:20:34,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:20:34,446 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 530 transitions. [2024-11-18 16:20:34,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-18 16:20:34,448 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 530 transitions. [2024-11-18 16:20:34,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-18 16:20:34,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:20:34,452 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-18 16:20:34,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 16:20:34,452 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:20:34,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:20:34,454 INFO L85 PathProgramCache]: Analyzing trace with hash 2135226629, now seen corresponding path program 1 times [2024-11-18 16:20:34,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:20:34,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194522339] [2024-11-18 16:20:34,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:20:34,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:20:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:20:34,650 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-18 16:20:34,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:20:34,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194522339] [2024-11-18 16:20:34,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194522339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:20:34,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:20:34,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 16:20:34,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466413732] [2024-11-18 16:20:34,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:20:34,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 16:20:34,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:20:34,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 16:20:34,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 16:20:34,653 INFO L87 Difference]: Start difference. First operand 357 states and 530 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 3 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-18 16:20:35,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:20:35,249 INFO L93 Difference]: Finished difference Result 550 states and 800 transitions. [2024-11-18 16:20:35,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 16:20:35,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 3 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-18 16:20:35,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:20:35,257 INFO L225 Difference]: With dead ends: 550 [2024-11-18 16:20:35,257 INFO L226 Difference]: Without dead ends: 461 [2024-11-18 16:20:35,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:20:35,259 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 375 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 16:20:35,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 1139 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 16:20:35,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2024-11-18 16:20:35,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 453. [2024-11-18 16:20:35,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 382 states have (on average 1.4790575916230366) internal successors, (565), 389 states have internal predecessors, (565), 47 states have call successors, (47), 21 states have call predecessors, (47), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2024-11-18 16:20:35,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 661 transitions. [2024-11-18 16:20:35,299 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 661 transitions. Word has length 59 [2024-11-18 16:20:35,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:20:35,299 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 661 transitions. [2024-11-18 16:20:35,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 3 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-18 16:20:35,299 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 661 transitions. [2024-11-18 16:20:35,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-18 16:20:35,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:20:35,301 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-18 16:20:35,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 16:20:35,301 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:20:35,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:20:35,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1397091036, now seen corresponding path program 1 times [2024-11-18 16:20:35,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:20:35,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024334344] [2024-11-18 16:20:35,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:20:35,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:20:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:20:35,505 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-18 16:20:35,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:20:35,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024334344] [2024-11-18 16:20:35,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024334344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:20:35,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:20:35,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 16:20:35,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094108859] [2024-11-18 16:20:35,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:20:35,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 16:20:35,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:20:35,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 16:20:35,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:20:35,508 INFO L87 Difference]: Start difference. First operand 453 states and 661 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 3 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-18 16:20:36,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:20:36,106 INFO L93 Difference]: Finished difference Result 772 states and 1093 transitions. [2024-11-18 16:20:36,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 16:20:36,107 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 3 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-18 16:20:36,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:20:36,112 INFO L225 Difference]: With dead ends: 772 [2024-11-18 16:20:36,112 INFO L226 Difference]: Without dead ends: 594 [2024-11-18 16:20:36,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-18 16:20:36,115 INFO L432 NwaCegarLoop]: 363 mSDtfsCounter, 785 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 16:20:36,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 1373 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 16:20:36,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2024-11-18 16:20:36,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 549. [2024-11-18 16:20:36,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 458 states have (on average 1.4585152838427948) internal successors, (668), 467 states have internal predecessors, (668), 58 states have call successors, (58), 28 states have call predecessors, (58), 31 states have return successors, (68), 57 states have call predecessors, (68), 55 states have call successors, (68) [2024-11-18 16:20:36,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 794 transitions. [2024-11-18 16:20:36,164 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 794 transitions. Word has length 59 [2024-11-18 16:20:36,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:20:36,165 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 794 transitions. [2024-11-18 16:20:36,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 3 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-18 16:20:36,165 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 794 transitions. [2024-11-18 16:20:36,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-18 16:20:36,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:20:36,169 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-18 16:20:36,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 16:20:36,170 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:20:36,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:20:36,170 INFO L85 PathProgramCache]: Analyzing trace with hash -503604698, now seen corresponding path program 1 times [2024-11-18 16:20:36,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:20:36,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499922685] [2024-11-18 16:20:36,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:20:36,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:20:36,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:20:36,241 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-18 16:20:36,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:20:36,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499922685] [2024-11-18 16:20:36,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499922685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:20:36,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:20:36,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 16:20:36,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884681790] [2024-11-18 16:20:36,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:20:36,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 16:20:36,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:20:36,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 16:20:36,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:20:36,243 INFO L87 Difference]: Start difference. First operand 549 states and 794 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-18 16:20:36,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:20:36,283 INFO L93 Difference]: Finished difference Result 822 states and 1168 transitions. [2024-11-18 16:20:36,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 16:20:36,283 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2024-11-18 16:20:36,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:20:36,287 INFO L225 Difference]: With dead ends: 822 [2024-11-18 16:20:36,287 INFO L226 Difference]: Without dead ends: 554 [2024-11-18 16:20:36,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:20:36,292 INFO L432 NwaCegarLoop]: 527 mSDtfsCounter, 0 mSDsluCounter, 2103 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2630 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:20:36,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2630 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:20:36,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-11-18 16:20:36,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2024-11-18 16:20:36,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 462 states have (on average 1.4502164502164503) internal successors, (670), 471 states have internal predecessors, (670), 58 states have call successors, (58), 28 states have call predecessors, (58), 32 states have return successors, (69), 58 states have call predecessors, (69), 55 states have call successors, (69) [2024-11-18 16:20:36,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 797 transitions. [2024-11-18 16:20:36,320 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 797 transitions. Word has length 59 [2024-11-18 16:20:36,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:20:36,322 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 797 transitions. [2024-11-18 16:20:36,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-18 16:20:36,322 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 797 transitions. [2024-11-18 16:20:36,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-18 16:20:36,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:20:36,325 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-18 16:20:36,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 16:20:36,326 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:20:36,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:20:36,326 INFO L85 PathProgramCache]: Analyzing trace with hash -228845084, now seen corresponding path program 1 times [2024-11-18 16:20:36,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:20:36,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484031034] [2024-11-18 16:20:36,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:20:36,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:20:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:20:36,401 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-18 16:20:36,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:20:36,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484031034] [2024-11-18 16:20:36,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484031034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:20:36,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:20:36,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 16:20:36,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005523128] [2024-11-18 16:20:36,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:20:36,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 16:20:36,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:20:36,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 16:20:36,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:20:36,405 INFO L87 Difference]: Start difference. First operand 554 states and 797 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 4 states have call successors, (8), 2 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-18 16:20:36,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:20:36,934 INFO L93 Difference]: Finished difference Result 2581 states and 3582 transitions. [2024-11-18 16:20:36,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 16:20:36,934 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 4 states have call successors, (8), 2 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-18 16:20:36,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:20:36,943 INFO L225 Difference]: With dead ends: 2581 [2024-11-18 16:20:36,943 INFO L226 Difference]: Without dead ends: 2308 [2024-11-18 16:20:36,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-18 16:20:36,945 INFO L432 NwaCegarLoop]: 749 mSDtfsCounter, 1618 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1624 SdHoareTripleChecker+Valid, 2189 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 16:20:36,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1624 Valid, 2189 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 16:20:36,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2308 states. [2024-11-18 16:20:37,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2308 to 2138. [2024-11-18 16:20:37,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2138 states, 1707 states have (on average 1.3491505565319273) internal successors, (2303), 1744 states have internal predecessors, (2303), 223 states have call successors, (223), 172 states have call predecessors, (223), 206 states have return successors, (338), 225 states have call predecessors, (338), 220 states have call successors, (338) [2024-11-18 16:20:37,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 2138 states and 2864 transitions. [2024-11-18 16:20:37,068 INFO L78 Accepts]: Start accepts. Automaton has 2138 states and 2864 transitions. Word has length 59 [2024-11-18 16:20:37,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:20:37,069 INFO L471 AbstractCegarLoop]: Abstraction has 2138 states and 2864 transitions. [2024-11-18 16:20:37,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 4 states have call successors, (8), 2 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-18 16:20:37,069 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 2864 transitions. [2024-11-18 16:20:37,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-18 16:20:37,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:20:37,081 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-18 16:20:37,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 16:20:37,081 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:20:37,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:20:37,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1200519771, now seen corresponding path program 1 times [2024-11-18 16:20:37,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:20:37,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563772839] [2024-11-18 16:20:37,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:20:37,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:20:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:20:37,210 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-18 16:20:37,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:20:37,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563772839] [2024-11-18 16:20:37,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563772839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:20:37,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:20:37,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 16:20:37,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264724738] [2024-11-18 16:20:37,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:20:37,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 16:20:37,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:20:37,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 16:20:37,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:20:37,213 INFO L87 Difference]: Start difference. First operand 2138 states and 2864 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 3 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-18 16:20:37,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:20:37,897 INFO L93 Difference]: Finished difference Result 3871 states and 5105 transitions. [2024-11-18 16:20:37,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 16:20:37,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 3 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-18 16:20:37,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:20:37,907 INFO L225 Difference]: With dead ends: 3871 [2024-11-18 16:20:37,907 INFO L226 Difference]: Without dead ends: 2366 [2024-11-18 16:20:37,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-18 16:20:37,911 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 777 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 16:20:37,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 1162 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 16:20:37,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2366 states. [2024-11-18 16:20:37,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2366 to 2151. [2024-11-18 16:20:37,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2151 states, 1721 states have (on average 1.3434049970947124) internal successors, (2312), 1754 states have internal predecessors, (2312), 224 states have call successors, (224), 173 states have call predecessors, (224), 204 states have return successors, (327), 227 states have call predecessors, (327), 221 states have call successors, (327) [2024-11-18 16:20:38,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2151 states to 2151 states and 2863 transitions. [2024-11-18 16:20:38,003 INFO L78 Accepts]: Start accepts. Automaton has 2151 states and 2863 transitions. Word has length 59 [2024-11-18 16:20:38,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:20:38,005 INFO L471 AbstractCegarLoop]: Abstraction has 2151 states and 2863 transitions. [2024-11-18 16:20:38,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 3 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-18 16:20:38,005 INFO L276 IsEmpty]: Start isEmpty. Operand 2151 states and 2863 transitions. [2024-11-18 16:20:38,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-18 16:20:38,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:20:38,006 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-18 16:20:38,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 16:20:38,007 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:20:38,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:20:38,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1100302819, now seen corresponding path program 1 times [2024-11-18 16:20:38,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:20:38,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29665698] [2024-11-18 16:20:38,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:20:38,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:20:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 16:20:38,025 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 16:20:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 16:20:38,069 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 16:20:38,069 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 16:20:38,070 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-18 16:20:38,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-18 16:20:38,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 16:20:38,074 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:20:38,160 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 16:20:38,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 04:20:38 BoogieIcfgContainer [2024-11-18 16:20:38,163 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 16:20:38,164 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 16:20:38,164 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 16:20:38,164 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 16:20:38,164 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:20:33" (3/4) ... [2024-11-18 16:20:38,165 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-18 16:20:38,319 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 16:20:38,320 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 16:20:38,320 INFO L158 Benchmark]: Toolchain (without parser) took 5829.83ms. Allocated memory was 136.3MB in the beginning and 245.4MB in the end (delta: 109.1MB). Free memory was 65.9MB in the beginning and 198.5MB in the end (delta: -132.6MB). Peak memory consumption was 112.0MB. Max. memory is 16.1GB. [2024-11-18 16:20:38,320 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 136.3MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 16:20:38,320 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.85ms. Allocated memory was 136.3MB in the beginning and 197.1MB in the end (delta: 60.8MB). Free memory was 65.8MB in the beginning and 156.3MB in the end (delta: -90.5MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2024-11-18 16:20:38,321 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.06ms. Allocated memory is still 197.1MB. Free memory was 156.3MB in the beginning and 152.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 16:20:38,321 INFO L158 Benchmark]: Boogie Preprocessor took 68.82ms. Allocated memory is still 197.1MB. Free memory was 152.1MB in the beginning and 147.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 16:20:38,321 INFO L158 Benchmark]: RCFGBuilder took 848.65ms. Allocated memory is still 197.1MB. Free memory was 147.9MB in the beginning and 89.2MB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-11-18 16:20:38,321 INFO L158 Benchmark]: TraceAbstraction took 4305.39ms. Allocated memory was 197.1MB in the beginning and 245.4MB in the end (delta: 48.2MB). Free memory was 88.1MB in the beginning and 76.8MB in the end (delta: 11.3MB). Peak memory consumption was 58.5MB. Max. memory is 16.1GB. [2024-11-18 16:20:38,321 INFO L158 Benchmark]: Witness Printer took 155.83ms. Allocated memory is still 245.4MB. Free memory was 76.8MB in the beginning and 198.5MB in the end (delta: -121.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-18 16:20:38,323 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.15ms. Allocated memory is still 136.3MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.85ms. Allocated memory was 136.3MB in the beginning and 197.1MB in the end (delta: 60.8MB). Free memory was 65.8MB in the beginning and 156.3MB in the end (delta: -90.5MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.06ms. Allocated memory is still 197.1MB. Free memory was 156.3MB in the beginning and 152.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.82ms. Allocated memory is still 197.1MB. Free memory was 152.1MB in the beginning and 147.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 848.65ms. Allocated memory is still 197.1MB. Free memory was 147.9MB in the beginning and 89.2MB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4305.39ms. Allocated memory was 197.1MB in the beginning and 245.4MB in the end (delta: 48.2MB). Free memory was 88.1MB in the beginning and 76.8MB in the end (delta: 11.3MB). Peak memory consumption was 58.5MB. Max. memory is 16.1GB. * Witness Printer took 155.83ms. Allocated memory is still 245.4MB. Free memory was 76.8MB in the beginning and 198.5MB in the end (delta: -121.7MB). Peak memory consumption was 12.6MB. 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 m_st ; [L509] int t1_st ; [L510] int t2_st ; [L511] int t3_st ; [L512] int t4_st ; [L513] int t5_st ; [L514] int t6_st ; [L515] int t7_st ; [L516] int m_i ; [L517] int t1_i ; [L518] int t2_i ; [L519] int t3_i ; [L520] int t4_i ; [L521] int t5_i ; [L522] int t6_i ; [L523] int t7_i ; [L524] int M_E = 2; [L525] int T1_E = 2; [L526] int T2_E = 2; [L527] int T3_E = 2; [L528] int T4_E = 2; [L529] int T5_E = 2; [L530] int T6_E = 2; [L531] int T7_E = 2; [L532] int E_M = 2; [L533] int E_1 = 2; [L534] int E_2 = 2; [L535] int E_3 = 2; [L536] int E_4 = 2; [L537] int E_5 = 2; [L538] int E_6 = 2; [L539] int E_7 = 2; [L549] int token ; [L551] int local ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L1712] COND TRUE __VERIFIER_nondet_int() [L1713] 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_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L478] RET init_model1() [L479] CALL start_simulation1() [L414] int kernel_st ; [L415] int tmp ; [L419] kernel_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L420] CALL update_channels1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L230] COND FALSE !((int )q_req_up == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L420] RET update_channels1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L421] CALL init_threads1() [L245] COND TRUE (int )p_dw_i == 1 [L246] p_dw_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L250] COND TRUE (int )c_dr_i == 1 [L251] c_dr_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L421] RET init_threads1() [L422] CALL fire_delta_events1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L283] COND FALSE !((int )q_read_ev == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L288] COND FALSE !((int )q_write_ev == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L422] RET fire_delta_events1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L423] CALL activate_threads1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L316] int tmp ; [L317] int tmp___0 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L321] CALL, EXPR is_do_write_p_triggered() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L70] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L73] COND FALSE !((int )p_dw_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L83] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L85] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L321] RET, EXPR is_do_write_p_triggered() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L321] tmp = is_do_write_p_triggered() [L323] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L329] CALL, EXPR is_do_read_c_triggered() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L89] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L92] COND FALSE !((int )c_dr_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L102] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L104] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L329] RET, EXPR is_do_read_c_triggered() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L329] tmp___0 = is_do_read_c_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L423] RET activate_threads1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L424] CALL reset_delta_events1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L301] COND FALSE !((int )q_read_ev == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L306] COND FALSE !((int )q_write_ev == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L424] RET reset_delta_events1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L427] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L430] kernel_st = 1 [L431] CALL eval1() [L341] int tmp ; [L342] int tmp___0 ; [L343] int tmp___1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L347] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L350] CALL, EXPR exists_runnable_thread1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L260] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L263] COND TRUE (int )p_dw_st == 0 [L264] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L276] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L350] RET, EXPR exists_runnable_thread1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L350] tmp___1 = exists_runnable_thread1() [L352] COND TRUE \read(tmp___1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L357] COND TRUE (int )p_dw_st == 0 [L359] tmp = __VERIFIER_nondet_int() [L361] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L367] CALL error1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, token=0] [L28] reach_error() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_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, 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, 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, 367 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3753 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3687 mSDsluCounter, 9433 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6630 mSDsCounter, 482 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3182 IncrementalHoareTripleChecker+Invalid, 3664 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 482 mSolverCounterUnsat, 2803 mSDtfsCounter, 3182 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2151occurred in iteration=6, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 6 MinimizatonAttempts, 438 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 348 ConstructedInterpolants, 0 QuantifiedInterpolants, 581 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-18 16:20:38,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE