./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix013.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a454acab-97e4-4819-a707-ffbbb31e8be6/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a454acab-97e4-4819-a707-ffbbb31e8be6/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a454acab-97e4-4819-a707-ffbbb31e8be6/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a454acab-97e4-4819-a707-ffbbb31e8be6/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix013.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a454acab-97e4-4819-a707-ffbbb31e8be6/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a454acab-97e4-4819-a707-ffbbb31e8be6/bin/uautomizer-verify-BQ2R08f2Ya --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 39bd8ca48891731a487992488872bfabe93c299f5e64a0d2d763ed7464a4fc31 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:52:18,822 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:52:18,886 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a454acab-97e4-4819-a707-ffbbb31e8be6/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 04:52:18,890 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:52:18,891 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:52:18,915 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:52:18,916 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:52:18,916 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:52:18,917 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:52:18,917 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:52:18,918 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:52:18,918 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:52:18,919 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:52:18,920 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:52:18,920 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:52:18,921 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:52:18,921 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:52:18,922 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:52:18,922 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:52:18,923 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:52:18,923 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:52:18,924 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:52:18,924 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:52:18,925 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:52:18,925 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:52:18,925 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:52:18,926 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:52:18,926 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:52:18,927 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:52:18,927 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:52:18,927 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:52:18,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:52:18,928 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:52:18,929 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:52:18,929 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:52:18,929 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:52:18,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:52:18,930 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:52:18,931 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:52:18,931 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:52:18,931 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:52:18,936 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:52:18,937 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a454acab-97e4-4819-a707-ffbbb31e8be6/bin/uautomizer-verify-BQ2R08f2Ya/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a454acab-97e4-4819-a707-ffbbb31e8be6/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 39bd8ca48891731a487992488872bfabe93c299f5e64a0d2d763ed7464a4fc31 [2023-11-29 04:52:19,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:52:19,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:52:19,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:52:19,191 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:52:19,192 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:52:19,193 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a454acab-97e4-4819-a707-ffbbb31e8be6/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix013.oepc.i [2023-11-29 04:52:21,893 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:52:22,126 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:52:22,127 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a454acab-97e4-4819-a707-ffbbb31e8be6/sv-benchmarks/c/pthread-wmm/mix013.oepc.i [2023-11-29 04:52:22,144 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a454acab-97e4-4819-a707-ffbbb31e8be6/bin/uautomizer-verify-BQ2R08f2Ya/data/6929d7670/463c32aca20b479da54d581644b7f251/FLAG61c3558c0 [2023-11-29 04:52:22,156 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a454acab-97e4-4819-a707-ffbbb31e8be6/bin/uautomizer-verify-BQ2R08f2Ya/data/6929d7670/463c32aca20b479da54d581644b7f251 [2023-11-29 04:52:22,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:52:22,159 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:52:22,160 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:52:22,161 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:52:22,166 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:52:22,166 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:52:22" (1/1) ... [2023-11-29 04:52:22,167 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f48bd88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:52:22, skipping insertion in model container [2023-11-29 04:52:22,167 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:52:22" (1/1) ... [2023-11-29 04:52:22,217 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:52:22,357 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a454acab-97e4-4819-a707-ffbbb31e8be6/sv-benchmarks/c/pthread-wmm/mix013.oepc.i[945,958] [2023-11-29 04:52:22,539 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:52:22,551 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:52:22,563 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a454acab-97e4-4819-a707-ffbbb31e8be6/sv-benchmarks/c/pthread-wmm/mix013.oepc.i[945,958] [2023-11-29 04:52:22,609 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:52:22,642 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:52:22,642 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:52:22,650 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:52:22,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:52:22 WrapperNode [2023-11-29 04:52:22,651 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:52:22,652 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:52:22,652 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:52:22,652 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:52:22,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:52:22" (1/1) ... [2023-11-29 04:52:22,678 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:52:22" (1/1) ... [2023-11-29 04:52:22,704 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2023-11-29 04:52:22,704 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:52:22,705 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:52:22,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:52:22,705 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:52:22,717 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:52:22" (1/1) ... [2023-11-29 04:52:22,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:52:22" (1/1) ... [2023-11-29 04:52:22,721 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:52:22" (1/1) ... [2023-11-29 04:52:22,739 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2023-11-29 04:52:22,740 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:52:22" (1/1) ... [2023-11-29 04:52:22,740 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:52:22" (1/1) ... [2023-11-29 04:52:22,751 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:52:22" (1/1) ... [2023-11-29 04:52:22,753 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:52:22" (1/1) ... [2023-11-29 04:52:22,756 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:52:22" (1/1) ... [2023-11-29 04:52:22,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:52:22" (1/1) ... [2023-11-29 04:52:22,764 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:52:22,765 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:52:22,765 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:52:22,765 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:52:22,766 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:52:22" (1/1) ... [2023-11-29 04:52:22,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:52:22,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a454acab-97e4-4819-a707-ffbbb31e8be6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:52:22,793 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a454acab-97e4-4819-a707-ffbbb31e8be6/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:52:22,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a454acab-97e4-4819-a707-ffbbb31e8be6/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:52:22,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 04:52:22,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 04:52:22,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 04:52:22,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 04:52:22,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 04:52:22,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 04:52:22,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:52:22,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:52:22,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:52:22,822 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 04:52:22,822 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 04:52:22,822 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 04:52:22,822 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 04:52:22,822 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 04:52:22,822 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 04:52:22,822 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-29 04:52:22,823 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-29 04:52:22,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:52:22,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 04:52:22,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 04:52:22,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 04:52:22,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 04:52:22,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 04:52:22,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:52:22,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:52:22,825 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 04:52:22,964 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:52:22,966 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:52:23,259 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:52:23,514 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:52:23,514 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 04:52:23,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:52:23 BoogieIcfgContainer [2023-11-29 04:52:23,515 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:52:23,518 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:52:23,518 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:52:23,521 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:52:23,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:52:22" (1/3) ... [2023-11-29 04:52:23,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b1517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:52:23, skipping insertion in model container [2023-11-29 04:52:23,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:52:22" (2/3) ... [2023-11-29 04:52:23,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b1517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:52:23, skipping insertion in model container [2023-11-29 04:52:23,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:52:23" (3/3) ... [2023-11-29 04:52:23,524 INFO L112 eAbstractionObserver]: Analyzing ICFG mix013.oepc.i [2023-11-29 04:52:23,534 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 04:52:23,546 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:52:23,546 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-29 04:52:23,546 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 04:52:23,606 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 04:52:23,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 116 flow [2023-11-29 04:52:23,675 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2023-11-29 04:52:23,675 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:52:23,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 99 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2023-11-29 04:52:23,680 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 50 transitions, 116 flow [2023-11-29 04:52:23,684 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 46 transitions, 104 flow [2023-11-29 04:52:23,694 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:52:23,701 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@480be25d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:52:23,701 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-29 04:52:23,706 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 04:52:23,706 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-11-29 04:52:23,707 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:52:23,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:52:23,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-29 04:52:23,708 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 04:52:23,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:52:23,713 INFO L85 PathProgramCache]: Analyzing trace with hash 12487414, now seen corresponding path program 1 times [2023-11-29 04:52:23,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:52:23,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460782846] [2023-11-29 04:52:23,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:52:23,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:52:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:52:24,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:52:24,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:52:24,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460782846] [2023-11-29 04:52:24,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460782846] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:52:24,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:52:24,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:52:24,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374610414] [2023-11-29 04:52:24,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:52:24,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:52:24,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:52:24,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:52:24,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:52:24,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 50 [2023-11-29 04:52:24,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:24,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:52:24,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 50 [2023-11-29 04:52:24,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:52:24,888 INFO L124 PetriNetUnfolderBase]: 2495/3958 cut-off events. [2023-11-29 04:52:24,888 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2023-11-29 04:52:24,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7534 conditions, 3958 events. 2495/3958 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 25161 event pairs, 1647 based on Foata normal form. 135/4025 useless extension candidates. Maximal degree in co-relation 7522. Up to 2779 conditions per place. [2023-11-29 04:52:24,921 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 37 selfloop transitions, 2 changer transitions 2/62 dead transitions. [2023-11-29 04:52:24,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 62 transitions, 227 flow [2023-11-29 04:52:24,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:52:24,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:52:24,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-29 04:52:24,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7933333333333333 [2023-11-29 04:52:24,932 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-29 04:52:24,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-29 04:52:24,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:52:24,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-29 04:52:24,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:24,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:24,941 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:24,942 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 119 transitions. [2023-11-29 04:52:24,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 62 transitions, 227 flow [2023-11-29 04:52:24,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 62 transitions, 220 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 04:52:24,950 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 98 flow [2023-11-29 04:52:24,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2023-11-29 04:52:24,954 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2023-11-29 04:52:24,955 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 98 flow [2023-11-29 04:52:24,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:24,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:52:24,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:52:24,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:52:24,956 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 04:52:24,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:52:24,956 INFO L85 PathProgramCache]: Analyzing trace with hash -2031458290, now seen corresponding path program 1 times [2023-11-29 04:52:24,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:52:24,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932395417] [2023-11-29 04:52:24,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:52:24,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:52:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:52:25,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:52:25,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:52:25,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932395417] [2023-11-29 04:52:25,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932395417] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:52:25,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:52:25,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:52:25,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241490476] [2023-11-29 04:52:25,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:52:25,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:52:25,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:52:25,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:52:25,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:52:25,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 50 [2023-11-29 04:52:25,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:25,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:52:25,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 50 [2023-11-29 04:52:25,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:52:28,522 INFO L124 PetriNetUnfolderBase]: 16854/23936 cut-off events. [2023-11-29 04:52:28,522 INFO L125 PetriNetUnfolderBase]: For 1148/1148 co-relation queries the response was YES. [2023-11-29 04:52:28,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47957 conditions, 23936 events. 16854/23936 cut-off events. For 1148/1148 co-relation queries the response was YES. Maximal size of possible extension queue 1155. Compared 158910 event pairs, 8364 based on Foata normal form. 0/23417 useless extension candidates. Maximal degree in co-relation 47947. Up to 14786 conditions per place. [2023-11-29 04:52:28,672 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 38 selfloop transitions, 5 changer transitions 61/117 dead transitions. [2023-11-29 04:52:28,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 117 transitions, 472 flow [2023-11-29 04:52:28,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:52:28,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 04:52:28,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 242 transitions. [2023-11-29 04:52:28,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.605 [2023-11-29 04:52:28,677 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 242 transitions. [2023-11-29 04:52:28,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 242 transitions. [2023-11-29 04:52:28,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:52:28,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 242 transitions. [2023-11-29 04:52:28,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 30.25) internal successors, (242), 8 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:28,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 50.0) internal successors, (450), 9 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:28,683 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 50.0) internal successors, (450), 9 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:28,684 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 8 states and 242 transitions. [2023-11-29 04:52:28,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 117 transitions, 472 flow [2023-11-29 04:52:28,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 117 transitions, 456 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:52:28,688 INFO L231 Difference]: Finished difference. Result has 64 places, 46 transitions, 149 flow [2023-11-29 04:52:28,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=149, PETRI_PLACES=64, PETRI_TRANSITIONS=46} [2023-11-29 04:52:28,689 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2023-11-29 04:52:28,689 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 46 transitions, 149 flow [2023-11-29 04:52:28,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:28,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:52:28,690 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:52:28,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:52:28,690 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 04:52:28,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:52:28,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1347400197, now seen corresponding path program 1 times [2023-11-29 04:52:28,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:52:28,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118001334] [2023-11-29 04:52:28,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:52:28,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:52:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:52:28,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:52:28,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:52:28,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118001334] [2023-11-29 04:52:28,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118001334] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:52:28,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:52:28,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:52:28,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738836545] [2023-11-29 04:52:28,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:52:28,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:52:28,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:52:28,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:52:28,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:52:28,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 50 [2023-11-29 04:52:28,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 46 transitions, 149 flow. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:28,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:52:28,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 50 [2023-11-29 04:52:28,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:52:31,639 INFO L124 PetriNetUnfolderBase]: 12761/18463 cut-off events. [2023-11-29 04:52:31,639 INFO L125 PetriNetUnfolderBase]: For 17971/17981 co-relation queries the response was YES. [2023-11-29 04:52:31,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49252 conditions, 18463 events. 12761/18463 cut-off events. For 17971/17981 co-relation queries the response was YES. Maximal size of possible extension queue 865. Compared 119759 event pairs, 2141 based on Foata normal form. 490/18852 useless extension candidates. Maximal degree in co-relation 49237. Up to 11481 conditions per place. [2023-11-29 04:52:31,737 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 44 selfloop transitions, 3 changer transitions 55/115 dead transitions. [2023-11-29 04:52:31,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 115 transitions, 603 flow [2023-11-29 04:52:31,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:52:31,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 04:52:31,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 219 transitions. [2023-11-29 04:52:31,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6257142857142857 [2023-11-29 04:52:31,740 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 219 transitions. [2023-11-29 04:52:31,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 219 transitions. [2023-11-29 04:52:31,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:52:31,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 219 transitions. [2023-11-29 04:52:31,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 31.285714285714285) internal successors, (219), 7 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:31,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:31,745 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:31,745 INFO L175 Difference]: Start difference. First operand has 64 places, 46 transitions, 149 flow. Second operand 7 states and 219 transitions. [2023-11-29 04:52:31,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 115 transitions, 603 flow [2023-11-29 04:52:31,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 115 transitions, 590 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-11-29 04:52:31,982 INFO L231 Difference]: Finished difference. Result has 66 places, 46 transitions, 159 flow [2023-11-29 04:52:31,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=159, PETRI_PLACES=66, PETRI_TRANSITIONS=46} [2023-11-29 04:52:31,983 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 8 predicate places. [2023-11-29 04:52:31,984 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 46 transitions, 159 flow [2023-11-29 04:52:31,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:31,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:52:31,984 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:52:31,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 04:52:31,985 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 04:52:31,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:52:31,985 INFO L85 PathProgramCache]: Analyzing trace with hash -2082091911, now seen corresponding path program 1 times [2023-11-29 04:52:31,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:52:31,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841924457] [2023-11-29 04:52:31,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:52:31,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:52:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:52:32,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:52:32,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:52:32,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841924457] [2023-11-29 04:52:32,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841924457] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:52:32,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:52:32,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:52:32,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219745661] [2023-11-29 04:52:32,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:52:32,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:52:32,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:52:32,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:52:32,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:52:32,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 50 [2023-11-29 04:52:32,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 46 transitions, 159 flow. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:32,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:52:32,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 50 [2023-11-29 04:52:32,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:52:33,804 INFO L124 PetriNetUnfolderBase]: 7524/11879 cut-off events. [2023-11-29 04:52:33,805 INFO L125 PetriNetUnfolderBase]: For 9639/9936 co-relation queries the response was YES. [2023-11-29 04:52:33,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29133 conditions, 11879 events. 7524/11879 cut-off events. For 9639/9936 co-relation queries the response was YES. Maximal size of possible extension queue 611. Compared 85040 event pairs, 2265 based on Foata normal form. 320/11785 useless extension candidates. Maximal degree in co-relation 29114. Up to 6906 conditions per place. [2023-11-29 04:52:33,870 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 38 selfloop transitions, 3 changer transitions 41/102 dead transitions. [2023-11-29 04:52:33,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 102 transitions, 467 flow [2023-11-29 04:52:33,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:52:33,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 04:52:33,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 230 transitions. [2023-11-29 04:52:33,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6571428571428571 [2023-11-29 04:52:33,873 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 230 transitions. [2023-11-29 04:52:33,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 230 transitions. [2023-11-29 04:52:33,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:52:33,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 230 transitions. [2023-11-29 04:52:33,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 32.857142857142854) internal successors, (230), 7 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:33,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:33,876 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:33,877 INFO L175 Difference]: Start difference. First operand has 66 places, 46 transitions, 159 flow. Second operand 7 states and 230 transitions. [2023-11-29 04:52:33,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 102 transitions, 467 flow [2023-11-29 04:52:34,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 102 transitions, 445 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-11-29 04:52:34,067 INFO L231 Difference]: Finished difference. Result has 67 places, 46 transitions, 164 flow [2023-11-29 04:52:34,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=164, PETRI_PLACES=67, PETRI_TRANSITIONS=46} [2023-11-29 04:52:34,068 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2023-11-29 04:52:34,068 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 46 transitions, 164 flow [2023-11-29 04:52:34,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:34,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:52:34,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:52:34,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 04:52:34,069 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 04:52:34,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:52:34,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1611763899, now seen corresponding path program 1 times [2023-11-29 04:52:34,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:52:34,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83554738] [2023-11-29 04:52:34,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:52:34,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:52:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:52:34,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:52:34,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:52:34,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83554738] [2023-11-29 04:52:34,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83554738] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:52:34,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:52:34,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:52:34,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122305833] [2023-11-29 04:52:34,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:52:34,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:52:34,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:52:34,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:52:34,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:52:34,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2023-11-29 04:52:34,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 46 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:34,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:52:34,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2023-11-29 04:52:34,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:52:36,312 INFO L124 PetriNetUnfolderBase]: 12832/19160 cut-off events. [2023-11-29 04:52:36,313 INFO L125 PetriNetUnfolderBase]: For 8554/8852 co-relation queries the response was YES. [2023-11-29 04:52:36,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43297 conditions, 19160 events. 12832/19160 cut-off events. For 8554/8852 co-relation queries the response was YES. Maximal size of possible extension queue 1069. Compared 133807 event pairs, 2303 based on Foata normal form. 685/19092 useless extension candidates. Maximal degree in co-relation 43277. Up to 9128 conditions per place. [2023-11-29 04:52:36,559 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 53 selfloop transitions, 6 changer transitions 0/78 dead transitions. [2023-11-29 04:52:36,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 78 transitions, 352 flow [2023-11-29 04:52:36,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:52:36,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 04:52:36,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2023-11-29 04:52:36,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.705 [2023-11-29 04:52:36,561 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 141 transitions. [2023-11-29 04:52:36,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 141 transitions. [2023-11-29 04:52:36,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:52:36,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 141 transitions. [2023-11-29 04:52:36,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:36,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:36,564 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:36,564 INFO L175 Difference]: Start difference. First operand has 67 places, 46 transitions, 164 flow. Second operand 4 states and 141 transitions. [2023-11-29 04:52:36,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 78 transitions, 352 flow [2023-11-29 04:52:36,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 78 transitions, 338 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-11-29 04:52:36,720 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 196 flow [2023-11-29 04:52:36,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=196, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2023-11-29 04:52:36,722 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 4 predicate places. [2023-11-29 04:52:36,722 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 196 flow [2023-11-29 04:52:36,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:36,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:52:36,723 INFO L208 CegarLoopForPetriNet]: 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] [2023-11-29 04:52:36,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 04:52:36,723 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 04:52:36,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:52:36,724 INFO L85 PathProgramCache]: Analyzing trace with hash -671465006, now seen corresponding path program 1 times [2023-11-29 04:52:36,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:52:36,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885060938] [2023-11-29 04:52:36,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:52:36,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:52:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:52:36,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:52:36,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:52:36,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885060938] [2023-11-29 04:52:36,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885060938] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:52:36,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:52:36,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:52:36,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561768808] [2023-11-29 04:52:36,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:52:36,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:52:36,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:52:36,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:52:36,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:52:36,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2023-11-29 04:52:36,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 196 flow. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:36,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:52:36,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2023-11-29 04:52:36,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:52:39,150 INFO L124 PetriNetUnfolderBase]: 10884/16284 cut-off events. [2023-11-29 04:52:39,150 INFO L125 PetriNetUnfolderBase]: For 6210/6374 co-relation queries the response was YES. [2023-11-29 04:52:39,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39694 conditions, 16284 events. 10884/16284 cut-off events. For 6210/6374 co-relation queries the response was YES. Maximal size of possible extension queue 866. Compared 110133 event pairs, 1492 based on Foata normal form. 602/16226 useless extension candidates. Maximal degree in co-relation 39676. Up to 5576 conditions per place. [2023-11-29 04:52:39,233 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 69 selfloop transitions, 10 changer transitions 0/98 dead transitions. [2023-11-29 04:52:39,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 98 transitions, 477 flow [2023-11-29 04:52:39,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:52:39,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:52:39,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 181 transitions. [2023-11-29 04:52:39,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.724 [2023-11-29 04:52:39,235 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 181 transitions. [2023-11-29 04:52:39,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 181 transitions. [2023-11-29 04:52:39,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:52:39,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 181 transitions. [2023-11-29 04:52:39,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:39,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:39,237 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:39,237 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 196 flow. Second operand 5 states and 181 transitions. [2023-11-29 04:52:39,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 98 transitions, 477 flow [2023-11-29 04:52:39,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 98 transitions, 474 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:52:39,242 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 261 flow [2023-11-29 04:52:39,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=261, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2023-11-29 04:52:39,243 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2023-11-29 04:52:39,243 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 261 flow [2023-11-29 04:52:39,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:39,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:52:39,244 INFO L208 CegarLoopForPetriNet]: 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] [2023-11-29 04:52:39,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 04:52:39,244 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 04:52:39,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:52:39,244 INFO L85 PathProgramCache]: Analyzing trace with hash -122941350, now seen corresponding path program 1 times [2023-11-29 04:52:39,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:52:39,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425047316] [2023-11-29 04:52:39,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:52:39,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:52:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:52:39,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:52:39,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:52:39,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425047316] [2023-11-29 04:52:39,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425047316] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:52:39,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:52:39,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:52:39,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356714558] [2023-11-29 04:52:39,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:52:39,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:52:39,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:52:39,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:52:39,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:52:39,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2023-11-29 04:52:39,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 261 flow. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:39,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:52:39,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2023-11-29 04:52:39,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:52:41,052 INFO L124 PetriNetUnfolderBase]: 8800/12984 cut-off events. [2023-11-29 04:52:41,052 INFO L125 PetriNetUnfolderBase]: For 12658/12734 co-relation queries the response was YES. [2023-11-29 04:52:41,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35423 conditions, 12984 events. 8800/12984 cut-off events. For 12658/12734 co-relation queries the response was YES. Maximal size of possible extension queue 717. Compared 82679 event pairs, 1146 based on Foata normal form. 364/12751 useless extension candidates. Maximal degree in co-relation 35402. Up to 4412 conditions per place. [2023-11-29 04:52:41,142 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 83 selfloop transitions, 14 changer transitions 0/116 dead transitions. [2023-11-29 04:52:41,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 116 transitions, 624 flow [2023-11-29 04:52:41,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:52:41,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:52:41,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 219 transitions. [2023-11-29 04:52:41,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.73 [2023-11-29 04:52:41,145 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 219 transitions. [2023-11-29 04:52:41,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 219 transitions. [2023-11-29 04:52:41,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:52:41,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 219 transitions. [2023-11-29 04:52:41,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 36.5) internal successors, (219), 6 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:41,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:41,148 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:41,148 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 261 flow. Second operand 6 states and 219 transitions. [2023-11-29 04:52:41,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 116 transitions, 624 flow [2023-11-29 04:52:41,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 116 transitions, 608 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-29 04:52:41,164 INFO L231 Difference]: Finished difference. Result has 72 places, 61 transitions, 331 flow [2023-11-29 04:52:41,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=331, PETRI_PLACES=72, PETRI_TRANSITIONS=61} [2023-11-29 04:52:41,165 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 14 predicate places. [2023-11-29 04:52:41,165 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 61 transitions, 331 flow [2023-11-29 04:52:41,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:41,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:52:41,166 INFO L208 CegarLoopForPetriNet]: 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] [2023-11-29 04:52:41,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 04:52:41,166 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 04:52:41,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:52:41,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1889437754, now seen corresponding path program 1 times [2023-11-29 04:52:41,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:52:41,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781095656] [2023-11-29 04:52:41,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:52:41,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:52:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:52:42,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:52:42,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:52:42,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781095656] [2023-11-29 04:52:42,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781095656] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:52:42,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:52:42,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:52:42,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122757454] [2023-11-29 04:52:42,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:52:42,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:52:42,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:52:42,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:52:42,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:52:42,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2023-11-29 04:52:42,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 61 transitions, 331 flow. Second operand has 9 states, 9 states have (on average 24.11111111111111) internal successors, (217), 9 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:42,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:52:42,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2023-11-29 04:52:42,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:52:44,253 INFO L124 PetriNetUnfolderBase]: 10237/17543 cut-off events. [2023-11-29 04:52:44,253 INFO L125 PetriNetUnfolderBase]: For 22785/28615 co-relation queries the response was YES. [2023-11-29 04:52:44,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47903 conditions, 17543 events. 10237/17543 cut-off events. For 22785/28615 co-relation queries the response was YES. Maximal size of possible extension queue 1049. Compared 143621 event pairs, 3903 based on Foata normal form. 409/16289 useless extension candidates. Maximal degree in co-relation 47880. Up to 5463 conditions per place. [2023-11-29 04:52:44,363 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 84 selfloop transitions, 9 changer transitions 16/146 dead transitions. [2023-11-29 04:52:44,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 146 transitions, 825 flow [2023-11-29 04:52:44,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:52:44,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 04:52:44,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 286 transitions. [2023-11-29 04:52:44,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.715 [2023-11-29 04:52:44,364 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 286 transitions. [2023-11-29 04:52:44,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 286 transitions. [2023-11-29 04:52:44,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:52:44,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 286 transitions. [2023-11-29 04:52:44,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 35.75) internal successors, (286), 8 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:44,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 50.0) internal successors, (450), 9 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:44,367 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 50.0) internal successors, (450), 9 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:44,367 INFO L175 Difference]: Start difference. First operand has 72 places, 61 transitions, 331 flow. Second operand 8 states and 286 transitions. [2023-11-29 04:52:44,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 146 transitions, 825 flow [2023-11-29 04:52:44,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 146 transitions, 794 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-11-29 04:52:44,463 INFO L231 Difference]: Finished difference. Result has 81 places, 68 transitions, 362 flow [2023-11-29 04:52:44,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=362, PETRI_PLACES=81, PETRI_TRANSITIONS=68} [2023-11-29 04:52:44,464 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 23 predicate places. [2023-11-29 04:52:44,464 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 68 transitions, 362 flow [2023-11-29 04:52:44,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 24.11111111111111) internal successors, (217), 9 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:44,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:52:44,465 INFO L208 CegarLoopForPetriNet]: 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] [2023-11-29 04:52:44,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 04:52:44,465 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 04:52:44,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:52:44,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1686148232, now seen corresponding path program 2 times [2023-11-29 04:52:44,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:52:44,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597069741] [2023-11-29 04:52:44,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:52:44,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:52:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:52:44,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:52:44,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:52:44,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597069741] [2023-11-29 04:52:44,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597069741] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:52:44,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:52:44,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:52:44,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374649626] [2023-11-29 04:52:44,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:52:44,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:52:44,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:52:44,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:52:44,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:52:44,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2023-11-29 04:52:44,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 68 transitions, 362 flow. Second operand has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 7 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:44,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:52:44,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2023-11-29 04:52:44,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:52:49,593 INFO L124 PetriNetUnfolderBase]: 28612/45271 cut-off events. [2023-11-29 04:52:49,593 INFO L125 PetriNetUnfolderBase]: For 69209/74456 co-relation queries the response was YES. [2023-11-29 04:52:49,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141072 conditions, 45271 events. 28612/45271 cut-off events. For 69209/74456 co-relation queries the response was YES. Maximal size of possible extension queue 2467. Compared 380573 event pairs, 10206 based on Foata normal form. 1299/42872 useless extension candidates. Maximal degree in co-relation 141044. Up to 18918 conditions per place. [2023-11-29 04:52:49,889 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 96 selfloop transitions, 11 changer transitions 32/166 dead transitions. [2023-11-29 04:52:49,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 166 transitions, 1071 flow [2023-11-29 04:52:49,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:52:49,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 04:52:49,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 245 transitions. [2023-11-29 04:52:49,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6125 [2023-11-29 04:52:49,891 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 245 transitions. [2023-11-29 04:52:49,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 245 transitions. [2023-11-29 04:52:49,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:52:49,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 245 transitions. [2023-11-29 04:52:49,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 30.625) internal successors, (245), 8 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:49,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 50.0) internal successors, (450), 9 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:49,894 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 50.0) internal successors, (450), 9 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:49,894 INFO L175 Difference]: Start difference. First operand has 81 places, 68 transitions, 362 flow. Second operand 8 states and 245 transitions. [2023-11-29 04:52:49,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 166 transitions, 1071 flow [2023-11-29 04:52:50,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 166 transitions, 1042 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 04:52:50,899 INFO L231 Difference]: Finished difference. Result has 86 places, 73 transitions, 410 flow [2023-11-29 04:52:50,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=410, PETRI_PLACES=86, PETRI_TRANSITIONS=73} [2023-11-29 04:52:50,900 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 28 predicate places. [2023-11-29 04:52:50,900 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 73 transitions, 410 flow [2023-11-29 04:52:50,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 7 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:50,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:52:50,901 INFO L208 CegarLoopForPetriNet]: 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] [2023-11-29 04:52:50,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 04:52:50,901 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 04:52:50,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:52:50,901 INFO L85 PathProgramCache]: Analyzing trace with hash -122007174, now seen corresponding path program 3 times [2023-11-29 04:52:50,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:52:50,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38095505] [2023-11-29 04:52:50,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:52:50,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:52:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:52:51,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:52:51,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:52:51,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38095505] [2023-11-29 04:52:51,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38095505] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:52:51,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:52:51,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:52:51,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213132239] [2023-11-29 04:52:51,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:52:51,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:52:51,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:52:51,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:52:51,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:52:51,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2023-11-29 04:52:51,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 73 transitions, 410 flow. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:51,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:52:51,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2023-11-29 04:52:51,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:52:56,411 INFO L124 PetriNetUnfolderBase]: 30316/44154 cut-off events. [2023-11-29 04:52:56,411 INFO L125 PetriNetUnfolderBase]: For 69150/72679 co-relation queries the response was YES. [2023-11-29 04:52:56,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141470 conditions, 44154 events. 30316/44154 cut-off events. For 69150/72679 co-relation queries the response was YES. Maximal size of possible extension queue 2475. Compared 324622 event pairs, 2735 based on Foata normal form. 611/43282 useless extension candidates. Maximal degree in co-relation 141440. Up to 16820 conditions per place. [2023-11-29 04:52:56,641 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 84 selfloop transitions, 18 changer transitions 12/137 dead transitions. [2023-11-29 04:52:56,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 137 transitions, 862 flow [2023-11-29 04:52:56,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:52:56,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 04:52:56,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 235 transitions. [2023-11-29 04:52:56,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6714285714285714 [2023-11-29 04:52:56,643 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 235 transitions. [2023-11-29 04:52:56,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 235 transitions. [2023-11-29 04:52:56,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:52:56,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 235 transitions. [2023-11-29 04:52:56,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 33.57142857142857) internal successors, (235), 7 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:56,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:56,646 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:56,646 INFO L175 Difference]: Start difference. First operand has 86 places, 73 transitions, 410 flow. Second operand 7 states and 235 transitions. [2023-11-29 04:52:56,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 137 transitions, 862 flow [2023-11-29 04:52:58,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 137 transitions, 831 flow, removed 8 selfloop flow, removed 5 redundant places. [2023-11-29 04:52:58,127 INFO L231 Difference]: Finished difference. Result has 87 places, 71 transitions, 426 flow [2023-11-29 04:52:58,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=426, PETRI_PLACES=87, PETRI_TRANSITIONS=71} [2023-11-29 04:52:58,128 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 29 predicate places. [2023-11-29 04:52:58,128 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 71 transitions, 426 flow [2023-11-29 04:52:58,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:58,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:52:58,129 INFO L208 CegarLoopForPetriNet]: 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] [2023-11-29 04:52:58,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 04:52:58,129 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 04:52:58,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:52:58,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1009405450, now seen corresponding path program 1 times [2023-11-29 04:52:58,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:52:58,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896405977] [2023-11-29 04:52:58,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:52:58,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:52:58,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:52:58,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:52:58,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:52:58,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896405977] [2023-11-29 04:52:58,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896405977] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:52:58,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:52:58,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:52:58,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071909010] [2023-11-29 04:52:58,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:52:58,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:52:58,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:52:58,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:52:58,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:52:58,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2023-11-29 04:52:58,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 71 transitions, 426 flow. Second operand has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:52:58,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:52:58,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2023-11-29 04:52:58,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:53:02,897 INFO L124 PetriNetUnfolderBase]: 20545/35800 cut-off events. [2023-11-29 04:53:02,897 INFO L125 PetriNetUnfolderBase]: For 73308/82936 co-relation queries the response was YES. [2023-11-29 04:53:03,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111690 conditions, 35800 events. 20545/35800 cut-off events. For 73308/82936 co-relation queries the response was YES. Maximal size of possible extension queue 2654. Compared 344811 event pairs, 5118 based on Foata normal form. 552/32139 useless extension candidates. Maximal degree in co-relation 111661. Up to 11567 conditions per place. [2023-11-29 04:53:03,084 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 57 selfloop transitions, 3 changer transitions 15/113 dead transitions. [2023-11-29 04:53:03,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 113 transitions, 735 flow [2023-11-29 04:53:03,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:53:03,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:53:03,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions. [2023-11-29 04:53:03,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5966666666666667 [2023-11-29 04:53:03,085 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 179 transitions. [2023-11-29 04:53:03,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 179 transitions. [2023-11-29 04:53:03,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:53:03,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 179 transitions. [2023-11-29 04:53:03,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:03,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:03,087 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:03,087 INFO L175 Difference]: Start difference. First operand has 87 places, 71 transitions, 426 flow. Second operand 6 states and 179 transitions. [2023-11-29 04:53:03,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 113 transitions, 735 flow [2023-11-29 04:53:04,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 113 transitions, 660 flow, removed 26 selfloop flow, removed 7 redundant places. [2023-11-29 04:53:04,616 INFO L231 Difference]: Finished difference. Result has 88 places, 72 transitions, 381 flow [2023-11-29 04:53:04,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=381, PETRI_PLACES=88, PETRI_TRANSITIONS=72} [2023-11-29 04:53:04,617 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 30 predicate places. [2023-11-29 04:53:04,617 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 72 transitions, 381 flow [2023-11-29 04:53:04,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:04,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:53:04,617 INFO L208 CegarLoopForPetriNet]: 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] [2023-11-29 04:53:04,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 04:53:04,618 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 04:53:04,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:53:04,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1301888228, now seen corresponding path program 2 times [2023-11-29 04:53:04,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:53:04,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671066586] [2023-11-29 04:53:04,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:53:04,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:53:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:04,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:53:04,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:53:04,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671066586] [2023-11-29 04:53:04,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671066586] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:53:04,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:53:04,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:53:04,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213802048] [2023-11-29 04:53:04,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:53:04,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:53:04,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:53:04,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:53:04,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:53:05,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2023-11-29 04:53:05,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 72 transitions, 381 flow. Second operand has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:05,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:53:05,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2023-11-29 04:53:05,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:53:14,280 INFO L124 PetriNetUnfolderBase]: 51133/82330 cut-off events. [2023-11-29 04:53:14,280 INFO L125 PetriNetUnfolderBase]: For 113275/123869 co-relation queries the response was YES. [2023-11-29 04:53:14,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238908 conditions, 82330 events. 51133/82330 cut-off events. For 113275/123869 co-relation queries the response was YES. Maximal size of possible extension queue 5945. Compared 790847 event pairs, 8251 based on Foata normal form. 1427/75527 useless extension candidates. Maximal degree in co-relation 238879. Up to 35634 conditions per place. [2023-11-29 04:53:14,719 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 49 selfloop transitions, 4 changer transitions 61/143 dead transitions. [2023-11-29 04:53:14,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 143 transitions, 883 flow [2023-11-29 04:53:14,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:53:14,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 04:53:14,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 222 transitions. [2023-11-29 04:53:14,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.555 [2023-11-29 04:53:14,721 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 222 transitions. [2023-11-29 04:53:14,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 222 transitions. [2023-11-29 04:53:14,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:53:14,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 222 transitions. [2023-11-29 04:53:14,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 27.75) internal successors, (222), 8 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:14,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 50.0) internal successors, (450), 9 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:14,723 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 50.0) internal successors, (450), 9 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:14,723 INFO L175 Difference]: Start difference. First operand has 88 places, 72 transitions, 381 flow. Second operand 8 states and 222 transitions. [2023-11-29 04:53:14,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 143 transitions, 883 flow [2023-11-29 04:53:23,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 143 transitions, 876 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-29 04:53:23,789 INFO L231 Difference]: Finished difference. Result has 94 places, 65 transitions, 347 flow [2023-11-29 04:53:23,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=347, PETRI_PLACES=94, PETRI_TRANSITIONS=65} [2023-11-29 04:53:23,790 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 36 predicate places. [2023-11-29 04:53:23,790 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 65 transitions, 347 flow [2023-11-29 04:53:23,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:23,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:53:23,791 INFO L208 CegarLoopForPetriNet]: 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] [2023-11-29 04:53:23,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 04:53:23,791 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 04:53:23,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:53:23,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1287087710, now seen corresponding path program 3 times [2023-11-29 04:53:23,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:53:23,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661960891] [2023-11-29 04:53:23,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:53:23,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:53:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:24,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:53:24,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:53:24,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661960891] [2023-11-29 04:53:24,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661960891] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:53:24,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:53:24,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 04:53:24,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111647389] [2023-11-29 04:53:24,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:53:24,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:53:24,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:53:24,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:53:24,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:53:24,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2023-11-29 04:53:24,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 65 transitions, 347 flow. Second operand has 10 states, 10 states have (on average 24.0) internal successors, (240), 10 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:24,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:53:24,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2023-11-29 04:53:24,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:53:27,136 INFO L124 PetriNetUnfolderBase]: 11442/20523 cut-off events. [2023-11-29 04:53:27,136 INFO L125 PetriNetUnfolderBase]: For 25499/29048 co-relation queries the response was YES. [2023-11-29 04:53:27,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57927 conditions, 20523 events. 11442/20523 cut-off events. For 25499/29048 co-relation queries the response was YES. Maximal size of possible extension queue 1718. Compared 190909 event pairs, 2303 based on Foata normal form. 322/18681 useless extension candidates. Maximal degree in co-relation 57895. Up to 4029 conditions per place. [2023-11-29 04:53:27,265 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 78 selfloop transitions, 10 changer transitions 17/143 dead transitions. [2023-11-29 04:53:27,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 143 transitions, 831 flow [2023-11-29 04:53:27,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:53:27,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 04:53:27,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 323 transitions. [2023-11-29 04:53:27,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.646 [2023-11-29 04:53:27,268 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 323 transitions. [2023-11-29 04:53:27,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 323 transitions. [2023-11-29 04:53:27,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:53:27,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 323 transitions. [2023-11-29 04:53:27,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 32.3) internal successors, (323), 10 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:27,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 50.0) internal successors, (550), 11 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:27,271 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 50.0) internal successors, (550), 11 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:27,271 INFO L175 Difference]: Start difference. First operand has 94 places, 65 transitions, 347 flow. Second operand 10 states and 323 transitions. [2023-11-29 04:53:27,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 143 transitions, 831 flow [2023-11-29 04:53:27,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 143 transitions, 804 flow, removed 12 selfloop flow, removed 6 redundant places. [2023-11-29 04:53:27,929 INFO L231 Difference]: Finished difference. Result has 96 places, 70 transitions, 392 flow [2023-11-29 04:53:27,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=392, PETRI_PLACES=96, PETRI_TRANSITIONS=70} [2023-11-29 04:53:27,930 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 38 predicate places. [2023-11-29 04:53:27,930 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 70 transitions, 392 flow [2023-11-29 04:53:27,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 24.0) internal successors, (240), 10 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:27,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:53:27,931 INFO L208 CegarLoopForPetriNet]: 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] [2023-11-29 04:53:27,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 04:53:27,931 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 04:53:27,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:53:27,931 INFO L85 PathProgramCache]: Analyzing trace with hash -834698662, now seen corresponding path program 4 times [2023-11-29 04:53:27,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:53:27,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684120357] [2023-11-29 04:53:27,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:53:27,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:53:27,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:53:27,994 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:53:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:53:28,084 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:53:28,084 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 04:53:28,085 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-29 04:53:28,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-29 04:53:28,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-29 04:53:28,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-29 04:53:28,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-29 04:53:28,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-29 04:53:28,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-29 04:53:28,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 04:53:28,088 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:53:28,094 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 04:53:28,095 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:53:28,153 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 04:53:28,155 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 04:53:28,156 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 04:53:28,157 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 04:53:28,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 04:53:28 BasicIcfg [2023-11-29 04:53:28,186 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 04:53:28,186 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:53:28,186 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:53:28,187 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:53:28,187 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:52:23" (3/4) ... [2023-11-29 04:53:28,188 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-29 04:53:28,218 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 04:53:28,219 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 04:53:28,219 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 04:53:28,220 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 04:53:28,296 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a454acab-97e4-4819-a707-ffbbb31e8be6/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 04:53:28,296 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:53:28,297 INFO L158 Benchmark]: Toolchain (without parser) took 66137.09ms. Allocated memory was 153.1MB in the beginning and 8.7GB in the end (delta: 8.6GB). Free memory was 111.5MB in the beginning and 5.7GB in the end (delta: -5.6GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. [2023-11-29 04:53:28,297 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 153.1MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:53:28,297 INFO L158 Benchmark]: CACSL2BoogieTranslator took 490.65ms. Allocated memory is still 153.1MB. Free memory was 111.5MB in the beginning and 86.8MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-29 04:53:28,298 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.49ms. Allocated memory is still 153.1MB. Free memory was 86.8MB in the beginning and 84.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:53:28,298 INFO L158 Benchmark]: Boogie Preprocessor took 58.99ms. Allocated memory is still 153.1MB. Free memory was 84.2MB in the beginning and 80.6MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 04:53:28,299 INFO L158 Benchmark]: RCFGBuilder took 750.32ms. Allocated memory was 153.1MB in the beginning and 199.2MB in the end (delta: 46.1MB). Free memory was 80.6MB in the beginning and 140.9MB in the end (delta: -60.4MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. [2023-11-29 04:53:28,299 INFO L158 Benchmark]: TraceAbstraction took 64667.92ms. Allocated memory was 199.2MB in the beginning and 8.7GB in the end (delta: 8.5GB). Free memory was 140.9MB in the beginning and 5.7GB in the end (delta: -5.6GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. [2023-11-29 04:53:28,299 INFO L158 Benchmark]: Witness Printer took 109.73ms. Allocated memory is still 8.7GB. Free memory was 5.7GB in the beginning and 5.7GB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 04:53:28,301 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 153.1MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 490.65ms. Allocated memory is still 153.1MB. Free memory was 111.5MB in the beginning and 86.8MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.49ms. Allocated memory is still 153.1MB. Free memory was 86.8MB in the beginning and 84.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.99ms. Allocated memory is still 153.1MB. Free memory was 84.2MB in the beginning and 80.6MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 750.32ms. Allocated memory was 153.1MB in the beginning and 199.2MB in the end (delta: 46.1MB). Free memory was 80.6MB in the beginning and 140.9MB in the end (delta: -60.4MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. * TraceAbstraction took 64667.92ms. Allocated memory was 199.2MB in the beginning and 8.7GB in the end (delta: 8.5GB). Free memory was 140.9MB in the beginning and 5.7GB in the end (delta: -5.6GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. * Witness Printer took 109.73ms. Allocated memory is still 8.7GB. Free memory was 5.7GB in the beginning and 5.7GB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int __unbuffered_p2_EAX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool a$flush_delayed; [L726] 0 int a$mem_tmp; [L727] 0 _Bool a$r_buff0_thd0; [L728] 0 _Bool a$r_buff0_thd1; [L729] 0 _Bool a$r_buff0_thd2; [L730] 0 _Bool a$r_buff0_thd3; [L731] 0 _Bool a$r_buff0_thd4; [L732] 0 _Bool a$r_buff1_thd0; [L733] 0 _Bool a$r_buff1_thd1; [L734] 0 _Bool a$r_buff1_thd2; [L735] 0 _Bool a$r_buff1_thd3; [L736] 0 _Bool a$r_buff1_thd4; [L737] 0 _Bool a$read_delayed; [L738] 0 int *a$read_delayed_var; [L739] 0 int a$w_buff0; [L740] 0 _Bool a$w_buff0_used; [L741] 0 int a$w_buff1; [L742] 0 _Bool a$w_buff1_used; [L743] 0 _Bool main$tmp_guard0; [L744] 0 _Bool main$tmp_guard1; [L746] 0 int x = 0; [L748] 0 int y = 0; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L873] 0 pthread_t t321; [L874] FCALL, FORK 0 pthread_create(&t321, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t321={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t322; [L876] FCALL, FORK 0 pthread_create(&t322, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t321={6:0}, t322={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t323; [L878] FCALL, FORK 0 pthread_create(&t323, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t321={6:0}, t322={7:0}, t323={8:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L879] 0 pthread_t t324; [L880] FCALL, FORK 0 pthread_create(&t324, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t321={6:0}, t322={7:0}, t323={8:0}, t324={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L756] 1 a$w_buff1 = a$w_buff0 [L757] 1 a$w_buff0 = 1 [L758] 1 a$w_buff1_used = a$w_buff0_used [L759] 1 a$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L761] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L762] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L763] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L764] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L765] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L766] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L769] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L786] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L789] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L792] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L795] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L796] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L797] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L798] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L799] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L809] 3 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L812] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L829] 4 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L832] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L835] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 4 a$flush_delayed = weak$$choice2 [L838] 4 a$mem_tmp = a [L839] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L840] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L841] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L842] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L843] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L845] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L846] 4 __unbuffered_p3_EBX = a [L847] 4 a = a$flush_delayed ? a$mem_tmp : a [L848] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L815] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L816] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L817] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L818] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L819] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L772] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L773] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L774] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L775] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L776] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L851] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L852] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L853] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L854] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L855] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L858] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L882] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t321={6:0}, t322={7:0}, t323={8:0}, t324={5:0}, weak$$choice2=1, x=1, y=1, z=1] [L884] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L884] RET 0 assume_abort_if_not(main$tmp_guard0) [L886] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L887] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L888] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L889] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L890] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t321={6:0}, t322={7:0}, t323={8:0}, t324={5:0}, weak$$choice2=1, x=1, y=1, z=1] [L893] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t321={6:0}, t322={7:0}, t323={8:0}, t324={5:0}, weak$$choice2=1, x=1, y=1, z=1] [L895] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] - UnprovableResult [Line: 18]: 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. - UnprovableResult [Line: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 880]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 85 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 64.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 59.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 967 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 919 mSDsluCounter, 322 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 257 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2657 IncrementalHoareTripleChecker+Invalid, 2726 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 65 mSDtfsCounter, 2657 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=426occurred in iteration=10, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 384 NumberOfCodeBlocks, 384 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 333 ConstructedInterpolants, 0 QuantifiedInterpolants, 2254 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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! [2023-11-29 04:53:28,322 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a454acab-97e4-4819-a707-ffbbb31e8be6/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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