./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b06ddb26-6abe-44ac-b93d-187517fa3e92/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b06ddb26-6abe-44ac-b93d-187517fa3e92/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_b06ddb26-6abe-44ac-b93d-187517fa3e92/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b06ddb26-6abe-44ac-b93d-187517fa3e92/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b06ddb26-6abe-44ac-b93d-187517fa3e92/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_b06ddb26-6abe-44ac-b93d-187517fa3e92/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 2b11be791089901ed5596869d293da40c27b85c1e89c21a55cf2181db7595687 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:35:40,337 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:35:40,402 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b06ddb26-6abe-44ac-b93d-187517fa3e92/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 05:35:40,408 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:35:40,408 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:35:40,433 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:35:40,433 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:35:40,434 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:35:40,435 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:35:40,435 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:35:40,436 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:35:40,436 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:35:40,437 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:35:40,437 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:35:40,438 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:35:40,439 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:35:40,439 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:35:40,440 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:35:40,440 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:35:40,441 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:35:40,441 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:35:40,442 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:35:40,442 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:35:40,443 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:35:40,443 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:35:40,444 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:35:40,444 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:35:40,445 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:35:40,445 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:35:40,445 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:35:40,446 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:35:40,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:35:40,446 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:35:40,447 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:35:40,447 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:35:40,447 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:35:40,447 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:35:40,447 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:35:40,447 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:35:40,448 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:35:40,448 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:35:40,448 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:35:40,448 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_b06ddb26-6abe-44ac-b93d-187517fa3e92/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_b06ddb26-6abe-44ac-b93d-187517fa3e92/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 -> 2b11be791089901ed5596869d293da40c27b85c1e89c21a55cf2181db7595687 [2023-11-29 05:35:40,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:35:40,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:35:40,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:35:40,707 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:35:40,708 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:35:40,709 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b06ddb26-6abe-44ac-b93d-187517fa3e92/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-29 05:35:43,414 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:35:43,680 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:35:43,680 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b06ddb26-6abe-44ac-b93d-187517fa3e92/sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-29 05:35:43,697 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b06ddb26-6abe-44ac-b93d-187517fa3e92/bin/uautomizer-verify-BQ2R08f2Ya/data/6d25f65aa/3196b499449145dfad3ee1ac72867ee7/FLAG6192d299f [2023-11-29 05:35:43,711 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b06ddb26-6abe-44ac-b93d-187517fa3e92/bin/uautomizer-verify-BQ2R08f2Ya/data/6d25f65aa/3196b499449145dfad3ee1ac72867ee7 [2023-11-29 05:35:43,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:35:43,714 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:35:43,715 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:35:43,715 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:35:43,720 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:35:43,721 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:35:43" (1/1) ... [2023-11-29 05:35:43,722 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f1ab779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:35:43, skipping insertion in model container [2023-11-29 05:35:43,722 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:35:43" (1/1) ... [2023-11-29 05:35:43,772 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:35:43,916 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_b06ddb26-6abe-44ac-b93d-187517fa3e92/sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-11-29 05:35:44,112 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:35:44,123 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:35:44,135 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_b06ddb26-6abe-44ac-b93d-187517fa3e92/sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-11-29 05:35:44,180 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:35:44,212 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:35:44,212 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:35:44,219 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:35:44,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:35:44 WrapperNode [2023-11-29 05:35:44,219 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:35:44,220 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:35:44,221 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:35:44,221 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:35:44,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:35:44" (1/1) ... [2023-11-29 05:35:44,243 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:35:44" (1/1) ... [2023-11-29 05:35:44,272 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-11-29 05:35:44,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:35:44,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:35:44,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:35:44,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:35:44,285 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:35:44" (1/1) ... [2023-11-29 05:35:44,285 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:35:44" (1/1) ... [2023-11-29 05:35:44,290 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:35:44" (1/1) ... [2023-11-29 05:35:44,311 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-29 05:35:44,311 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:35:44" (1/1) ... [2023-11-29 05:35:44,311 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:35:44" (1/1) ... [2023-11-29 05:35:44,324 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:35:44" (1/1) ... [2023-11-29 05:35:44,326 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:35:44" (1/1) ... [2023-11-29 05:35:44,329 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:35:44" (1/1) ... [2023-11-29 05:35:44,332 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:35:44" (1/1) ... [2023-11-29 05:35:44,337 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:35:44,338 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:35:44,338 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:35:44,339 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:35:44,340 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:35:44" (1/1) ... [2023-11-29 05:35:44,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:35:44,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b06ddb26-6abe-44ac-b93d-187517fa3e92/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:35:44,370 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b06ddb26-6abe-44ac-b93d-187517fa3e92/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:35:44,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b06ddb26-6abe-44ac-b93d-187517fa3e92/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:35:44,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 05:35:44,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 05:35:44,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 05:35:44,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 05:35:44,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 05:35:44,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:35:44,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:35:44,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:35:44,406 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 05:35:44,406 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 05:35:44,407 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 05:35:44,407 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 05:35:44,407 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 05:35:44,407 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 05:35:44,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:35:44,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 05:35:44,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 05:35:44,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 05:35:44,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 05:35:44,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:35:44,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:35:44,410 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 05:35:44,557 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:35:44,559 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:35:44,942 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:35:45,149 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:35:45,149 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 05:35:45,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:35:45 BoogieIcfgContainer [2023-11-29 05:35:45,150 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:35:45,152 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:35:45,152 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:35:45,155 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:35:45,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:35:43" (1/3) ... [2023-11-29 05:35:45,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5675280b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:35:45, skipping insertion in model container [2023-11-29 05:35:45,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:35:44" (2/3) ... [2023-11-29 05:35:45,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5675280b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:35:45, skipping insertion in model container [2023-11-29 05:35:45,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:35:45" (3/3) ... [2023-11-29 05:35:45,158 INFO L112 eAbstractionObserver]: Analyzing ICFG safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-29 05:35:45,166 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 05:35:45,174 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:35:45,174 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-29 05:35:45,175 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 05:35:45,225 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 05:35:45,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 40 transitions, 92 flow [2023-11-29 05:35:45,291 INFO L124 PetriNetUnfolderBase]: 1/37 cut-off events. [2023-11-29 05:35:45,291 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:35:45,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 1/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2023-11-29 05:35:45,295 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 40 transitions, 92 flow [2023-11-29 05:35:45,298 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 37 transitions, 83 flow [2023-11-29 05:35:45,309 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:35:45,316 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;@641437d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:35:45,317 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-29 05:35:45,323 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 05:35:45,323 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2023-11-29 05:35:45,323 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:35:45,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:35:45,324 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 05:35:45,324 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 05:35:45,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:35:45,330 INFO L85 PathProgramCache]: Analyzing trace with hash 70596679, now seen corresponding path program 1 times [2023-11-29 05:35:45,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:35:45,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882486260] [2023-11-29 05:35:45,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:45,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:35:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:45,731 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 05:35:45,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:35:45,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882486260] [2023-11-29 05:35:45,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882486260] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:35:45,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:35:45,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:35:45,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589853668] [2023-11-29 05:35:45,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:35:45,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:35:45,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:35:45,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:35:45,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:35:45,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2023-11-29 05:35:45,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 05:35:45,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:35:45,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2023-11-29 05:35:45,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:35:46,281 INFO L124 PetriNetUnfolderBase]: 1279/2291 cut-off events. [2023-11-29 05:35:46,282 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-11-29 05:35:46,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4238 conditions, 2291 events. 1279/2291 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 14748 event pairs, 214 based on Foata normal form. 80/2338 useless extension candidates. Maximal degree in co-relation 4227. Up to 1516 conditions per place. [2023-11-29 05:35:46,302 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 33 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2023-11-29 05:35:46,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 50 transitions, 186 flow [2023-11-29 05:35:46,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:35:46,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:35:46,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2023-11-29 05:35:46,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2023-11-29 05:35:46,313 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 88 transitions. [2023-11-29 05:35:46,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 88 transitions. [2023-11-29 05:35:46,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:35:46,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 88 transitions. [2023-11-29 05:35:46,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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 05:35:46,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 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 05:35:46,322 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 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 05:35:46,324 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 83 flow. Second operand 3 states and 88 transitions. [2023-11-29 05:35:46,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 50 transitions, 186 flow [2023-11-29 05:35:46,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 50 transitions, 182 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 05:35:46,330 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 78 flow [2023-11-29 05:35:46,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2023-11-29 05:35:46,336 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2023-11-29 05:35:46,336 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 78 flow [2023-11-29 05:35:46,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 05:35:46,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:35:46,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:35:46,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:35:46,337 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 05:35:46,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:35:46,338 INFO L85 PathProgramCache]: Analyzing trace with hash 23605203, now seen corresponding path program 1 times [2023-11-29 05:35:46,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:35:46,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072033561] [2023-11-29 05:35:46,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:46,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:35:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:46,596 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 05:35:46,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:35:46,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072033561] [2023-11-29 05:35:46,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072033561] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:35:46,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:35:46,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:35:46,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349771744] [2023-11-29 05:35:46,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:35:46,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:35:46,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:35:46,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:35:46,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:35:46,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 40 [2023-11-29 05:35:46,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 05:35:46,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:35:46,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 40 [2023-11-29 05:35:46,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:35:47,207 INFO L124 PetriNetUnfolderBase]: 2225/3684 cut-off events. [2023-11-29 05:35:47,207 INFO L125 PetriNetUnfolderBase]: For 192/192 co-relation queries the response was YES. [2023-11-29 05:35:47,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7272 conditions, 3684 events. 2225/3684 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 22652 event pairs, 330 based on Foata normal form. 150/3699 useless extension candidates. Maximal degree in co-relation 7262. Up to 1856 conditions per place. [2023-11-29 05:35:47,225 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 48 selfloop transitions, 5 changer transitions 1/63 dead transitions. [2023-11-29 05:35:47,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 63 transitions, 252 flow [2023-11-29 05:35:47,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:35:47,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 05:35:47,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2023-11-29 05:35:47,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.65 [2023-11-29 05:35:47,228 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 104 transitions. [2023-11-29 05:35:47,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 104 transitions. [2023-11-29 05:35:47,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:35:47,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 104 transitions. [2023-11-29 05:35:47,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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 05:35:47,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 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 05:35:47,231 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 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 05:35:47,232 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 78 flow. Second operand 4 states and 104 transitions. [2023-11-29 05:35:47,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 63 transitions, 252 flow [2023-11-29 05:35:47,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 63 transitions, 244 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:35:47,235 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 108 flow [2023-11-29 05:35:47,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2023-11-29 05:35:47,236 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 0 predicate places. [2023-11-29 05:35:47,236 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 108 flow [2023-11-29 05:35:47,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 05:35:47,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:35:47,237 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 05:35:47,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:35:47,237 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 05:35:47,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:35:47,238 INFO L85 PathProgramCache]: Analyzing trace with hash -555717826, now seen corresponding path program 1 times [2023-11-29 05:35:47,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:35:47,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859288547] [2023-11-29 05:35:47,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:47,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:35:47,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:47,452 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 05:35:47,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:35:47,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859288547] [2023-11-29 05:35:47,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859288547] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:35:47,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:35:47,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:35:47,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297209292] [2023-11-29 05:35:47,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:35:47,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:35:47,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:35:47,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:35:47,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:35:47,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 40 [2023-11-29 05:35:47,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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 05:35:47,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:35:47,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 40 [2023-11-29 05:35:47,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:35:47,940 INFO L124 PetriNetUnfolderBase]: 1358/2253 cut-off events. [2023-11-29 05:35:47,940 INFO L125 PetriNetUnfolderBase]: For 493/493 co-relation queries the response was YES. [2023-11-29 05:35:47,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5130 conditions, 2253 events. 1358/2253 cut-off events. For 493/493 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 12068 event pairs, 200 based on Foata normal form. 114/2298 useless extension candidates. Maximal degree in co-relation 5118. Up to 701 conditions per place. [2023-11-29 05:35:47,957 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 61 selfloop transitions, 8 changer transitions 1/79 dead transitions. [2023-11-29 05:35:47,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 79 transitions, 353 flow [2023-11-29 05:35:47,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:35:47,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:35:47,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2023-11-29 05:35:47,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.66 [2023-11-29 05:35:47,960 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 132 transitions. [2023-11-29 05:35:47,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 132 transitions. [2023-11-29 05:35:47,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:35:47,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 132 transitions. [2023-11-29 05:35:47,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 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 05:35:47,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 40.0) internal successors, (240), 6 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 05:35:47,963 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 40.0) internal successors, (240), 6 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 05:35:47,963 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 108 flow. Second operand 5 states and 132 transitions. [2023-11-29 05:35:47,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 79 transitions, 353 flow [2023-11-29 05:35:47,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 79 transitions, 343 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 05:35:47,967 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 148 flow [2023-11-29 05:35:47,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=148, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2023-11-29 05:35:47,968 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 4 predicate places. [2023-11-29 05:35:47,968 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 148 flow [2023-11-29 05:35:47,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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 05:35:47,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:35:47,969 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] [2023-11-29 05:35:47,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:35:47,969 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 05:35:47,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:35:47,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1364701910, now seen corresponding path program 1 times [2023-11-29 05:35:47,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:35:47,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148587314] [2023-11-29 05:35:47,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:47,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:35:48,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:48,292 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 05:35:48,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:35:48,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148587314] [2023-11-29 05:35:48,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148587314] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:35:48,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:35:48,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:35:48,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040641734] [2023-11-29 05:35:48,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:35:48,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:35:48,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:35:48,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:35:48,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:35:48,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 40 [2023-11-29 05:35:48,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 148 flow. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 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 05:35:48,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:35:48,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 40 [2023-11-29 05:35:48,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:35:48,666 INFO L124 PetriNetUnfolderBase]: 833/1342 cut-off events. [2023-11-29 05:35:48,666 INFO L125 PetriNetUnfolderBase]: For 932/932 co-relation queries the response was YES. [2023-11-29 05:35:48,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3420 conditions, 1342 events. 833/1342 cut-off events. For 932/932 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6217 event pairs, 175 based on Foata normal form. 48/1361 useless extension candidates. Maximal degree in co-relation 3406. Up to 466 conditions per place. [2023-11-29 05:35:48,676 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 52 selfloop transitions, 11 changer transitions 1/73 dead transitions. [2023-11-29 05:35:48,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 73 transitions, 352 flow [2023-11-29 05:35:48,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:35:48,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:35:48,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2023-11-29 05:35:48,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.575 [2023-11-29 05:35:48,679 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 138 transitions. [2023-11-29 05:35:48,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 138 transitions. [2023-11-29 05:35:48,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:35:48,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 138 transitions. [2023-11-29 05:35:48,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 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 05:35:48,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 40.0) internal successors, (280), 7 states have internal predecessors, (280), 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 05:35:48,682 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 40.0) internal successors, (280), 7 states have internal predecessors, (280), 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 05:35:48,682 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 148 flow. Second operand 6 states and 138 transitions. [2023-11-29 05:35:48,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 73 transitions, 352 flow [2023-11-29 05:35:48,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 73 transitions, 327 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-29 05:35:48,691 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 162 flow [2023-11-29 05:35:48,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=162, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2023-11-29 05:35:48,692 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2023-11-29 05:35:48,692 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 162 flow [2023-11-29 05:35:48,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 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 05:35:48,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:35:48,693 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] [2023-11-29 05:35:48,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 05:35:48,693 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 05:35:48,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:35:48,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1632938543, now seen corresponding path program 1 times [2023-11-29 05:35:48,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:35:48,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913349872] [2023-11-29 05:35:48,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:48,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:35:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:50,010 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 05:35:50,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:35:50,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913349872] [2023-11-29 05:35:50,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913349872] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:35:50,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:35:50,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:35:50,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800589438] [2023-11-29 05:35:50,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:35:50,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:35:50,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:35:50,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:35:50,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:35:50,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2023-11-29 05:35:50,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 162 flow. Second operand has 9 states, 9 states have (on average 16.22222222222222) internal successors, (146), 9 states have internal predecessors, (146), 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 05:35:50,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:35:50,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2023-11-29 05:35:50,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:35:50,765 INFO L124 PetriNetUnfolderBase]: 1237/2266 cut-off events. [2023-11-29 05:35:50,766 INFO L125 PetriNetUnfolderBase]: For 1206/1230 co-relation queries the response was YES. [2023-11-29 05:35:50,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5416 conditions, 2266 events. 1237/2266 cut-off events. For 1206/1230 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 13775 event pairs, 300 based on Foata normal form. 8/2189 useless extension candidates. Maximal degree in co-relation 5401. Up to 777 conditions per place. [2023-11-29 05:35:50,779 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 38 selfloop transitions, 10 changer transitions 30/95 dead transitions. [2023-11-29 05:35:50,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 95 transitions, 456 flow [2023-11-29 05:35:50,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:35:50,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 05:35:50,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 205 transitions. [2023-11-29 05:35:50,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5694444444444444 [2023-11-29 05:35:50,781 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 205 transitions. [2023-11-29 05:35:50,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 205 transitions. [2023-11-29 05:35:50,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:35:50,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 205 transitions. [2023-11-29 05:35:50,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 22.77777777777778) internal successors, (205), 9 states have internal predecessors, (205), 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 05:35:50,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 40.0) internal successors, (400), 10 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 05:35:50,785 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 40.0) internal successors, (400), 10 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 05:35:50,785 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 162 flow. Second operand 9 states and 205 transitions. [2023-11-29 05:35:50,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 95 transitions, 456 flow [2023-11-29 05:35:50,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 95 transitions, 376 flow, removed 22 selfloop flow, removed 8 redundant places. [2023-11-29 05:35:50,799 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 176 flow [2023-11-29 05:35:50,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=176, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2023-11-29 05:35:50,800 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 13 predicate places. [2023-11-29 05:35:50,801 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 176 flow [2023-11-29 05:35:50,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.22222222222222) internal successors, (146), 9 states have internal predecessors, (146), 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 05:35:50,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:35:50,801 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] [2023-11-29 05:35:50,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 05:35:50,802 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 05:35:50,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:35:50,802 INFO L85 PathProgramCache]: Analyzing trace with hash 181614513, now seen corresponding path program 2 times [2023-11-29 05:35:50,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:35:50,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113845416] [2023-11-29 05:35:50,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:50,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:35:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:52,292 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 05:35:52,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:35:52,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113845416] [2023-11-29 05:35:52,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113845416] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:35:52,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:35:52,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 05:35:52,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960300715] [2023-11-29 05:35:52,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:35:52,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 05:35:52,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:35:52,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 05:35:52,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:35:52,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2023-11-29 05:35:52,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 176 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 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 05:35:52,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:35:52,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2023-11-29 05:35:52,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:35:53,306 INFO L124 PetriNetUnfolderBase]: 1374/2517 cut-off events. [2023-11-29 05:35:53,307 INFO L125 PetriNetUnfolderBase]: For 862/866 co-relation queries the response was YES. [2023-11-29 05:35:53,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6123 conditions, 2517 events. 1374/2517 cut-off events. For 862/866 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 15552 event pairs, 201 based on Foata normal form. 8/2468 useless extension candidates. Maximal degree in co-relation 6106. Up to 1077 conditions per place. [2023-11-29 05:35:53,330 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 72 selfloop transitions, 13 changer transitions 40/142 dead transitions. [2023-11-29 05:35:53,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 142 transitions, 713 flow [2023-11-29 05:35:53,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 05:35:53,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-29 05:35:53,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 310 transitions. [2023-11-29 05:35:53,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5535714285714286 [2023-11-29 05:35:53,332 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 310 transitions. [2023-11-29 05:35:53,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 310 transitions. [2023-11-29 05:35:53,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:35:53,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 310 transitions. [2023-11-29 05:35:53,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 22.142857142857142) internal successors, (310), 14 states have internal predecessors, (310), 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 05:35:53,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 40.0) internal successors, (600), 15 states have internal predecessors, (600), 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 05:35:53,336 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 40.0) internal successors, (600), 15 states have internal predecessors, (600), 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 05:35:53,336 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 176 flow. Second operand 14 states and 310 transitions. [2023-11-29 05:35:53,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 142 transitions, 713 flow [2023-11-29 05:35:53,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 142 transitions, 694 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-29 05:35:53,342 INFO L231 Difference]: Finished difference. Result has 70 places, 58 transitions, 268 flow [2023-11-29 05:35:53,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=268, PETRI_PLACES=70, PETRI_TRANSITIONS=58} [2023-11-29 05:35:53,343 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 24 predicate places. [2023-11-29 05:35:53,343 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 58 transitions, 268 flow [2023-11-29 05:35:53,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 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 05:35:53,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:35:53,343 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] [2023-11-29 05:35:53,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 05:35:53,344 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 05:35:53,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:35:53,344 INFO L85 PathProgramCache]: Analyzing trace with hash 260852547, now seen corresponding path program 3 times [2023-11-29 05:35:53,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:35:53,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002566870] [2023-11-29 05:35:53,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:53,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:35:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:54,741 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 05:35:54,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:35:54,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002566870] [2023-11-29 05:35:54,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002566870] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:35:54,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:35:54,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:35:54,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586705827] [2023-11-29 05:35:54,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:35:54,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:35:54,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:35:54,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:35:54,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:35:54,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 40 [2023-11-29 05:35:54,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 58 transitions, 268 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 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 05:35:54,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:35:54,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 40 [2023-11-29 05:35:54,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:35:55,595 INFO L124 PetriNetUnfolderBase]: 2435/4171 cut-off events. [2023-11-29 05:35:55,595 INFO L125 PetriNetUnfolderBase]: For 3397/3397 co-relation queries the response was YES. [2023-11-29 05:35:55,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11516 conditions, 4171 events. 2435/4171 cut-off events. For 3397/3397 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 26483 event pairs, 342 based on Foata normal form. 8/4105 useless extension candidates. Maximal degree in co-relation 11495. Up to 2061 conditions per place. [2023-11-29 05:35:55,623 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 67 selfloop transitions, 6 changer transitions 30/118 dead transitions. [2023-11-29 05:35:55,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 118 transitions, 730 flow [2023-11-29 05:35:55,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:35:55,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:35:55,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 158 transitions. [2023-11-29 05:35:55,625 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5642857142857143 [2023-11-29 05:35:55,625 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 158 transitions. [2023-11-29 05:35:55,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 158 transitions. [2023-11-29 05:35:55,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:35:55,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 158 transitions. [2023-11-29 05:35:55,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 22.571428571428573) internal successors, (158), 7 states have internal predecessors, (158), 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 05:35:55,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 40.0) internal successors, (320), 8 states have internal predecessors, (320), 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 05:35:55,628 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 40.0) internal successors, (320), 8 states have internal predecessors, (320), 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 05:35:55,628 INFO L175 Difference]: Start difference. First operand has 70 places, 58 transitions, 268 flow. Second operand 7 states and 158 transitions. [2023-11-29 05:35:55,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 118 transitions, 730 flow [2023-11-29 05:35:55,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 118 transitions, 712 flow, removed 9 selfloop flow, removed 3 redundant places. [2023-11-29 05:35:55,637 INFO L231 Difference]: Finished difference. Result has 71 places, 57 transitions, 282 flow [2023-11-29 05:35:55,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=282, PETRI_PLACES=71, PETRI_TRANSITIONS=57} [2023-11-29 05:35:55,638 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 25 predicate places. [2023-11-29 05:35:55,638 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 57 transitions, 282 flow [2023-11-29 05:35:55,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 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 05:35:55,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:35:55,639 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] [2023-11-29 05:35:55,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 05:35:55,639 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 05:35:55,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:35:55,640 INFO L85 PathProgramCache]: Analyzing trace with hash -113961833, now seen corresponding path program 4 times [2023-11-29 05:35:55,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:35:55,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994702145] [2023-11-29 05:35:55,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:55,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:35:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:57,492 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 05:35:57,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:35:57,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994702145] [2023-11-29 05:35:57,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994702145] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:35:57,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:35:57,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 05:35:57,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998838782] [2023-11-29 05:35:57,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:35:57,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:35:57,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:35:57,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:35:57,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:35:57,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2023-11-29 05:35:57,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 57 transitions, 282 flow. Second operand has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 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 05:35:57,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:35:57,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2023-11-29 05:35:57,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:35:58,003 INFO L124 PetriNetUnfolderBase]: 982/1817 cut-off events. [2023-11-29 05:35:58,003 INFO L125 PetriNetUnfolderBase]: For 2090/2120 co-relation queries the response was YES. [2023-11-29 05:35:58,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5125 conditions, 1817 events. 982/1817 cut-off events. For 2090/2120 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 10252 event pairs, 201 based on Foata normal form. 24/1792 useless extension candidates. Maximal degree in co-relation 5101. Up to 998 conditions per place. [2023-11-29 05:35:58,013 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 37 selfloop transitions, 15 changer transitions 17/86 dead transitions. [2023-11-29 05:35:58,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 86 transitions, 523 flow [2023-11-29 05:35:58,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:35:58,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:35:58,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 153 transitions. [2023-11-29 05:35:58,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5464285714285714 [2023-11-29 05:35:58,015 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 153 transitions. [2023-11-29 05:35:58,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 153 transitions. [2023-11-29 05:35:58,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:35:58,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 153 transitions. [2023-11-29 05:35:58,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 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 05:35:58,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 40.0) internal successors, (320), 8 states have internal predecessors, (320), 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 05:35:58,017 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 40.0) internal successors, (320), 8 states have internal predecessors, (320), 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 05:35:58,017 INFO L175 Difference]: Start difference. First operand has 71 places, 57 transitions, 282 flow. Second operand 7 states and 153 transitions. [2023-11-29 05:35:58,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 86 transitions, 523 flow [2023-11-29 05:35:58,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 86 transitions, 478 flow, removed 14 selfloop flow, removed 8 redundant places. [2023-11-29 05:35:58,022 INFO L231 Difference]: Finished difference. Result has 71 places, 59 transitions, 332 flow [2023-11-29 05:35:58,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=332, PETRI_PLACES=71, PETRI_TRANSITIONS=59} [2023-11-29 05:35:58,023 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 25 predicate places. [2023-11-29 05:35:58,023 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 59 transitions, 332 flow [2023-11-29 05:35:58,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 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 05:35:58,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:35:58,024 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] [2023-11-29 05:35:58,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 05:35:58,024 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 05:35:58,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:35:58,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1501692655, now seen corresponding path program 5 times [2023-11-29 05:35:58,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:35:58,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128294534] [2023-11-29 05:35:58,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:58,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:35:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:58,776 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 05:35:58,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:35:58,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128294534] [2023-11-29 05:35:58,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128294534] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:35:58,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:35:58,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:35:58,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740148979] [2023-11-29 05:35:58,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:35:58,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:35:58,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:35:58,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:35:58,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:35:58,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2023-11-29 05:35:58,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 59 transitions, 332 flow. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 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 05:35:58,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:35:58,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2023-11-29 05:35:58,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:35:59,313 INFO L124 PetriNetUnfolderBase]: 1999/3466 cut-off events. [2023-11-29 05:35:59,313 INFO L125 PetriNetUnfolderBase]: For 6133/6185 co-relation queries the response was YES. [2023-11-29 05:35:59,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10555 conditions, 3466 events. 1999/3466 cut-off events. For 6133/6185 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 21764 event pairs, 490 based on Foata normal form. 57/3418 useless extension candidates. Maximal degree in co-relation 10532. Up to 1457 conditions per place. [2023-11-29 05:35:59,329 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 62 selfloop transitions, 3 changer transitions 28/111 dead transitions. [2023-11-29 05:35:59,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 111 transitions, 842 flow [2023-11-29 05:35:59,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:35:59,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:35:59,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2023-11-29 05:35:59,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5583333333333333 [2023-11-29 05:35:59,331 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 134 transitions. [2023-11-29 05:35:59,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 134 transitions. [2023-11-29 05:35:59,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:35:59,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 134 transitions. [2023-11-29 05:35:59,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 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 05:35:59,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 40.0) internal successors, (280), 7 states have internal predecessors, (280), 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 05:35:59,332 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 40.0) internal successors, (280), 7 states have internal predecessors, (280), 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 05:35:59,332 INFO L175 Difference]: Start difference. First operand has 71 places, 59 transitions, 332 flow. Second operand 6 states and 134 transitions. [2023-11-29 05:35:59,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 111 transitions, 842 flow [2023-11-29 05:35:59,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 111 transitions, 794 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-11-29 05:35:59,338 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 324 flow [2023-11-29 05:35:59,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=324, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2023-11-29 05:35:59,339 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 24 predicate places. [2023-11-29 05:35:59,339 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 324 flow [2023-11-29 05:35:59,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 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 05:35:59,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:35:59,340 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] [2023-11-29 05:35:59,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 05:35:59,340 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 05:35:59,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:35:59,341 INFO L85 PathProgramCache]: Analyzing trace with hash -376520433, now seen corresponding path program 6 times [2023-11-29 05:35:59,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:35:59,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039481120] [2023-11-29 05:35:59,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:59,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:35:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:00,728 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 05:36:00,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:36:00,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039481120] [2023-11-29 05:36:00,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039481120] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:36:00,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:36:00,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 05:36:00,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445461372] [2023-11-29 05:36:00,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:36:00,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 05:36:00,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:36:00,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 05:36:00,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:36:00,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2023-11-29 05:36:00,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 324 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 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 05:36:00,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:36:00,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2023-11-29 05:36:00,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:36:01,403 INFO L124 PetriNetUnfolderBase]: 1309/2390 cut-off events. [2023-11-29 05:36:01,403 INFO L125 PetriNetUnfolderBase]: For 2510/2588 co-relation queries the response was YES. [2023-11-29 05:36:01,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6671 conditions, 2390 events. 1309/2390 cut-off events. For 2510/2588 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 14504 event pairs, 168 based on Foata normal form. 22/2339 useless extension candidates. Maximal degree in co-relation 6648. Up to 768 conditions per place. [2023-11-29 05:36:01,415 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 53 selfloop transitions, 15 changer transitions 26/111 dead transitions. [2023-11-29 05:36:01,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 111 transitions, 696 flow [2023-11-29 05:36:01,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:36:01,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 05:36:01,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 204 transitions. [2023-11-29 05:36:01,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2023-11-29 05:36:01,418 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 204 transitions. [2023-11-29 05:36:01,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 204 transitions. [2023-11-29 05:36:01,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:36:01,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 204 transitions. [2023-11-29 05:36:01,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 22.666666666666668) internal successors, (204), 9 states have internal predecessors, (204), 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 05:36:01,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 40.0) internal successors, (400), 10 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 05:36:01,421 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 40.0) internal successors, (400), 10 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 05:36:01,421 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 324 flow. Second operand 9 states and 204 transitions. [2023-11-29 05:36:01,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 111 transitions, 696 flow [2023-11-29 05:36:01,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 111 transitions, 677 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-11-29 05:36:01,430 INFO L231 Difference]: Finished difference. Result has 75 places, 62 transitions, 385 flow [2023-11-29 05:36:01,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=385, PETRI_PLACES=75, PETRI_TRANSITIONS=62} [2023-11-29 05:36:01,431 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 29 predicate places. [2023-11-29 05:36:01,431 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 62 transitions, 385 flow [2023-11-29 05:36:01,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 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 05:36:01,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:36:01,431 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] [2023-11-29 05:36:01,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 05:36:01,432 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 05:36:01,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:36:01,432 INFO L85 PathProgramCache]: Analyzing trace with hash 557517369, now seen corresponding path program 7 times [2023-11-29 05:36:01,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:36:01,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115088269] [2023-11-29 05:36:01,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:36:01,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:36:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:02,161 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 05:36:02,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:36:02,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115088269] [2023-11-29 05:36:02,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115088269] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:36:02,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:36:02,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 05:36:02,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385025401] [2023-11-29 05:36:02,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:36:02,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:36:02,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:36:02,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:36:02,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:36:02,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2023-11-29 05:36:02,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 62 transitions, 385 flow. Second operand has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 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 05:36:02,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:36:02,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2023-11-29 05:36:02,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:36:02,844 INFO L124 PetriNetUnfolderBase]: 1378/2497 cut-off events. [2023-11-29 05:36:02,844 INFO L125 PetriNetUnfolderBase]: For 3994/4064 co-relation queries the response was YES. [2023-11-29 05:36:02,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7567 conditions, 2497 events. 1378/2497 cut-off events. For 3994/4064 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 15296 event pairs, 372 based on Foata normal form. 24/2409 useless extension candidates. Maximal degree in co-relation 7542. Up to 1350 conditions per place. [2023-11-29 05:36:02,855 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 65 selfloop transitions, 19 changer transitions 21/122 dead transitions. [2023-11-29 05:36:02,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 122 transitions, 940 flow [2023-11-29 05:36:02,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:36:02,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 05:36:02,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 202 transitions. [2023-11-29 05:36:02,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5611111111111111 [2023-11-29 05:36:02,857 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 202 transitions. [2023-11-29 05:36:02,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 202 transitions. [2023-11-29 05:36:02,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:36:02,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 202 transitions. [2023-11-29 05:36:02,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 22.444444444444443) internal successors, (202), 9 states have internal predecessors, (202), 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 05:36:02,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 40.0) internal successors, (400), 10 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 05:36:02,860 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 40.0) internal successors, (400), 10 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 05:36:02,860 INFO L175 Difference]: Start difference. First operand has 75 places, 62 transitions, 385 flow. Second operand 9 states and 202 transitions. [2023-11-29 05:36:02,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 122 transitions, 940 flow [2023-11-29 05:36:02,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 122 transitions, 879 flow, removed 15 selfloop flow, removed 7 redundant places. [2023-11-29 05:36:02,870 INFO L231 Difference]: Finished difference. Result has 77 places, 74 transitions, 541 flow [2023-11-29 05:36:02,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=541, PETRI_PLACES=77, PETRI_TRANSITIONS=74} [2023-11-29 05:36:02,871 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 31 predicate places. [2023-11-29 05:36:02,871 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 74 transitions, 541 flow [2023-11-29 05:36:02,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 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 05:36:02,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:36:02,872 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] [2023-11-29 05:36:02,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 05:36:02,872 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 05:36:02,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:36:02,872 INFO L85 PathProgramCache]: Analyzing trace with hash -2041837963, now seen corresponding path program 8 times [2023-11-29 05:36:02,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:36:02,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166593864] [2023-11-29 05:36:02,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:36:02,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:36:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:03,383 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 05:36:03,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:36:03,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166593864] [2023-11-29 05:36:03,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166593864] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:36:03,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:36:03,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:36:03,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263658146] [2023-11-29 05:36:03,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:36:03,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:36:03,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:36:03,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:36:03,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:36:03,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2023-11-29 05:36:03,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 74 transitions, 541 flow. Second operand has 9 states, 9 states have (on average 16.22222222222222) internal successors, (146), 9 states have internal predecessors, (146), 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 05:36:03,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:36:03,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2023-11-29 05:36:03,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:36:03,974 INFO L124 PetriNetUnfolderBase]: 1403/2541 cut-off events. [2023-11-29 05:36:03,974 INFO L125 PetriNetUnfolderBase]: For 4112/4250 co-relation queries the response was YES. [2023-11-29 05:36:03,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7953 conditions, 2541 events. 1403/2541 cut-off events. For 4112/4250 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 15539 event pairs, 500 based on Foata normal form. 52/2501 useless extension candidates. Maximal degree in co-relation 7927. Up to 1365 conditions per place. [2023-11-29 05:36:03,984 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 53 selfloop transitions, 17 changer transitions 39/126 dead transitions. [2023-11-29 05:36:03,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 126 transitions, 1016 flow [2023-11-29 05:36:03,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:36:03,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 05:36:03,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 214 transitions. [2023-11-29 05:36:03,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.535 [2023-11-29 05:36:03,986 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 214 transitions. [2023-11-29 05:36:03,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 214 transitions. [2023-11-29 05:36:03,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:36:03,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 214 transitions. [2023-11-29 05:36:03,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 21.4) internal successors, (214), 10 states have internal predecessors, (214), 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 05:36:03,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 40.0) internal successors, (440), 11 states have internal predecessors, (440), 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 05:36:03,989 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 40.0) internal successors, (440), 11 states have internal predecessors, (440), 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 05:36:03,989 INFO L175 Difference]: Start difference. First operand has 77 places, 74 transitions, 541 flow. Second operand 10 states and 214 transitions. [2023-11-29 05:36:03,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 126 transitions, 1016 flow [2023-11-29 05:36:03,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 126 transitions, 974 flow, removed 12 selfloop flow, removed 5 redundant places. [2023-11-29 05:36:03,997 INFO L231 Difference]: Finished difference. Result has 84 places, 71 transitions, 545 flow [2023-11-29 05:36:03,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=545, PETRI_PLACES=84, PETRI_TRANSITIONS=71} [2023-11-29 05:36:03,998 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 38 predicate places. [2023-11-29 05:36:03,998 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 71 transitions, 545 flow [2023-11-29 05:36:03,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.22222222222222) internal successors, (146), 9 states have internal predecessors, (146), 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 05:36:03,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:36:03,999 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] [2023-11-29 05:36:03,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 05:36:03,999 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 05:36:03,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:36:04,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1280643269, now seen corresponding path program 9 times [2023-11-29 05:36:04,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:36:04,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21661586] [2023-11-29 05:36:04,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:36:04,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:36:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:04,720 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 05:36:04,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:36:04,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21661586] [2023-11-29 05:36:04,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21661586] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:36:04,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:36:04,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 05:36:04,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889382321] [2023-11-29 05:36:04,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:36:04,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 05:36:04,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:36:04,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 05:36:04,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:36:04,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2023-11-29 05:36:04,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 71 transitions, 545 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 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 05:36:04,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:36:04,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2023-11-29 05:36:04,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:36:05,694 INFO L124 PetriNetUnfolderBase]: 1364/2478 cut-off events. [2023-11-29 05:36:05,695 INFO L125 PetriNetUnfolderBase]: For 4372/4504 co-relation queries the response was YES. [2023-11-29 05:36:05,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7930 conditions, 2478 events. 1364/2478 cut-off events. For 4372/4504 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 15306 event pairs, 250 based on Foata normal form. 56/2447 useless extension candidates. Maximal degree in co-relation 7901. Up to 1105 conditions per place. [2023-11-29 05:36:05,708 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 86 selfloop transitions, 34 changer transitions 21/158 dead transitions. [2023-11-29 05:36:05,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 158 transitions, 1201 flow [2023-11-29 05:36:05,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 05:36:05,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-11-29 05:36:05,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 362 transitions. [2023-11-29 05:36:05,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5323529411764706 [2023-11-29 05:36:05,714 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 362 transitions. [2023-11-29 05:36:05,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 362 transitions. [2023-11-29 05:36:05,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:36:05,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 362 transitions. [2023-11-29 05:36:05,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 21.294117647058822) internal successors, (362), 17 states have internal predecessors, (362), 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 05:36:05,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 40.0) internal successors, (720), 18 states have internal predecessors, (720), 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 05:36:05,719 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 40.0) internal successors, (720), 18 states have internal predecessors, (720), 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 05:36:05,719 INFO L175 Difference]: Start difference. First operand has 84 places, 71 transitions, 545 flow. Second operand 17 states and 362 transitions. [2023-11-29 05:36:05,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 158 transitions, 1201 flow [2023-11-29 05:36:05,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 158 transitions, 1140 flow, removed 24 selfloop flow, removed 9 redundant places. [2023-11-29 05:36:05,733 INFO L231 Difference]: Finished difference. Result has 93 places, 81 transitions, 704 flow [2023-11-29 05:36:05,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=704, PETRI_PLACES=93, PETRI_TRANSITIONS=81} [2023-11-29 05:36:05,734 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 47 predicate places. [2023-11-29 05:36:05,734 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 81 transitions, 704 flow [2023-11-29 05:36:05,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 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 05:36:05,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:36:05,734 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] [2023-11-29 05:36:05,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 05:36:05,735 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 05:36:05,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:36:05,735 INFO L85 PathProgramCache]: Analyzing trace with hash -569246219, now seen corresponding path program 10 times [2023-11-29 05:36:05,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:36:05,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653193472] [2023-11-29 05:36:05,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:36:05,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:36:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,232 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 05:36:06,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:36:06,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653193472] [2023-11-29 05:36:06,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653193472] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:36:06,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:36:06,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:36:06,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207585099] [2023-11-29 05:36:06,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:36:06,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:36:06,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:36:06,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:36:06,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:36:06,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2023-11-29 05:36:06,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 81 transitions, 704 flow. Second operand has 9 states, 9 states have (on average 16.22222222222222) internal successors, (146), 9 states have internal predecessors, (146), 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 05:36:06,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:36:06,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2023-11-29 05:36:06,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:36:06,771 INFO L124 PetriNetUnfolderBase]: 1328/2392 cut-off events. [2023-11-29 05:36:06,771 INFO L125 PetriNetUnfolderBase]: For 5448/5501 co-relation queries the response was YES. [2023-11-29 05:36:06,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7947 conditions, 2392 events. 1328/2392 cut-off events. For 5448/5501 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 14639 event pairs, 739 based on Foata normal form. 23/2311 useless extension candidates. Maximal degree in co-relation 7917. Up to 1412 conditions per place. [2023-11-29 05:36:06,783 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 52 selfloop transitions, 13 changer transitions 29/111 dead transitions. [2023-11-29 05:36:06,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 111 transitions, 980 flow [2023-11-29 05:36:06,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:36:06,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 05:36:06,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 192 transitions. [2023-11-29 05:36:06,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2023-11-29 05:36:06,784 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 192 transitions. [2023-11-29 05:36:06,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 192 transitions. [2023-11-29 05:36:06,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:36:06,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 192 transitions. [2023-11-29 05:36:06,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 21.333333333333332) internal successors, (192), 9 states have internal predecessors, (192), 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 05:36:06,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 40.0) internal successors, (400), 10 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 05:36:06,787 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 40.0) internal successors, (400), 10 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 05:36:06,787 INFO L175 Difference]: Start difference. First operand has 93 places, 81 transitions, 704 flow. Second operand 9 states and 192 transitions. [2023-11-29 05:36:06,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 111 transitions, 980 flow [2023-11-29 05:36:06,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 111 transitions, 904 flow, removed 25 selfloop flow, removed 9 redundant places. [2023-11-29 05:36:06,806 INFO L231 Difference]: Finished difference. Result has 92 places, 72 transitions, 581 flow [2023-11-29 05:36:06,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=581, PETRI_PLACES=92, PETRI_TRANSITIONS=72} [2023-11-29 05:36:06,807 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 46 predicate places. [2023-11-29 05:36:06,807 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 72 transitions, 581 flow [2023-11-29 05:36:06,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.22222222222222) internal successors, (146), 9 states have internal predecessors, (146), 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 05:36:06,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:36:06,808 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] [2023-11-29 05:36:06,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 05:36:06,808 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 05:36:06,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:36:06,808 INFO L85 PathProgramCache]: Analyzing trace with hash 101258751, now seen corresponding path program 11 times [2023-11-29 05:36:06,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:36:06,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449263784] [2023-11-29 05:36:06,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:36:06,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:36:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:07,956 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 05:36:07,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:36:07,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449263784] [2023-11-29 05:36:07,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449263784] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:36:07,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:36:07,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 05:36:07,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018084802] [2023-11-29 05:36:07,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:36:07,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 05:36:07,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:36:07,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 05:36:07,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:36:07,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2023-11-29 05:36:07,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 72 transitions, 581 flow. Second operand has 11 states, 11 states have (on average 14.909090909090908) internal successors, (164), 11 states have internal predecessors, (164), 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 05:36:07,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:36:07,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2023-11-29 05:36:07,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:36:08,732 INFO L124 PetriNetUnfolderBase]: 1455/2623 cut-off events. [2023-11-29 05:36:08,732 INFO L125 PetriNetUnfolderBase]: For 4916/4916 co-relation queries the response was YES. [2023-11-29 05:36:08,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8631 conditions, 2623 events. 1455/2623 cut-off events. For 4916/4916 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 16406 event pairs, 432 based on Foata normal form. 8/2522 useless extension candidates. Maximal degree in co-relation 8601. Up to 1001 conditions per place. [2023-11-29 05:36:08,743 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 62 selfloop transitions, 22 changer transitions 19/119 dead transitions. [2023-11-29 05:36:08,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 119 transitions, 991 flow [2023-11-29 05:36:08,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:36:08,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 05:36:08,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 193 transitions. [2023-11-29 05:36:08,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5361111111111111 [2023-11-29 05:36:08,744 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 193 transitions. [2023-11-29 05:36:08,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 193 transitions. [2023-11-29 05:36:08,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:36:08,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 193 transitions. [2023-11-29 05:36:08,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 21.444444444444443) internal successors, (193), 9 states have internal predecessors, (193), 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 05:36:08,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 40.0) internal successors, (400), 10 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 05:36:08,747 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 40.0) internal successors, (400), 10 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 05:36:08,747 INFO L175 Difference]: Start difference. First operand has 92 places, 72 transitions, 581 flow. Second operand 9 states and 193 transitions. [2023-11-29 05:36:08,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 119 transitions, 991 flow [2023-11-29 05:36:08,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 119 transitions, 922 flow, removed 15 selfloop flow, removed 11 redundant places. [2023-11-29 05:36:08,759 INFO L231 Difference]: Finished difference. Result has 86 places, 73 transitions, 605 flow [2023-11-29 05:36:08,760 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=605, PETRI_PLACES=86, PETRI_TRANSITIONS=73} [2023-11-29 05:36:08,760 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 40 predicate places. [2023-11-29 05:36:08,760 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 73 transitions, 605 flow [2023-11-29 05:36:08,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.909090909090908) internal successors, (164), 11 states have internal predecessors, (164), 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 05:36:08,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:36:08,761 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] [2023-11-29 05:36:08,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 05:36:08,761 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 05:36:08,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:36:08,762 INFO L85 PathProgramCache]: Analyzing trace with hash 946904161, now seen corresponding path program 12 times [2023-11-29 05:36:08,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:36:08,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451313009] [2023-11-29 05:36:08,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:36:08,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:36:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:09,627 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 05:36:09,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:36:09,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451313009] [2023-11-29 05:36:09,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451313009] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:36:09,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:36:09,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 05:36:09,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848524453] [2023-11-29 05:36:09,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:36:09,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 05:36:09,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:36:09,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 05:36:09,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:36:09,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2023-11-29 05:36:09,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 73 transitions, 605 flow. Second operand has 12 states, 12 states have (on average 15.666666666666666) internal successors, (188), 12 states have internal predecessors, (188), 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 05:36:09,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:36:09,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2023-11-29 05:36:09,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:36:10,312 INFO L124 PetriNetUnfolderBase]: 1128/2066 cut-off events. [2023-11-29 05:36:10,312 INFO L125 PetriNetUnfolderBase]: For 4187/4243 co-relation queries the response was YES. [2023-11-29 05:36:10,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7137 conditions, 2066 events. 1128/2066 cut-off events. For 4187/4243 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 12236 event pairs, 330 based on Foata normal form. 26/2011 useless extension candidates. Maximal degree in co-relation 7109. Up to 1346 conditions per place. [2023-11-29 05:36:10,321 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 57 selfloop transitions, 10 changer transitions 37/121 dead transitions. [2023-11-29 05:36:10,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 121 transitions, 1035 flow [2023-11-29 05:36:10,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:36:10,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-29 05:36:10,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 247 transitions. [2023-11-29 05:36:10,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5145833333333333 [2023-11-29 05:36:10,323 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 247 transitions. [2023-11-29 05:36:10,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 247 transitions. [2023-11-29 05:36:10,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:36:10,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 247 transitions. [2023-11-29 05:36:10,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 20.583333333333332) internal successors, (247), 12 states have internal predecessors, (247), 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 05:36:10,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 40.0) internal successors, (520), 13 states have internal predecessors, (520), 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 05:36:10,325 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 40.0) internal successors, (520), 13 states have internal predecessors, (520), 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 05:36:10,325 INFO L175 Difference]: Start difference. First operand has 86 places, 73 transitions, 605 flow. Second operand 12 states and 247 transitions. [2023-11-29 05:36:10,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 121 transitions, 1035 flow [2023-11-29 05:36:10,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 121 transitions, 943 flow, removed 6 selfloop flow, removed 8 redundant places. [2023-11-29 05:36:10,334 INFO L231 Difference]: Finished difference. Result has 91 places, 68 transitions, 514 flow [2023-11-29 05:36:10,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=514, PETRI_PLACES=91, PETRI_TRANSITIONS=68} [2023-11-29 05:36:10,334 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 45 predicate places. [2023-11-29 05:36:10,334 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 68 transitions, 514 flow [2023-11-29 05:36:10,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.666666666666666) internal successors, (188), 12 states have internal predecessors, (188), 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 05:36:10,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:36:10,335 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] [2023-11-29 05:36:10,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 05:36:10,335 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 05:36:10,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:36:10,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1909009241, now seen corresponding path program 13 times [2023-11-29 05:36:10,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:36:10,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43098907] [2023-11-29 05:36:10,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:36:10,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:36:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:11,366 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 05:36:11,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:36:11,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43098907] [2023-11-29 05:36:11,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43098907] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:36:11,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:36:11,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 05:36:11,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674908067] [2023-11-29 05:36:11,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:36:11,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:36:11,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:36:11,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:36:11,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:36:11,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2023-11-29 05:36:11,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 68 transitions, 514 flow. Second operand has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 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 05:36:11,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:36:11,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2023-11-29 05:36:11,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:36:12,035 INFO L124 PetriNetUnfolderBase]: 1443/2623 cut-off events. [2023-11-29 05:36:12,035 INFO L125 PetriNetUnfolderBase]: For 4119/4119 co-relation queries the response was YES. [2023-11-29 05:36:12,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8389 conditions, 2623 events. 1443/2623 cut-off events. For 4119/4119 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 16624 event pairs, 360 based on Foata normal form. 8/2540 useless extension candidates. Maximal degree in co-relation 8361. Up to 1366 conditions per place. [2023-11-29 05:36:12,045 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 63 selfloop transitions, 10 changer transitions 30/119 dead transitions. [2023-11-29 05:36:12,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 119 transitions, 992 flow [2023-11-29 05:36:12,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:36:12,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 05:36:12,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 204 transitions. [2023-11-29 05:36:12,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.51 [2023-11-29 05:36:12,047 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 204 transitions. [2023-11-29 05:36:12,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 204 transitions. [2023-11-29 05:36:12,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:36:12,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 204 transitions. [2023-11-29 05:36:12,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 20.4) internal successors, (204), 10 states have internal predecessors, (204), 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 05:36:12,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 40.0) internal successors, (440), 11 states have internal predecessors, (440), 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 05:36:12,048 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 40.0) internal successors, (440), 11 states have internal predecessors, (440), 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 05:36:12,048 INFO L175 Difference]: Start difference. First operand has 91 places, 68 transitions, 514 flow. Second operand 10 states and 204 transitions. [2023-11-29 05:36:12,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 119 transitions, 992 flow [2023-11-29 05:36:12,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 119 transitions, 902 flow, removed 11 selfloop flow, removed 13 redundant places. [2023-11-29 05:36:12,058 INFO L231 Difference]: Finished difference. Result has 84 places, 72 transitions, 551 flow [2023-11-29 05:36:12,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=551, PETRI_PLACES=84, PETRI_TRANSITIONS=72} [2023-11-29 05:36:12,058 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 38 predicate places. [2023-11-29 05:36:12,058 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 72 transitions, 551 flow [2023-11-29 05:36:12,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 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 05:36:12,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:36:12,058 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] [2023-11-29 05:36:12,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 05:36:12,059 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 05:36:12,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:36:12,059 INFO L85 PathProgramCache]: Analyzing trace with hash -220613371, now seen corresponding path program 14 times [2023-11-29 05:36:12,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:36:12,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255465788] [2023-11-29 05:36:12,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:36:12,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:36:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:12,855 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 05:36:12,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:36:12,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255465788] [2023-11-29 05:36:12,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255465788] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:36:12,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:36:12,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 05:36:12,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561039786] [2023-11-29 05:36:12,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:36:12,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 05:36:12,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:36:12,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 05:36:12,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:36:12,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2023-11-29 05:36:12,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 72 transitions, 551 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 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 05:36:12,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:36:12,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2023-11-29 05:36:12,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:36:13,468 INFO L124 PetriNetUnfolderBase]: 1484/2654 cut-off events. [2023-11-29 05:36:13,468 INFO L125 PetriNetUnfolderBase]: For 3290/3372 co-relation queries the response was YES. [2023-11-29 05:36:13,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8224 conditions, 2654 events. 1484/2654 cut-off events. For 3290/3372 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 16837 event pairs, 394 based on Foata normal form. 30/2561 useless extension candidates. Maximal degree in co-relation 8197. Up to 657 conditions per place. [2023-11-29 05:36:13,479 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 43 selfloop transitions, 10 changer transitions 46/116 dead transitions. [2023-11-29 05:36:13,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 116 transitions, 925 flow [2023-11-29 05:36:13,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:36:13,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 05:36:13,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 196 transitions. [2023-11-29 05:36:13,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5444444444444444 [2023-11-29 05:36:13,480 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 196 transitions. [2023-11-29 05:36:13,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 196 transitions. [2023-11-29 05:36:13,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:36:13,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 196 transitions. [2023-11-29 05:36:13,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 21.77777777777778) internal successors, (196), 9 states have internal predecessors, (196), 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 05:36:13,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 40.0) internal successors, (400), 10 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 05:36:13,481 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 40.0) internal successors, (400), 10 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 05:36:13,482 INFO L175 Difference]: Start difference. First operand has 84 places, 72 transitions, 551 flow. Second operand 9 states and 196 transitions. [2023-11-29 05:36:13,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 116 transitions, 925 flow [2023-11-29 05:36:13,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 116 transitions, 908 flow, removed 7 selfloop flow, removed 6 redundant places. [2023-11-29 05:36:13,490 INFO L231 Difference]: Finished difference. Result has 87 places, 57 transitions, 384 flow [2023-11-29 05:36:13,490 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=384, PETRI_PLACES=87, PETRI_TRANSITIONS=57} [2023-11-29 05:36:13,490 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 41 predicate places. [2023-11-29 05:36:13,490 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 57 transitions, 384 flow [2023-11-29 05:36:13,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 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 05:36:13,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:36:13,491 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] [2023-11-29 05:36:13,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 05:36:13,491 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 05:36:13,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:36:13,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1079170229, now seen corresponding path program 15 times [2023-11-29 05:36:13,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:36:13,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576166349] [2023-11-29 05:36:13,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:36:13,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:36:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:13,983 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 05:36:13,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:36:13,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576166349] [2023-11-29 05:36:13,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576166349] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:36:13,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:36:13,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:36:13,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581736178] [2023-11-29 05:36:13,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:36:13,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:36:13,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:36:13,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:36:13,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:36:14,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2023-11-29 05:36:14,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 57 transitions, 384 flow. Second operand has 9 states, 9 states have (on average 16.22222222222222) internal successors, (146), 9 states have internal predecessors, (146), 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 05:36:14,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:36:14,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2023-11-29 05:36:14,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:36:14,469 INFO L124 PetriNetUnfolderBase]: 760/1425 cut-off events. [2023-11-29 05:36:14,469 INFO L125 PetriNetUnfolderBase]: For 2123/2127 co-relation queries the response was YES. [2023-11-29 05:36:14,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4442 conditions, 1425 events. 760/1425 cut-off events. For 2123/2127 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 7952 event pairs, 209 based on Foata normal form. 8/1376 useless extension candidates. Maximal degree in co-relation 4414. Up to 480 conditions per place. [2023-11-29 05:36:14,475 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 44 selfloop transitions, 9 changer transitions 25/95 dead transitions. [2023-11-29 05:36:14,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 95 transitions, 682 flow [2023-11-29 05:36:14,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:36:14,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 05:36:14,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 193 transitions. [2023-11-29 05:36:14,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5361111111111111 [2023-11-29 05:36:14,476 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 193 transitions. [2023-11-29 05:36:14,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 193 transitions. [2023-11-29 05:36:14,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:36:14,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 193 transitions. [2023-11-29 05:36:14,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 21.444444444444443) internal successors, (193), 9 states have internal predecessors, (193), 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 05:36:14,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 40.0) internal successors, (400), 10 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 05:36:14,478 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 40.0) internal successors, (400), 10 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 05:36:14,478 INFO L175 Difference]: Start difference. First operand has 87 places, 57 transitions, 384 flow. Second operand 9 states and 193 transitions. [2023-11-29 05:36:14,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 95 transitions, 682 flow [2023-11-29 05:36:14,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 95 transitions, 611 flow, removed 11 selfloop flow, removed 13 redundant places. [2023-11-29 05:36:14,482 INFO L231 Difference]: Finished difference. Result has 79 places, 53 transitions, 306 flow [2023-11-29 05:36:14,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=306, PETRI_PLACES=79, PETRI_TRANSITIONS=53} [2023-11-29 05:36:14,483 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 33 predicate places. [2023-11-29 05:36:14,483 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 53 transitions, 306 flow [2023-11-29 05:36:14,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.22222222222222) internal successors, (146), 9 states have internal predecessors, (146), 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 05:36:14,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:36:14,483 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] [2023-11-29 05:36:14,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 05:36:14,483 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 05:36:14,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:36:14,483 INFO L85 PathProgramCache]: Analyzing trace with hash -394162367, now seen corresponding path program 16 times [2023-11-29 05:36:14,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:36:14,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766866155] [2023-11-29 05:36:14,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:36:14,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:36:14,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:36:14,525 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:36:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:36:14,603 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:36:14,604 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 05:36:14,605 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-29 05:36:14,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-29 05:36:14,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-29 05:36:14,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-29 05:36:14,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-29 05:36:14,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-29 05:36:14,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 05:36:14,612 INFO L445 BasicCegarLoop]: Path program histogram: [16, 1, 1, 1, 1] [2023-11-29 05:36:14,619 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 05:36:14,619 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:36:14,665 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 05:36:14,667 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 05:36:14,668 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 05:36:14,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:36:14 BasicIcfg [2023-11-29 05:36:14,695 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:36:14,695 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:36:14,695 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:36:14,696 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:36:14,696 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:35:45" (3/4) ... [2023-11-29 05:36:14,697 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-29 05:36:14,718 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 05:36:14,719 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 05:36:14,719 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 05:36:14,790 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b06ddb26-6abe-44ac-b93d-187517fa3e92/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 05:36:14,790 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:36:14,791 INFO L158 Benchmark]: Toolchain (without parser) took 31077.27ms. Allocated memory was 151.0MB in the beginning and 612.4MB in the end (delta: 461.4MB). Free memory was 111.8MB in the beginning and 552.3MB in the end (delta: -440.5MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. [2023-11-29 05:36:14,791 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 151.0MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:36:14,792 INFO L158 Benchmark]: CACSL2BoogieTranslator took 505.10ms. Allocated memory is still 151.0MB. Free memory was 111.2MB in the beginning and 85.1MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-29 05:36:14,792 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.81ms. Allocated memory is still 151.0MB. Free memory was 85.1MB in the beginning and 81.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:36:14,792 INFO L158 Benchmark]: Boogie Preprocessor took 64.62ms. Allocated memory is still 151.0MB. Free memory was 81.8MB in the beginning and 77.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:36:14,793 INFO L158 Benchmark]: RCFGBuilder took 811.47ms. Allocated memory was 151.0MB in the beginning and 201.3MB in the end (delta: 50.3MB). Free memory was 77.6MB in the beginning and 129.3MB in the end (delta: -51.7MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. [2023-11-29 05:36:14,793 INFO L158 Benchmark]: TraceAbstraction took 29542.59ms. Allocated memory was 201.3MB in the beginning and 612.4MB in the end (delta: 411.0MB). Free memory was 129.3MB in the beginning and 564.9MB in the end (delta: -435.6MB). Peak memory consumption was 328.5MB. Max. memory is 16.1GB. [2023-11-29 05:36:14,793 INFO L158 Benchmark]: Witness Printer took 95.22ms. Allocated memory is still 612.4MB. Free memory was 564.9MB in the beginning and 552.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 05:36:14,795 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.19ms. Allocated memory is still 151.0MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 505.10ms. Allocated memory is still 151.0MB. Free memory was 111.2MB in the beginning and 85.1MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.81ms. Allocated memory is still 151.0MB. Free memory was 85.1MB in the beginning and 81.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.62ms. Allocated memory is still 151.0MB. Free memory was 81.8MB in the beginning and 77.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 811.47ms. Allocated memory was 151.0MB in the beginning and 201.3MB in the end (delta: 50.3MB). Free memory was 77.6MB in the beginning and 129.3MB in the end (delta: -51.7MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. * TraceAbstraction took 29542.59ms. Allocated memory was 201.3MB in the beginning and 612.4MB in the end (delta: 411.0MB). Free memory was 129.3MB in the beginning and 564.9MB in the end (delta: -435.6MB). Peak memory consumption was 328.5MB. Max. memory is 16.1GB. * Witness Printer took 95.22ms. Allocated memory is still 612.4MB. Free memory was 564.9MB in the beginning and 552.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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~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: 19]: 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_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$r_buff1_thd3; [L733] 0 _Bool y$read_delayed; [L734] 0 int *y$read_delayed_var; [L735] 0 int y$w_buff0; [L736] 0 _Bool y$w_buff0_used; [L737] 0 int y$w_buff1; [L738] 0 _Bool y$w_buff1_used; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2321; [L855] FCALL, FORK 0 pthread_create(&t2321, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2321={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L856] 0 pthread_t t2322; [L857] FCALL, FORK 0 pthread_create(&t2322, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2321={5:0}, t2322={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L858] 0 pthread_t t2323; [L859] FCALL, FORK 0 pthread_create(&t2323, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 2 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L788] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L788] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L796] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L813] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L816] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 3 y$flush_delayed = weak$$choice2 [L819] 3 y$mem_tmp = y [L820] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L821] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L822] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L823] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L824] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L826] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 __unbuffered_p2_EBX = y [L828] 3 y = y$flush_delayed ? y$mem_tmp : y [L829] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L744] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L747] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L832] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L833] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L834] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L835] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L836] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L770] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L771] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L772] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L773] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] 0 y$mem_tmp = y [L876] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L878] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L879] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L880] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L882] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L19] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 19]: 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: 855]: 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: 859]: 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: 857]: 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 7 procedures, 66 locations, 6 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: 29.4s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 16, EmptinessCheckTime: 0.0s, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1395 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1313 mSDsluCounter, 1051 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 966 mSDsCounter, 295 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5280 IncrementalHoareTripleChecker+Invalid, 5575 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 295 mSolverCounterUnsat, 85 mSDtfsCounter, 5280 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 236 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=704occurred in iteration=13, InterpolantAutomatonStates: 164, 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, 1.0s SatisfiabilityAnalysisTime, 14.9s InterpolantComputationTime, 543 NumberOfCodeBlocks, 543 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 494 ConstructedInterpolants, 0 QuantifiedInterpolants, 5685 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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 05:36:14,814 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b06ddb26-6abe-44ac-b93d-187517fa3e92/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