./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b 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_083a8062-0330-4592-b8c8-eedf8a4943d0/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083a8062-0330-4592-b8c8-eedf8a4943d0/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083a8062-0330-4592-b8c8-eedf8a4943d0/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083a8062-0330-4592-b8c8-eedf8a4943d0/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083a8062-0330-4592-b8c8-eedf8a4943d0/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083a8062-0330-4592-b8c8-eedf8a4943d0/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 5e0f2637c3745e36a3708f37a9783771b3e1c15cb350f0e936eafd42058bd9cf --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:15:08,258 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:15:08,380 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083a8062-0330-4592-b8c8-eedf8a4943d0/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:15:08,386 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:15:08,387 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:15:08,417 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:15:08,418 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:15:08,419 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:15:08,420 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:15:08,421 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:15:08,422 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:15:08,423 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:15:08,424 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:15:08,425 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:15:08,425 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:15:08,426 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:15:08,427 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:15:08,428 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:15:08,428 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:15:08,429 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:15:08,430 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:15:08,431 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:15:08,432 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:15:08,433 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:15:08,433 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:15:08,434 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:15:08,435 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:15:08,435 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:15:08,436 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:15:08,437 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:15:08,438 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:15:08,438 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:15:08,439 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:15:08,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:15:08,440 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:15:08,440 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:15:08,441 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:15:08,441 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:15:08,442 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:15:08,442 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_083a8062-0330-4592-b8c8-eedf8a4943d0/bin/uautomizer-verify-WvqO1wxjHP/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_083a8062-0330-4592-b8c8-eedf8a4943d0/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 5e0f2637c3745e36a3708f37a9783771b3e1c15cb350f0e936eafd42058bd9cf [2023-11-06 22:15:08,763 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:15:08,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:15:08,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:15:08,811 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:15:08,812 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:15:08,814 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083a8062-0330-4592-b8c8-eedf8a4943d0/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-06 22:15:12,462 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:15:12,814 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:15:12,815 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083a8062-0330-4592-b8c8-eedf8a4943d0/sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-06 22:15:12,839 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083a8062-0330-4592-b8c8-eedf8a4943d0/bin/uautomizer-verify-WvqO1wxjHP/data/65b43d151/f95bb7dcfaa94eafa16dc25bb071c23d/FLAGcd67187c6 [2023-11-06 22:15:12,856 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083a8062-0330-4592-b8c8-eedf8a4943d0/bin/uautomizer-verify-WvqO1wxjHP/data/65b43d151/f95bb7dcfaa94eafa16dc25bb071c23d [2023-11-06 22:15:12,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:15:12,862 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:15:12,864 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:15:12,867 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:15:12,875 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:15:12,879 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:15:12" (1/1) ... [2023-11-06 22:15:12,881 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11a05894 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:12, skipping insertion in model container [2023-11-06 22:15:12,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:15:12" (1/1) ... [2023-11-06 22:15:12,963 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:15:13,188 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_083a8062-0330-4592-b8c8-eedf8a4943d0/sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2023-11-06 22:15:13,466 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:15:13,479 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:15:13,495 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_083a8062-0330-4592-b8c8-eedf8a4943d0/sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2023-11-06 22:15:13,569 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:15:13,619 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:15:13,620 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:15:13,630 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:15:13,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:13 WrapperNode [2023-11-06 22:15:13,631 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:15:13,633 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:15:13,633 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:15:13,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:15:13,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:13" (1/1) ... [2023-11-06 22:15:13,686 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:13" (1/1) ... [2023-11-06 22:15:13,754 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-11-06 22:15:13,757 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:15:13,758 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:15:13,759 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:15:13,759 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:15:13,771 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:13" (1/1) ... [2023-11-06 22:15:13,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:13" (1/1) ... [2023-11-06 22:15:13,791 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:13" (1/1) ... [2023-11-06 22:15:13,794 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:13" (1/1) ... [2023-11-06 22:15:13,827 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:13" (1/1) ... [2023-11-06 22:15:13,829 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:13" (1/1) ... [2023-11-06 22:15:13,833 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:13" (1/1) ... [2023-11-06 22:15:13,845 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:13" (1/1) ... [2023-11-06 22:15:13,851 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:15:13,865 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:15:13,865 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:15:13,866 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:15:13,867 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:13" (1/1) ... [2023-11-06 22:15:13,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:15:13,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083a8062-0330-4592-b8c8-eedf8a4943d0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:15:13,916 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083a8062-0330-4592-b8c8-eedf8a4943d0/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:15:13,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083a8062-0330-4592-b8c8-eedf8a4943d0/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:15:13,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:15:13,977 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:15:13,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:15:13,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:15:13,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:15:13,978 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:15:13,978 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:15:13,979 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:15:13,979 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:15:13,979 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:15:13,981 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:15:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:15:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:15:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:15:13,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:15:13,985 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:15:14,246 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:15:14,249 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:15:14,793 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:15:15,113 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:15:15,115 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:15:15,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:15:15 BoogieIcfgContainer [2023-11-06 22:15:15,120 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:15:15,124 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:15:15,127 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:15:15,132 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:15:15,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:15:12" (1/3) ... [2023-11-06 22:15:15,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4efcf740 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:15:15, skipping insertion in model container [2023-11-06 22:15:15,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:13" (2/3) ... [2023-11-06 22:15:15,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4efcf740 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:15:15, skipping insertion in model container [2023-11-06 22:15:15,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:15:15" (3/3) ... [2023-11-06 22:15:15,140 INFO L112 eAbstractionObserver]: Analyzing ICFG safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-06 22:15:15,164 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 22:15:15,179 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:15:15,179 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-06 22:15:15,179 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:15:15,266 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:15:15,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 234 flow [2023-11-06 22:15:15,401 INFO L124 PetriNetUnfolderBase]: 2/108 cut-off events. [2023-11-06 22:15:15,402 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:15:15,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2023-11-06 22:15:15,410 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 111 transitions, 234 flow [2023-11-06 22:15:15,416 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 108 transitions, 225 flow [2023-11-06 22:15:15,421 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:15:15,435 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 108 transitions, 225 flow [2023-11-06 22:15:15,439 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 108 transitions, 225 flow [2023-11-06 22:15:15,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 225 flow [2023-11-06 22:15:15,488 INFO L124 PetriNetUnfolderBase]: 2/108 cut-off events. [2023-11-06 22:15:15,488 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:15:15,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2023-11-06 22:15:15,496 INFO L119 LiptonReduction]: Number of co-enabled transitions 2096 [2023-11-06 22:15:22,383 INFO L134 LiptonReduction]: Checked pairs total: 5478 [2023-11-06 22:15:22,383 INFO L136 LiptonReduction]: Total number of compositions: 99 [2023-11-06 22:15:22,399 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:15:22,406 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=LoopsAndPotentialCycles, 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;@f5a292e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:15:22,406 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-06 22:15:22,411 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:15:22,411 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-06 22:15:22,411 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:15:22,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:15:22,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 22:15:22,413 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:15:22,419 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:15:22,419 INFO L85 PathProgramCache]: Analyzing trace with hash 553874, now seen corresponding path program 1 times [2023-11-06 22:15:22,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:15:22,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351453928] [2023-11-06 22:15:22,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:22,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:15:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:22,991 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-06 22:15:22,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:15:22,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351453928] [2023-11-06 22:15:22,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351453928] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:15:22,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:15:22,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:15:22,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198027054] [2023-11-06 22:15:22,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:15:23,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:15:23,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:15:23,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:15:23,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:15:23,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 210 [2023-11-06 22:15:23,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 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-06 22:15:23,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:15:23,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 210 [2023-11-06 22:15:23,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:15:23,748 INFO L124 PetriNetUnfolderBase]: 895/1447 cut-off events. [2023-11-06 22:15:23,748 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-06 22:15:23,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2830 conditions, 1447 events. 895/1447 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7537 event pairs, 142 based on Foata normal form. 0/1366 useless extension candidates. Maximal degree in co-relation 2819. Up to 1084 conditions per place. [2023-11-06 22:15:23,778 INFO L140 encePairwiseOnDemand]: 206/210 looper letters, 31 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2023-11-06 22:15:23,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 37 transitions, 159 flow [2023-11-06 22:15:23,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:15:23,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:15:23,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2023-11-06 22:15:23,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5126984126984127 [2023-11-06 22:15:23,808 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 323 transitions. [2023-11-06 22:15:23,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions. [2023-11-06 22:15:23,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:15:23,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions. [2023-11-06 22:15:23,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:15:23,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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-06 22:15:23,830 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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-06 22:15:23,832 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 57 flow. Second operand 3 states and 323 transitions. [2023-11-06 22:15:23,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 37 transitions, 159 flow [2023-11-06 22:15:23,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 37 transitions, 154 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:15:23,839 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2023-11-06 22:15:23,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-11-06 22:15:23,847 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2023-11-06 22:15:23,847 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2023-11-06 22:15:23,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 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-06 22:15:23,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:15:23,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:15:23,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:15:23,849 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:15:23,849 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:15:23,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1534070277, now seen corresponding path program 1 times [2023-11-06 22:15:23,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:15:23,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021372749] [2023-11-06 22:15:23,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:23,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:15:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:25,592 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-06 22:15:25,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:15:25,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021372749] [2023-11-06 22:15:25,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021372749] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:15:25,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:15:25,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:15:25,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031330018] [2023-11-06 22:15:25,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:15:25,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:15:25,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:15:25,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:15:25,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:15:25,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-11-06 22:15:25,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 90.25) internal successors, (361), 4 states have internal predecessors, (361), 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-06 22:15:25,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:15:25,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-11-06 22:15:25,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:15:26,086 INFO L124 PetriNetUnfolderBase]: 671/1021 cut-off events. [2023-11-06 22:15:26,086 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2023-11-06 22:15:26,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2169 conditions, 1021 events. 671/1021 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4302 event pairs, 159 based on Foata normal form. 16/1033 useless extension candidates. Maximal degree in co-relation 2159. Up to 817 conditions per place. [2023-11-06 22:15:26,098 INFO L140 encePairwiseOnDemand]: 207/210 looper letters, 25 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2023-11-06 22:15:26,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 124 flow [2023-11-06 22:15:26,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:15:26,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:15:26,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2023-11-06 22:15:26,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634920634920635 [2023-11-06 22:15:26,103 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 292 transitions. [2023-11-06 22:15:26,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 292 transitions. [2023-11-06 22:15:26,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:15:26,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 292 transitions. [2023-11-06 22:15:26,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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-06 22:15:26,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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-06 22:15:26,110 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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-06 22:15:26,111 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 3 states and 292 transitions. [2023-11-06 22:15:26,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 124 flow [2023-11-06 22:15:26,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:15:26,114 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 56 flow [2023-11-06 22:15:26,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-11-06 22:15:26,115 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2023-11-06 22:15:26,116 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2023-11-06 22:15:26,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.25) internal successors, (361), 4 states have internal predecessors, (361), 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-06 22:15:26,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:15:26,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:15:26,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:15:26,118 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:15:26,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:15:26,119 INFO L85 PathProgramCache]: Analyzing trace with hash 311537355, now seen corresponding path program 1 times [2023-11-06 22:15:26,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:15:26,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488414961] [2023-11-06 22:15:26,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:26,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:15:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:26,414 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-06 22:15:26,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:15:26,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488414961] [2023-11-06 22:15:26,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488414961] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:15:26,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:15:26,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:15:26,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165841946] [2023-11-06 22:15:26,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:15:26,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:15:26,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:15:26,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:15:26,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:15:26,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 210 [2023-11-06 22:15:26,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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-06 22:15:26,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:15:26,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 210 [2023-11-06 22:15:26,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:15:26,782 INFO L124 PetriNetUnfolderBase]: 631/1030 cut-off events. [2023-11-06 22:15:26,783 INFO L125 PetriNetUnfolderBase]: For 105/105 co-relation queries the response was YES. [2023-11-06 22:15:26,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2181 conditions, 1030 events. 631/1030 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4886 event pairs, 118 based on Foata normal form. 16/1045 useless extension candidates. Maximal degree in co-relation 2170. Up to 798 conditions per place. [2023-11-06 22:15:26,794 INFO L140 encePairwiseOnDemand]: 207/210 looper letters, 28 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2023-11-06 22:15:26,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 32 transitions, 143 flow [2023-11-06 22:15:26,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:15:26,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:15:26,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 313 transitions. [2023-11-06 22:15:26,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49682539682539684 [2023-11-06 22:15:26,798 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 313 transitions. [2023-11-06 22:15:26,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 313 transitions. [2023-11-06 22:15:26,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:15:26,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 313 transitions. [2023-11-06 22:15:26,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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-06 22:15:26,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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-06 22:15:26,807 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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-06 22:15:26,807 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 3 states and 313 transitions. [2023-11-06 22:15:26,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 32 transitions, 143 flow [2023-11-06 22:15:26,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 32 transitions, 137 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:15:26,812 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 60 flow [2023-11-06 22:15:26,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-11-06 22:15:26,814 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -1 predicate places. [2023-11-06 22:15:26,819 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 60 flow [2023-11-06 22:15:26,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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-06 22:15:26,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:15:26,820 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:15:26,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:15:26,821 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:15:26,822 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:15:26,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1066598346, now seen corresponding path program 1 times [2023-11-06 22:15:26,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:15:26,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201473158] [2023-11-06 22:15:26,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:26,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:15:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:28,160 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-06 22:15:28,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:15:28,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201473158] [2023-11-06 22:15:28,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201473158] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:15:28,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:15:28,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:15:28,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954132595] [2023-11-06 22:15:28,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:15:28,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:15:28,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:15:28,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:15:28,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:15:28,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 210 [2023-11-06 22:15:28,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 88.75) internal successors, (355), 4 states have internal predecessors, (355), 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-06 22:15:28,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:15:28,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 210 [2023-11-06 22:15:28,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:15:28,927 INFO L124 PetriNetUnfolderBase]: 922/1404 cut-off events. [2023-11-06 22:15:28,927 INFO L125 PetriNetUnfolderBase]: For 260/260 co-relation queries the response was YES. [2023-11-06 22:15:28,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3203 conditions, 1404 events. 922/1404 cut-off events. For 260/260 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6569 event pairs, 122 based on Foata normal form. 12/1414 useless extension candidates. Maximal degree in co-relation 3191. Up to 829 conditions per place. [2023-11-06 22:15:28,943 INFO L140 encePairwiseOnDemand]: 199/210 looper letters, 42 selfloop transitions, 16 changer transitions 0/59 dead transitions. [2023-11-06 22:15:28,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 59 transitions, 275 flow [2023-11-06 22:15:28,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:15:28,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:15:28,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 490 transitions. [2023-11-06 22:15:28,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2023-11-06 22:15:28,948 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 490 transitions. [2023-11-06 22:15:28,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 490 transitions. [2023-11-06 22:15:28,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:15:28,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 490 transitions. [2023-11-06 22:15:28,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 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-06 22:15:28,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 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-06 22:15:28,956 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 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-06 22:15:28,957 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 60 flow. Second operand 5 states and 490 transitions. [2023-11-06 22:15:28,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 59 transitions, 275 flow [2023-11-06 22:15:28,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 59 transitions, 267 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:15:28,960 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 173 flow [2023-11-06 22:15:28,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=173, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2023-11-06 22:15:28,962 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places. [2023-11-06 22:15:28,962 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 173 flow [2023-11-06 22:15:28,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.75) internal successors, (355), 4 states have internal predecessors, (355), 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-06 22:15:28,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:15:28,963 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:15:28,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:15:28,964 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:15:28,965 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:15:28,965 INFO L85 PathProgramCache]: Analyzing trace with hash 577354394, now seen corresponding path program 2 times [2023-11-06 22:15:28,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:15:28,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98478037] [2023-11-06 22:15:28,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:28,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:15:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:30,067 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-06 22:15:30,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:15:30,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98478037] [2023-11-06 22:15:30,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98478037] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:15:30,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:15:30,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:15:30,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814910319] [2023-11-06 22:15:30,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:15:30,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:15:30,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:15:30,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:15:30,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:15:30,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 210 [2023-11-06 22:15:30,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 173 flow. Second operand has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 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-06 22:15:30,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:15:30,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 210 [2023-11-06 22:15:30,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:15:30,751 INFO L124 PetriNetUnfolderBase]: 1131/1792 cut-off events. [2023-11-06 22:15:30,752 INFO L125 PetriNetUnfolderBase]: For 2055/2058 co-relation queries the response was YES. [2023-11-06 22:15:30,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5794 conditions, 1792 events. 1131/1792 cut-off events. For 2055/2058 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9181 event pairs, 170 based on Foata normal form. 60/1851 useless extension candidates. Maximal degree in co-relation 5779. Up to 780 conditions per place. [2023-11-06 22:15:30,770 INFO L140 encePairwiseOnDemand]: 206/210 looper letters, 40 selfloop transitions, 3 changer transitions 16/60 dead transitions. [2023-11-06 22:15:30,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 60 transitions, 394 flow [2023-11-06 22:15:30,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:15:30,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:15:30,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 391 transitions. [2023-11-06 22:15:30,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4654761904761905 [2023-11-06 22:15:30,774 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 391 transitions. [2023-11-06 22:15:30,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 391 transitions. [2023-11-06 22:15:30,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:15:30,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 391 transitions. [2023-11-06 22:15:30,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 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-06 22:15:30,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 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-06 22:15:30,780 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 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-06 22:15:30,781 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 173 flow. Second operand 4 states and 391 transitions. [2023-11-06 22:15:30,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 60 transitions, 394 flow [2023-11-06 22:15:30,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 60 transitions, 386 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:15:30,790 INFO L231 Difference]: Finished difference. Result has 41 places, 24 transitions, 123 flow [2023-11-06 22:15:30,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=123, PETRI_PLACES=41, PETRI_TRANSITIONS=24} [2023-11-06 22:15:30,794 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places. [2023-11-06 22:15:30,794 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 24 transitions, 123 flow [2023-11-06 22:15:30,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 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-06 22:15:30,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:15:30,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:15:30,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:15:30,795 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:15:30,796 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:15:30,796 INFO L85 PathProgramCache]: Analyzing trace with hash 80944273, now seen corresponding path program 1 times [2023-11-06 22:15:30,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:15:30,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797534049] [2023-11-06 22:15:30,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:30,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:15:30,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:31,185 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-06 22:15:31,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:15:31,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797534049] [2023-11-06 22:15:31,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797534049] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:15:31,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:15:31,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:15:31,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680272822] [2023-11-06 22:15:31,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:15:31,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:15:31,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:15:31,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:15:31,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:15:31,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 210 [2023-11-06 22:15:31,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 24 transitions, 123 flow. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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-06 22:15:31,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:15:31,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 210 [2023-11-06 22:15:31,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:15:31,433 INFO L124 PetriNetUnfolderBase]: 458/721 cut-off events. [2023-11-06 22:15:31,433 INFO L125 PetriNetUnfolderBase]: For 902/903 co-relation queries the response was YES. [2023-11-06 22:15:31,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2501 conditions, 721 events. 458/721 cut-off events. For 902/903 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2902 event pairs, 177 based on Foata normal form. 9/725 useless extension candidates. Maximal degree in co-relation 2483. Up to 439 conditions per place. [2023-11-06 22:15:31,444 INFO L140 encePairwiseOnDemand]: 207/210 looper letters, 28 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2023-11-06 22:15:31,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 32 transitions, 217 flow [2023-11-06 22:15:31,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:15:31,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:15:31,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 313 transitions. [2023-11-06 22:15:31,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49682539682539684 [2023-11-06 22:15:31,447 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 313 transitions. [2023-11-06 22:15:31,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 313 transitions. [2023-11-06 22:15:31,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:15:31,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 313 transitions. [2023-11-06 22:15:31,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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-06 22:15:31,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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-06 22:15:31,453 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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-06 22:15:31,453 INFO L175 Difference]: Start difference. First operand has 41 places, 24 transitions, 123 flow. Second operand 3 states and 313 transitions. [2023-11-06 22:15:31,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 32 transitions, 217 flow [2023-11-06 22:15:31,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 32 transitions, 191 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-11-06 22:15:31,459 INFO L231 Difference]: Finished difference. Result has 37 places, 24 transitions, 109 flow [2023-11-06 22:15:31,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2023-11-06 22:15:31,460 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places. [2023-11-06 22:15:31,461 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 109 flow [2023-11-06 22:15:31,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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-06 22:15:31,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:15:31,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:15:31,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:15:31,462 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:15:31,463 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:15:31,463 INFO L85 PathProgramCache]: Analyzing trace with hash -620103767, now seen corresponding path program 1 times [2023-11-06 22:15:31,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:15:31,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706895596] [2023-11-06 22:15:31,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:31,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:15:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:32,947 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-06 22:15:32,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:15:32,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706895596] [2023-11-06 22:15:32,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706895596] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:15:32,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:15:32,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:15:32,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490642713] [2023-11-06 22:15:32,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:15:32,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:15:32,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:15:32,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:15:32,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:15:33,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 210 [2023-11-06 22:15:33,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 109 flow. Second operand has 7 states, 7 states have (on average 90.85714285714286) internal successors, (636), 7 states have internal predecessors, (636), 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-06 22:15:33,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:15:33,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 210 [2023-11-06 22:15:33,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:15:33,455 INFO L124 PetriNetUnfolderBase]: 618/957 cut-off events. [2023-11-06 22:15:33,455 INFO L125 PetriNetUnfolderBase]: For 781/781 co-relation queries the response was YES. [2023-11-06 22:15:33,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3113 conditions, 957 events. 618/957 cut-off events. For 781/781 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3660 event pairs, 233 based on Foata normal form. 1/958 useless extension candidates. Maximal degree in co-relation 3097. Up to 886 conditions per place. [2023-11-06 22:15:33,467 INFO L140 encePairwiseOnDemand]: 201/210 looper letters, 37 selfloop transitions, 17 changer transitions 0/55 dead transitions. [2023-11-06 22:15:33,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 55 transitions, 338 flow [2023-11-06 22:15:33,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:15:33,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:15:33,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 587 transitions. [2023-11-06 22:15:33,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4658730158730159 [2023-11-06 22:15:33,473 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 587 transitions. [2023-11-06 22:15:33,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 587 transitions. [2023-11-06 22:15:33,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:15:33,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 587 transitions. [2023-11-06 22:15:33,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 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-06 22:15:33,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 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-06 22:15:33,481 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 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-06 22:15:33,482 INFO L175 Difference]: Start difference. First operand has 37 places, 24 transitions, 109 flow. Second operand 6 states and 587 transitions. [2023-11-06 22:15:33,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 55 transitions, 338 flow [2023-11-06 22:15:33,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 55 transitions, 325 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-11-06 22:15:33,487 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 224 flow [2023-11-06 22:15:33,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=224, PETRI_PLACES=41, PETRI_TRANSITIONS=38} [2023-11-06 22:15:33,489 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places. [2023-11-06 22:15:33,489 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 38 transitions, 224 flow [2023-11-06 22:15:33,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.85714285714286) internal successors, (636), 7 states have internal predecessors, (636), 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-06 22:15:33,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:15:33,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:15:33,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:15:33,491 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:15:33,491 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:15:33,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1549955827, now seen corresponding path program 2 times [2023-11-06 22:15:33,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:15:33,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064139647] [2023-11-06 22:15:33,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:33,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:15:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:34,038 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-06 22:15:34,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:15:34,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064139647] [2023-11-06 22:15:34,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064139647] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:15:34,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:15:34,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:15:34,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744322487] [2023-11-06 22:15:34,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:15:34,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:15:34,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:15:34,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:15:34,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:15:34,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 210 [2023-11-06 22:15:34,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 224 flow. Second operand has 5 states, 5 states have (on average 94.6) internal successors, (473), 5 states have internal predecessors, (473), 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-06 22:15:34,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:15:34,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 210 [2023-11-06 22:15:34,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:15:34,601 INFO L124 PetriNetUnfolderBase]: 937/1451 cut-off events. [2023-11-06 22:15:34,602 INFO L125 PetriNetUnfolderBase]: For 1950/1950 co-relation queries the response was YES. [2023-11-06 22:15:34,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5211 conditions, 1451 events. 937/1451 cut-off events. For 1950/1950 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6324 event pairs, 259 based on Foata normal form. 36/1487 useless extension candidates. Maximal degree in co-relation 5194. Up to 718 conditions per place. [2023-11-06 22:15:34,615 INFO L140 encePairwiseOnDemand]: 203/210 looper letters, 49 selfloop transitions, 10 changer transitions 11/71 dead transitions. [2023-11-06 22:15:34,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 71 transitions, 529 flow [2023-11-06 22:15:34,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:15:34,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:15:34,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 511 transitions. [2023-11-06 22:15:34,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4866666666666667 [2023-11-06 22:15:34,619 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 511 transitions. [2023-11-06 22:15:34,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 511 transitions. [2023-11-06 22:15:34,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:15:34,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 511 transitions. [2023-11-06 22:15:34,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.2) internal successors, (511), 5 states have internal predecessors, (511), 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-06 22:15:34,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 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-06 22:15:34,625 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 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-06 22:15:34,626 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 224 flow. Second operand 5 states and 511 transitions. [2023-11-06 22:15:34,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 71 transitions, 529 flow [2023-11-06 22:15:34,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 71 transitions, 505 flow, removed 12 selfloop flow, removed 0 redundant places. [2023-11-06 22:15:34,635 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 267 flow [2023-11-06 22:15:34,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=267, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2023-11-06 22:15:34,637 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 14 predicate places. [2023-11-06 22:15:34,638 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 267 flow [2023-11-06 22:15:34,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.6) internal successors, (473), 5 states have internal predecessors, (473), 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-06 22:15:34,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:15:34,638 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:15:34,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:15:34,639 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:15:34,639 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:15:34,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1467554169, now seen corresponding path program 3 times [2023-11-06 22:15:34,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:15:34,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749817299] [2023-11-06 22:15:34,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:34,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:15:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:35,723 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-06 22:15:35,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:15:35,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749817299] [2023-11-06 22:15:35,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749817299] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:15:35,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:15:35,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:15:35,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050238242] [2023-11-06 22:15:35,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:15:35,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:15:35,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:15:35,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:15:35,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:15:35,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 210 [2023-11-06 22:15:35,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 267 flow. Second operand has 5 states, 5 states have (on average 89.6) internal successors, (448), 5 states have internal predecessors, (448), 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-06 22:15:35,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:15:35,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 210 [2023-11-06 22:15:35,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:15:36,449 INFO L124 PetriNetUnfolderBase]: 919/1431 cut-off events. [2023-11-06 22:15:36,449 INFO L125 PetriNetUnfolderBase]: For 2766/2766 co-relation queries the response was YES. [2023-11-06 22:15:36,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5377 conditions, 1431 events. 919/1431 cut-off events. For 2766/2766 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6193 event pairs, 298 based on Foata normal form. 36/1467 useless extension candidates. Maximal degree in co-relation 5356. Up to 722 conditions per place. [2023-11-06 22:15:36,465 INFO L140 encePairwiseOnDemand]: 203/210 looper letters, 47 selfloop transitions, 11 changer transitions 7/66 dead transitions. [2023-11-06 22:15:36,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 66 transitions, 530 flow [2023-11-06 22:15:36,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:15:36,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:15:36,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 481 transitions. [2023-11-06 22:15:36,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4580952380952381 [2023-11-06 22:15:36,470 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 481 transitions. [2023-11-06 22:15:36,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 481 transitions. [2023-11-06 22:15:36,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:15:36,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 481 transitions. [2023-11-06 22:15:36,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.2) internal successors, (481), 5 states have internal predecessors, (481), 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-06 22:15:36,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 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-06 22:15:36,477 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 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-06 22:15:36,478 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 267 flow. Second operand 5 states and 481 transitions. [2023-11-06 22:15:36,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 66 transitions, 530 flow [2023-11-06 22:15:36,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 66 transitions, 504 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-11-06 22:15:36,488 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 321 flow [2023-11-06 22:15:36,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=321, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2023-11-06 22:15:36,489 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 17 predicate places. [2023-11-06 22:15:36,490 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 321 flow [2023-11-06 22:15:36,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.6) internal successors, (448), 5 states have internal predecessors, (448), 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-06 22:15:36,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:15:36,491 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:15:36,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:15:36,491 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:15:36,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:15:36,492 INFO L85 PathProgramCache]: Analyzing trace with hash -342589899, now seen corresponding path program 4 times [2023-11-06 22:15:36,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:15:36,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555114446] [2023-11-06 22:15:36,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:36,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:15:36,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:37,321 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-06 22:15:37,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:15:37,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555114446] [2023-11-06 22:15:37,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555114446] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:15:37,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:15:37,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:15:37,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639328353] [2023-11-06 22:15:37,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:15:37,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:15:37,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:15:37,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:15:37,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:15:37,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 210 [2023-11-06 22:15:37,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 321 flow. Second operand has 5 states, 5 states have (on average 94.6) internal successors, (473), 5 states have internal predecessors, (473), 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-06 22:15:37,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:15:37,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 210 [2023-11-06 22:15:37,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:15:37,975 INFO L124 PetriNetUnfolderBase]: 828/1284 cut-off events. [2023-11-06 22:15:37,975 INFO L125 PetriNetUnfolderBase]: For 3657/3657 co-relation queries the response was YES. [2023-11-06 22:15:37,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5260 conditions, 1284 events. 828/1284 cut-off events. For 3657/3657 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5467 event pairs, 186 based on Foata normal form. 18/1302 useless extension candidates. Maximal degree in co-relation 5238. Up to 913 conditions per place. [2023-11-06 22:15:37,995 INFO L140 encePairwiseOnDemand]: 201/210 looper letters, 45 selfloop transitions, 23 changer transitions 1/70 dead transitions. [2023-11-06 22:15:37,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 70 transitions, 592 flow [2023-11-06 22:15:37,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:15:37,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:15:38,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 601 transitions. [2023-11-06 22:15:38,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.476984126984127 [2023-11-06 22:15:38,001 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 601 transitions. [2023-11-06 22:15:38,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 601 transitions. [2023-11-06 22:15:38,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:15:38,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 601 transitions. [2023-11-06 22:15:38,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 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-06 22:15:38,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 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-06 22:15:38,012 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 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-06 22:15:38,012 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 321 flow. Second operand 6 states and 601 transitions. [2023-11-06 22:15:38,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 70 transitions, 592 flow [2023-11-06 22:15:38,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 70 transitions, 570 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-11-06 22:15:38,026 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 476 flow [2023-11-06 22:15:38,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=476, PETRI_PLACES=55, PETRI_TRANSITIONS=53} [2023-11-06 22:15:38,027 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 22 predicate places. [2023-11-06 22:15:38,028 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 476 flow [2023-11-06 22:15:38,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.6) internal successors, (473), 5 states have internal predecessors, (473), 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-06 22:15:38,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:15:38,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:15:38,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:15:38,029 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:15:38,030 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:15:38,030 INFO L85 PathProgramCache]: Analyzing trace with hash 815117811, now seen corresponding path program 5 times [2023-11-06 22:15:38,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:15:38,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234450899] [2023-11-06 22:15:38,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:38,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:15:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:38,912 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-06 22:15:38,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:15:38,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234450899] [2023-11-06 22:15:38,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234450899] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:15:38,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:15:38,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:15:38,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813450337] [2023-11-06 22:15:38,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:15:38,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:15:38,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:15:38,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:15:38,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:15:38,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 210 [2023-11-06 22:15:38,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 476 flow. Second operand has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 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-06 22:15:38,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:15:38,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 210 [2023-11-06 22:15:38,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:15:39,538 INFO L124 PetriNetUnfolderBase]: 891/1406 cut-off events. [2023-11-06 22:15:39,538 INFO L125 PetriNetUnfolderBase]: For 5059/5059 co-relation queries the response was YES. [2023-11-06 22:15:39,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6540 conditions, 1406 events. 891/1406 cut-off events. For 5059/5059 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6213 event pairs, 120 based on Foata normal form. 35/1441 useless extension candidates. Maximal degree in co-relation 6516. Up to 937 conditions per place. [2023-11-06 22:15:39,557 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 56 selfloop transitions, 13 changer transitions 9/79 dead transitions. [2023-11-06 22:15:39,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 79 transitions, 801 flow [2023-11-06 22:15:39,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:15:39,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:15:39,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 482 transitions. [2023-11-06 22:15:39,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45904761904761904 [2023-11-06 22:15:39,562 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 482 transitions. [2023-11-06 22:15:39,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 482 transitions. [2023-11-06 22:15:39,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:15:39,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 482 transitions. [2023-11-06 22:15:39,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.4) internal successors, (482), 5 states have internal predecessors, (482), 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-06 22:15:39,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 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-06 22:15:39,569 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 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-06 22:15:39,569 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 476 flow. Second operand 5 states and 482 transitions. [2023-11-06 22:15:39,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 79 transitions, 801 flow [2023-11-06 22:15:39,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 79 transitions, 796 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-06 22:15:39,585 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 519 flow [2023-11-06 22:15:39,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=519, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2023-11-06 22:15:39,586 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 27 predicate places. [2023-11-06 22:15:39,587 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 519 flow [2023-11-06 22:15:39,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 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-06 22:15:39,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:15:39,588 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:15:39,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:15:39,588 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:15:39,589 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:15:39,589 INFO L85 PathProgramCache]: Analyzing trace with hash -48513887, now seen corresponding path program 6 times [2023-11-06 22:15:39,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:15:39,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461529802] [2023-11-06 22:15:39,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:39,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:15:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:40,149 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-06 22:15:40,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:15:40,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461529802] [2023-11-06 22:15:40,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461529802] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:15:40,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:15:40,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:15:40,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355814200] [2023-11-06 22:15:40,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:15:40,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:15:40,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:15:40,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:15:40,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:15:40,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 210 [2023-11-06 22:15:40,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 519 flow. Second operand has 5 states, 5 states have (on average 95.6) internal successors, (478), 5 states have internal predecessors, (478), 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-06 22:15:40,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:15:40,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 210 [2023-11-06 22:15:40,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:15:40,780 INFO L124 PetriNetUnfolderBase]: 1125/1757 cut-off events. [2023-11-06 22:15:40,780 INFO L125 PetriNetUnfolderBase]: For 7025/7025 co-relation queries the response was YES. [2023-11-06 22:15:40,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8299 conditions, 1757 events. 1125/1757 cut-off events. For 7025/7025 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8117 event pairs, 320 based on Foata normal form. 35/1792 useless extension candidates. Maximal degree in co-relation 8272. Up to 962 conditions per place. [2023-11-06 22:15:40,797 INFO L140 encePairwiseOnDemand]: 206/210 looper letters, 49 selfloop transitions, 6 changer transitions 19/75 dead transitions. [2023-11-06 22:15:40,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 75 transitions, 807 flow [2023-11-06 22:15:40,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:15:40,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:15:40,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 414 transitions. [2023-11-06 22:15:40,800 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4928571428571429 [2023-11-06 22:15:40,801 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 414 transitions. [2023-11-06 22:15:40,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 414 transitions. [2023-11-06 22:15:40,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:15:40,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 414 transitions. [2023-11-06 22:15:40,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 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-06 22:15:40,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 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-06 22:15:40,807 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 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-06 22:15:40,807 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 519 flow. Second operand 4 states and 414 transitions. [2023-11-06 22:15:40,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 75 transitions, 807 flow [2023-11-06 22:15:40,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 75 transitions, 769 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-06 22:15:40,824 INFO L231 Difference]: Finished difference. Result has 60 places, 41 transitions, 355 flow [2023-11-06 22:15:40,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=355, PETRI_PLACES=60, PETRI_TRANSITIONS=41} [2023-11-06 22:15:40,826 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 27 predicate places. [2023-11-06 22:15:40,826 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 41 transitions, 355 flow [2023-11-06 22:15:40,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.6) internal successors, (478), 5 states have internal predecessors, (478), 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-06 22:15:40,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:15:40,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:15:40,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:15:40,827 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:15:40,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:15:40,828 INFO L85 PathProgramCache]: Analyzing trace with hash 841178400, now seen corresponding path program 1 times [2023-11-06 22:15:40,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:15:40,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494744074] [2023-11-06 22:15:40,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:40,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:15:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:41,530 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-06 22:15:41,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:15:41,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494744074] [2023-11-06 22:15:41,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494744074] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:15:41,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:15:41,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:15:41,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059236731] [2023-11-06 22:15:41,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:15:41,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:15:41,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:15:41,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:15:41,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:15:41,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 210 [2023-11-06 22:15:41,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 41 transitions, 355 flow. Second operand has 6 states, 6 states have (on average 95.33333333333333) internal successors, (572), 6 states have internal predecessors, (572), 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-06 22:15:41,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:15:41,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 210 [2023-11-06 22:15:41,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:15:42,101 INFO L124 PetriNetUnfolderBase]: 831/1326 cut-off events. [2023-11-06 22:15:42,101 INFO L125 PetriNetUnfolderBase]: For 5109/5109 co-relation queries the response was YES. [2023-11-06 22:15:42,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6120 conditions, 1326 events. 831/1326 cut-off events. For 5109/5109 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5889 event pairs, 116 based on Foata normal form. 34/1360 useless extension candidates. Maximal degree in co-relation 6093. Up to 631 conditions per place. [2023-11-06 22:15:42,113 INFO L140 encePairwiseOnDemand]: 203/210 looper letters, 57 selfloop transitions, 13 changer transitions 14/85 dead transitions. [2023-11-06 22:15:42,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 85 transitions, 818 flow [2023-11-06 22:15:42,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:15:42,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:15:42,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 615 transitions. [2023-11-06 22:15:42,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2023-11-06 22:15:42,118 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 615 transitions. [2023-11-06 22:15:42,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 615 transitions. [2023-11-06 22:15:42,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:15:42,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 615 transitions. [2023-11-06 22:15:42,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 102.5) internal successors, (615), 6 states have internal predecessors, (615), 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-06 22:15:42,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 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-06 22:15:42,125 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 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-06 22:15:42,125 INFO L175 Difference]: Start difference. First operand has 60 places, 41 transitions, 355 flow. Second operand 6 states and 615 transitions. [2023-11-06 22:15:42,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 85 transitions, 818 flow [2023-11-06 22:15:42,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 85 transitions, 738 flow, removed 21 selfloop flow, removed 9 redundant places. [2023-11-06 22:15:42,148 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 388 flow [2023-11-06 22:15:42,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=388, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2023-11-06 22:15:42,150 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 23 predicate places. [2023-11-06 22:15:42,150 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 388 flow [2023-11-06 22:15:42,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.33333333333333) internal successors, (572), 6 states have internal predecessors, (572), 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-06 22:15:42,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:15:42,151 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:15:42,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:15:42,152 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:15:42,152 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:15:42,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1513576818, now seen corresponding path program 2 times [2023-11-06 22:15:42,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:15:42,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006888236] [2023-11-06 22:15:42,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:42,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:15:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:43,615 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-06 22:15:43,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:15:43,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006888236] [2023-11-06 22:15:43,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006888236] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:15:43,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:15:43,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:15:43,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559463895] [2023-11-06 22:15:43,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:15:43,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:15:43,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:15:43,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:15:43,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:15:43,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 210 [2023-11-06 22:15:43,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 388 flow. Second operand has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 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-06 22:15:43,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:15:43,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 210 [2023-11-06 22:15:43,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:15:44,410 INFO L124 PetriNetUnfolderBase]: 571/937 cut-off events. [2023-11-06 22:15:44,410 INFO L125 PetriNetUnfolderBase]: For 3962/3962 co-relation queries the response was YES. [2023-11-06 22:15:44,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4303 conditions, 937 events. 571/937 cut-off events. For 3962/3962 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3900 event pairs, 75 based on Foata normal form. 34/971 useless extension candidates. Maximal degree in co-relation 4280. Up to 566 conditions per place. [2023-11-06 22:15:44,420 INFO L140 encePairwiseOnDemand]: 201/210 looper letters, 49 selfloop transitions, 15 changer transitions 7/72 dead transitions. [2023-11-06 22:15:44,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 72 transitions, 680 flow [2023-11-06 22:15:44,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:15:44,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:15:44,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 569 transitions. [2023-11-06 22:15:44,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4515873015873016 [2023-11-06 22:15:44,425 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 569 transitions. [2023-11-06 22:15:44,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 569 transitions. [2023-11-06 22:15:44,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:15:44,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 569 transitions. [2023-11-06 22:15:44,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 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-06 22:15:44,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 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-06 22:15:44,434 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 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-06 22:15:44,434 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 388 flow. Second operand 6 states and 569 transitions. [2023-11-06 22:15:44,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 72 transitions, 680 flow [2023-11-06 22:15:44,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 72 transitions, 639 flow, removed 7 selfloop flow, removed 5 redundant places. [2023-11-06 22:15:44,447 INFO L231 Difference]: Finished difference. Result has 57 places, 43 transitions, 382 flow [2023-11-06 22:15:44,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=382, PETRI_PLACES=57, PETRI_TRANSITIONS=43} [2023-11-06 22:15:44,448 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 24 predicate places. [2023-11-06 22:15:44,448 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 382 flow [2023-11-06 22:15:44,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 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-06 22:15:44,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:15:44,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:15:44,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:15:44,450 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:15:44,451 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:15:44,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1947832513, now seen corresponding path program 1 times [2023-11-06 22:15:44,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:15:44,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449525144] [2023-11-06 22:15:44,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:44,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:15:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:45,967 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-06 22:15:45,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:15:45,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449525144] [2023-11-06 22:15:45,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449525144] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:15:45,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:15:45,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:15:45,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765159311] [2023-11-06 22:15:45,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:15:45,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:15:45,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:15:45,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:15:45,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:15:46,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 210 [2023-11-06 22:15:46,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 43 transitions, 382 flow. Second operand has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 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-06 22:15:46,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:15:46,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 210 [2023-11-06 22:15:46,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:15:46,781 INFO L124 PetriNetUnfolderBase]: 564/929 cut-off events. [2023-11-06 22:15:46,782 INFO L125 PetriNetUnfolderBase]: For 3604/3604 co-relation queries the response was YES. [2023-11-06 22:15:46,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4341 conditions, 929 events. 564/929 cut-off events. For 3604/3604 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3834 event pairs, 44 based on Foata normal form. 20/949 useless extension candidates. Maximal degree in co-relation 4318. Up to 593 conditions per place. [2023-11-06 22:15:46,793 INFO L140 encePairwiseOnDemand]: 203/210 looper letters, 56 selfloop transitions, 13 changer transitions 10/80 dead transitions. [2023-11-06 22:15:46,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 80 transitions, 764 flow [2023-11-06 22:15:46,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:15:46,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:15:46,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 691 transitions. [2023-11-06 22:15:46,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47006802721088436 [2023-11-06 22:15:46,799 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 691 transitions. [2023-11-06 22:15:46,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 691 transitions. [2023-11-06 22:15:46,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:15:46,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 691 transitions. [2023-11-06 22:15:46,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.71428571428571) internal successors, (691), 7 states have internal predecessors, (691), 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-06 22:15:46,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 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-06 22:15:46,810 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 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-06 22:15:46,810 INFO L175 Difference]: Start difference. First operand has 57 places, 43 transitions, 382 flow. Second operand 7 states and 691 transitions. [2023-11-06 22:15:46,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 80 transitions, 764 flow [2023-11-06 22:15:46,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 80 transitions, 728 flow, removed 12 selfloop flow, removed 4 redundant places. [2023-11-06 22:15:46,829 INFO L231 Difference]: Finished difference. Result has 60 places, 44 transitions, 412 flow [2023-11-06 22:15:46,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=412, PETRI_PLACES=60, PETRI_TRANSITIONS=44} [2023-11-06 22:15:46,832 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 27 predicate places. [2023-11-06 22:15:46,832 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 44 transitions, 412 flow [2023-11-06 22:15:46,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 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-06 22:15:46,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:15:46,834 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:15:46,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:15:46,834 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:15:46,835 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:15:46,835 INFO L85 PathProgramCache]: Analyzing trace with hash 2119607419, now seen corresponding path program 1 times [2023-11-06 22:15:46,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:15:46,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155322048] [2023-11-06 22:15:46,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:46,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:15:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:48,710 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-06 22:15:48,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:15:48,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155322048] [2023-11-06 22:15:48,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155322048] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:15:48,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:15:48,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:15:48,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546598901] [2023-11-06 22:15:48,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:15:48,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:15:48,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:15:48,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:15:48,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:15:48,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 210 [2023-11-06 22:15:48,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 44 transitions, 412 flow. Second operand has 8 states, 8 states have (on average 91.875) internal successors, (735), 8 states have internal predecessors, (735), 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-06 22:15:48,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:15:48,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 210 [2023-11-06 22:15:48,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:15:49,795 INFO L124 PetriNetUnfolderBase]: 884/1436 cut-off events. [2023-11-06 22:15:49,796 INFO L125 PetriNetUnfolderBase]: For 5534/5534 co-relation queries the response was YES. [2023-11-06 22:15:49,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6442 conditions, 1436 events. 884/1436 cut-off events. For 5534/5534 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6666 event pairs, 43 based on Foata normal form. 22/1458 useless extension candidates. Maximal degree in co-relation 6418. Up to 715 conditions per place. [2023-11-06 22:15:49,810 INFO L140 encePairwiseOnDemand]: 200/210 looper letters, 77 selfloop transitions, 56 changer transitions 3/137 dead transitions. [2023-11-06 22:15:49,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 137 transitions, 1376 flow [2023-11-06 22:15:49,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:15:49,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-06 22:15:49,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1101 transitions. [2023-11-06 22:15:49,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4766233766233766 [2023-11-06 22:15:49,816 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1101 transitions. [2023-11-06 22:15:49,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1101 transitions. [2023-11-06 22:15:49,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:15:49,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1101 transitions. [2023-11-06 22:15:49,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 100.0909090909091) internal successors, (1101), 11 states have internal predecessors, (1101), 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-06 22:15:49,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 210.0) internal successors, (2520), 12 states have internal predecessors, (2520), 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-06 22:15:49,832 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 210.0) internal successors, (2520), 12 states have internal predecessors, (2520), 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-06 22:15:49,832 INFO L175 Difference]: Start difference. First operand has 60 places, 44 transitions, 412 flow. Second operand 11 states and 1101 transitions. [2023-11-06 22:15:49,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 137 transitions, 1376 flow [2023-11-06 22:15:49,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 137 transitions, 1318 flow, removed 3 selfloop flow, removed 7 redundant places. [2023-11-06 22:15:49,853 INFO L231 Difference]: Finished difference. Result has 69 places, 85 transitions, 1057 flow [2023-11-06 22:15:49,853 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1057, PETRI_PLACES=69, PETRI_TRANSITIONS=85} [2023-11-06 22:15:49,854 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 36 predicate places. [2023-11-06 22:15:49,856 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 85 transitions, 1057 flow [2023-11-06 22:15:49,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.875) internal successors, (735), 8 states have internal predecessors, (735), 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-06 22:15:49,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:15:49,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:15:49,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:15:49,858 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:15:49,859 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:15:49,859 INFO L85 PathProgramCache]: Analyzing trace with hash 2084751732, now seen corresponding path program 1 times [2023-11-06 22:15:49,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:15:49,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12315612] [2023-11-06 22:15:49,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:49,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:15:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:50,950 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-06 22:15:50,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:15:50,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12315612] [2023-11-06 22:15:50,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12315612] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:15:50,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:15:50,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:15:50,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393549337] [2023-11-06 22:15:50,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:15:50,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:15:50,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:15:50,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:15:50,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:15:51,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 210 [2023-11-06 22:15:51,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 85 transitions, 1057 flow. Second operand has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 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-06 22:15:51,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:15:51,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 210 [2023-11-06 22:15:51,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:15:51,579 INFO L124 PetriNetUnfolderBase]: 918/1518 cut-off events. [2023-11-06 22:15:51,580 INFO L125 PetriNetUnfolderBase]: For 9227/9227 co-relation queries the response was YES. [2023-11-06 22:15:51,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8008 conditions, 1518 events. 918/1518 cut-off events. For 9227/9227 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 7343 event pairs, 189 based on Foata normal form. 20/1538 useless extension candidates. Maximal degree in co-relation 7979. Up to 1094 conditions per place. [2023-11-06 22:15:51,595 INFO L140 encePairwiseOnDemand]: 202/210 looper letters, 66 selfloop transitions, 41 changer transitions 3/111 dead transitions. [2023-11-06 22:15:51,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 111 transitions, 1483 flow [2023-11-06 22:15:51,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:15:51,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:15:51,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 498 transitions. [2023-11-06 22:15:51,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742857142857143 [2023-11-06 22:15:51,598 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 498 transitions. [2023-11-06 22:15:51,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 498 transitions. [2023-11-06 22:15:51,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:15:51,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 498 transitions. [2023-11-06 22:15:51,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.6) internal successors, (498), 5 states have internal predecessors, (498), 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-06 22:15:51,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 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-06 22:15:51,606 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 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-06 22:15:51,606 INFO L175 Difference]: Start difference. First operand has 69 places, 85 transitions, 1057 flow. Second operand 5 states and 498 transitions. [2023-11-06 22:15:51,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 111 transitions, 1483 flow [2023-11-06 22:15:51,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 111 transitions, 1364 flow, removed 57 selfloop flow, removed 2 redundant places. [2023-11-06 22:15:51,656 INFO L231 Difference]: Finished difference. Result has 73 places, 91 transitions, 1207 flow [2023-11-06 22:15:51,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=960, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1207, PETRI_PLACES=73, PETRI_TRANSITIONS=91} [2023-11-06 22:15:51,657 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 40 predicate places. [2023-11-06 22:15:51,657 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 91 transitions, 1207 flow [2023-11-06 22:15:51,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 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-06 22:15:51,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:15:51,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:15:51,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:15:51,659 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:15:51,659 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:15:51,659 INFO L85 PathProgramCache]: Analyzing trace with hash 2082328865, now seen corresponding path program 1 times [2023-11-06 22:15:51,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:15:51,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390892200] [2023-11-06 22:15:51,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:51,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:15:51,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:51,927 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-06 22:15:51,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:15:51,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390892200] [2023-11-06 22:15:51,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390892200] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:15:51,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:15:51,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:15:51,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583823169] [2023-11-06 22:15:51,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:15:51,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:15:51,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:15:51,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:15:51,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:15:51,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 210 [2023-11-06 22:15:51,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 91 transitions, 1207 flow. Second operand has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 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-06 22:15:51,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:15:51,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 210 [2023-11-06 22:15:51,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:15:52,363 INFO L124 PetriNetUnfolderBase]: 674/1187 cut-off events. [2023-11-06 22:15:52,364 INFO L125 PetriNetUnfolderBase]: For 14637/14659 co-relation queries the response was YES. [2023-11-06 22:15:52,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6311 conditions, 1187 events. 674/1187 cut-off events. For 14637/14659 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 6243 event pairs, 102 based on Foata normal form. 145/1328 useless extension candidates. Maximal degree in co-relation 6279. Up to 790 conditions per place. [2023-11-06 22:15:52,375 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 96 selfloop transitions, 4 changer transitions 80/184 dead transitions. [2023-11-06 22:15:52,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 184 transitions, 2678 flow [2023-11-06 22:15:52,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:15:52,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:15:52,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 504 transitions. [2023-11-06 22:15:52,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48 [2023-11-06 22:15:52,379 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 504 transitions. [2023-11-06 22:15:52,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 504 transitions. [2023-11-06 22:15:52,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:15:52,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 504 transitions. [2023-11-06 22:15:52,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.8) internal successors, (504), 5 states have internal predecessors, (504), 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-06 22:15:52,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 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-06 22:15:52,386 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 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-06 22:15:52,387 INFO L175 Difference]: Start difference. First operand has 73 places, 91 transitions, 1207 flow. Second operand 5 states and 504 transitions. [2023-11-06 22:15:52,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 184 transitions, 2678 flow [2023-11-06 22:15:52,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 184 transitions, 2153 flow, removed 79 selfloop flow, removed 15 redundant places. [2023-11-06 22:15:52,419 INFO L231 Difference]: Finished difference. Result has 63 places, 71 transitions, 700 flow [2023-11-06 22:15:52,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=700, PETRI_PLACES=63, PETRI_TRANSITIONS=71} [2023-11-06 22:15:52,420 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 30 predicate places. [2023-11-06 22:15:52,420 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 71 transitions, 700 flow [2023-11-06 22:15:52,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 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-06 22:15:52,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:15:52,421 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:15:52,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 22:15:52,421 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:15:52,422 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:15:52,422 INFO L85 PathProgramCache]: Analyzing trace with hash 739648066, now seen corresponding path program 1 times [2023-11-06 22:15:52,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:15:52,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397177344] [2023-11-06 22:15:52,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:52,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:15:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:52,632 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-06 22:15:52,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:15:52,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397177344] [2023-11-06 22:15:52,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397177344] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:15:52,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:15:52,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:15:52,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595446541] [2023-11-06 22:15:52,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:15:52,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:15:52,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:15:52,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:15:52,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:15:52,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 210 [2023-11-06 22:15:52,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 71 transitions, 700 flow. Second operand has 5 states, 5 states have (on average 93.0) internal successors, (465), 5 states have internal predecessors, (465), 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-06 22:15:52,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:15:52,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 210 [2023-11-06 22:15:52,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:15:52,961 INFO L124 PetriNetUnfolderBase]: 348/674 cut-off events. [2023-11-06 22:15:52,961 INFO L125 PetriNetUnfolderBase]: For 6640/6651 co-relation queries the response was YES. [2023-11-06 22:15:52,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3575 conditions, 674 events. 348/674 cut-off events. For 6640/6651 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3304 event pairs, 31 based on Foata normal form. 94/764 useless extension candidates. Maximal degree in co-relation 3548. Up to 309 conditions per place. [2023-11-06 22:15:52,966 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 98 selfloop transitions, 7 changer transitions 60/168 dead transitions. [2023-11-06 22:15:52,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 168 transitions, 2014 flow [2023-11-06 22:15:52,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:15:52,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:15:52,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 602 transitions. [2023-11-06 22:15:52,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2023-11-06 22:15:52,970 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 602 transitions. [2023-11-06 22:15:52,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 602 transitions. [2023-11-06 22:15:52,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:15:52,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 602 transitions. [2023-11-06 22:15:52,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.33333333333333) internal successors, (602), 6 states have internal predecessors, (602), 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-06 22:15:52,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 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-06 22:15:52,977 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 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-06 22:15:52,978 INFO L175 Difference]: Start difference. First operand has 63 places, 71 transitions, 700 flow. Second operand 6 states and 602 transitions. [2023-11-06 22:15:52,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 168 transitions, 2014 flow [2023-11-06 22:15:52,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 168 transitions, 1823 flow, removed 89 selfloop flow, removed 4 redundant places. [2023-11-06 22:15:52,995 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 535 flow [2023-11-06 22:15:52,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=535, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2023-11-06 22:15:52,996 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 32 predicate places. [2023-11-06 22:15:52,996 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 535 flow [2023-11-06 22:15:52,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.0) internal successors, (465), 5 states have internal predecessors, (465), 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-06 22:15:52,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:15:52,997 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-06 22:15:52,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 22:15:52,998 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:15:52,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:15:52,998 INFO L85 PathProgramCache]: Analyzing trace with hash -650759909, now seen corresponding path program 1 times [2023-11-06 22:15:52,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:15:52,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258820373] [2023-11-06 22:15:52,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:52,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:15:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:55,075 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-06 22:15:55,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:15:55,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258820373] [2023-11-06 22:15:55,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258820373] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:15:55,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:15:55,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:15:55,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741875906] [2023-11-06 22:15:55,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:15:55,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:15:55,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:15:55,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:15:55,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:15:55,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 210 [2023-11-06 22:15:55,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 535 flow. Second operand has 9 states, 9 states have (on average 87.0) internal successors, (783), 9 states have internal predecessors, (783), 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-06 22:15:55,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:15:55,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 210 [2023-11-06 22:15:55,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:15:55,915 INFO L124 PetriNetUnfolderBase]: 300/625 cut-off events. [2023-11-06 22:15:55,915 INFO L125 PetriNetUnfolderBase]: For 3753/3753 co-relation queries the response was YES. [2023-11-06 22:15:55,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3578 conditions, 625 events. 300/625 cut-off events. For 3753/3753 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2955 event pairs, 63 based on Foata normal form. 9/634 useless extension candidates. Maximal degree in co-relation 3549. Up to 277 conditions per place. [2023-11-06 22:15:55,918 INFO L140 encePairwiseOnDemand]: 200/210 looper letters, 61 selfloop transitions, 7 changer transitions 50/119 dead transitions. [2023-11-06 22:15:55,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 119 transitions, 1275 flow [2023-11-06 22:15:55,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:15:55,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:15:55,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 753 transitions. [2023-11-06 22:15:55,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44821428571428573 [2023-11-06 22:15:55,925 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 753 transitions. [2023-11-06 22:15:55,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 753 transitions. [2023-11-06 22:15:55,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:15:55,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 753 transitions. [2023-11-06 22:15:55,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 94.125) internal successors, (753), 8 states have internal predecessors, (753), 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-06 22:15:55,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 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-06 22:15:55,933 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 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-06 22:15:55,933 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 535 flow. Second operand 8 states and 753 transitions. [2023-11-06 22:15:55,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 119 transitions, 1275 flow [2023-11-06 22:15:55,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 119 transitions, 1153 flow, removed 47 selfloop flow, removed 5 redundant places. [2023-11-06 22:15:55,952 INFO L231 Difference]: Finished difference. Result has 69 places, 48 transitions, 403 flow [2023-11-06 22:15:55,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=403, PETRI_PLACES=69, PETRI_TRANSITIONS=48} [2023-11-06 22:15:55,953 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 36 predicate places. [2023-11-06 22:15:55,953 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 48 transitions, 403 flow [2023-11-06 22:15:55,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 87.0) internal successors, (783), 9 states have internal predecessors, (783), 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-06 22:15:55,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:15:55,954 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-06 22:15:55,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-06 22:15:55,954 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:15:55,955 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:15:55,955 INFO L85 PathProgramCache]: Analyzing trace with hash -2441472, now seen corresponding path program 1 times [2023-11-06 22:15:55,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:15:55,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602372492] [2023-11-06 22:15:55,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:55,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:15:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:56,239 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-06 22:15:56,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:15:56,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602372492] [2023-11-06 22:15:56,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602372492] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:15:56,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:15:56,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:15:56,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247926605] [2023-11-06 22:15:56,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:15:56,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:15:56,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:15:56,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:15:56,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:15:56,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 210 [2023-11-06 22:15:56,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 48 transitions, 403 flow. Second operand has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 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-06 22:15:56,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:15:56,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 210 [2023-11-06 22:15:56,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:15:56,488 INFO L124 PetriNetUnfolderBase]: 132/297 cut-off events. [2023-11-06 22:15:56,489 INFO L125 PetriNetUnfolderBase]: For 1868/1870 co-relation queries the response was YES. [2023-11-06 22:15:56,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1395 conditions, 297 events. 132/297 cut-off events. For 1868/1870 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1236 event pairs, 14 based on Foata normal form. 24/319 useless extension candidates. Maximal degree in co-relation 1365. Up to 103 conditions per place. [2023-11-06 22:15:56,490 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 67 selfloop transitions, 10 changer transitions 13/92 dead transitions. [2023-11-06 22:15:56,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 92 transitions, 1009 flow [2023-11-06 22:15:56,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:15:56,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:15:56,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 680 transitions. [2023-11-06 22:15:56,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46258503401360546 [2023-11-06 22:15:56,496 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 680 transitions. [2023-11-06 22:15:56,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 680 transitions. [2023-11-06 22:15:56,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:15:56,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 680 transitions. [2023-11-06 22:15:56,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.14285714285714) internal successors, (680), 7 states have internal predecessors, (680), 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-06 22:15:56,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 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-06 22:15:56,503 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 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-06 22:15:56,503 INFO L175 Difference]: Start difference. First operand has 69 places, 48 transitions, 403 flow. Second operand 7 states and 680 transitions. [2023-11-06 22:15:56,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 92 transitions, 1009 flow [2023-11-06 22:15:56,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 92 transitions, 810 flow, removed 83 selfloop flow, removed 10 redundant places. [2023-11-06 22:15:56,512 INFO L231 Difference]: Finished difference. Result has 63 places, 47 transitions, 347 flow [2023-11-06 22:15:56,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=347, PETRI_PLACES=63, PETRI_TRANSITIONS=47} [2023-11-06 22:15:56,513 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 30 predicate places. [2023-11-06 22:15:56,513 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 47 transitions, 347 flow [2023-11-06 22:15:56,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 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-06 22:15:56,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:15:56,514 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] [2023-11-06 22:15:56,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-06 22:15:56,514 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:15:56,515 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:15:56,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1469586735, now seen corresponding path program 1 times [2023-11-06 22:15:56,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:15:56,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119257941] [2023-11-06 22:15:56,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:56,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:15:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:15:56,598 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:15:56,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:15:56,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:15:56,727 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:15:56,728 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-06 22:15:56,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-06 22:15:56,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-06 22:15:56,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-06 22:15:56,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-06 22:15:56,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-06 22:15:56,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-06 22:15:56,732 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:15:56,742 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:15:56,742 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:15:56,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:15:56 BasicIcfg [2023-11-06 22:15:56,860 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:15:56,860 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:15:56,861 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:15:56,861 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:15:56,861 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:15:15" (3/4) ... [2023-11-06 22:15:56,862 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 22:15:56,988 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083a8062-0330-4592-b8c8-eedf8a4943d0/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:15:56,988 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:15:56,989 INFO L158 Benchmark]: Toolchain (without parser) took 44127.55ms. Allocated memory was 184.5MB in the beginning and 717.2MB in the end (delta: 532.7MB). Free memory was 141.3MB in the beginning and 455.2MB in the end (delta: -314.0MB). Peak memory consumption was 221.2MB. Max. memory is 16.1GB. [2023-11-06 22:15:56,989 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 109.1MB. Free memory is still 58.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:15:56,990 INFO L158 Benchmark]: CACSL2BoogieTranslator took 767.63ms. Allocated memory is still 184.5MB. Free memory was 140.8MB in the beginning and 115.4MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-06 22:15:56,990 INFO L158 Benchmark]: Boogie Procedure Inliner took 124.96ms. Allocated memory is still 184.5MB. Free memory was 115.0MB in the beginning and 112.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:15:56,990 INFO L158 Benchmark]: Boogie Preprocessor took 105.93ms. Allocated memory is still 184.5MB. Free memory was 112.4MB in the beginning and 110.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:15:56,991 INFO L158 Benchmark]: RCFGBuilder took 1255.59ms. Allocated memory is still 184.5MB. Free memory was 110.3MB in the beginning and 109.2MB in the end (delta: 1.1MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2023-11-06 22:15:56,991 INFO L158 Benchmark]: TraceAbstraction took 41735.94ms. Allocated memory was 184.5MB in the beginning and 717.2MB in the end (delta: 532.7MB). Free memory was 108.2MB in the beginning and 465.7MB in the end (delta: -357.5MB). Peak memory consumption was 175.1MB. Max. memory is 16.1GB. [2023-11-06 22:15:56,991 INFO L158 Benchmark]: Witness Printer took 127.90ms. Allocated memory is still 717.2MB. Free memory was 465.7MB in the beginning and 455.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:15:56,993 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.27ms. Allocated memory is still 109.1MB. Free memory is still 58.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 767.63ms. Allocated memory is still 184.5MB. Free memory was 140.8MB in the beginning and 115.4MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 124.96ms. Allocated memory is still 184.5MB. Free memory was 115.0MB in the beginning and 112.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 105.93ms. Allocated memory is still 184.5MB. Free memory was 112.4MB in the beginning and 110.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1255.59ms. Allocated memory is still 184.5MB. Free memory was 110.3MB in the beginning and 109.2MB in the end (delta: 1.1MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * TraceAbstraction took 41735.94ms. Allocated memory was 184.5MB in the beginning and 717.2MB in the end (delta: 532.7MB). Free memory was 108.2MB in the beginning and 465.7MB in the end (delta: -357.5MB). Peak memory consumption was 175.1MB. Max. memory is 16.1GB. * Witness Printer took 127.90ms. Allocated memory is still 717.2MB. Free memory was 465.7MB in the beginning and 455.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.9s, 116 PlacesBefore, 33 PlacesAfterwards, 108 TransitionsBefore, 24 TransitionsAfterwards, 2096 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 99 TotalNumberOfCompositions, 5478 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2239, independent: 2077, independent conditional: 0, independent unconditional: 2077, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1137, independent: 1103, independent conditional: 0, independent unconditional: 1103, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2239, independent: 974, independent conditional: 0, independent unconditional: 974, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 1137, unknown conditional: 0, unknown unconditional: 1137] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 64, Positive conditional cache size: 0, Positive unconditional cache size: 64, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1849; [L847] FCALL, FORK 0 pthread_create(&t1849, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1849, ((void *)0), P0, ((void *)0))=-2, t1849={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] [L848] 0 pthread_t t1850; [L743] 1 y$w_buff1 = y$w_buff0 [L744] 1 y$w_buff0 = 2 [L745] 1 y$w_buff1_used = y$w_buff0_used [L746] 1 y$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L748] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L752] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L849] FCALL, FORK 0 pthread_create(&t1850, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1850, ((void *)0), P1, ((void *)0))=-1, t1849={5:0}, t1850={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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L850] 0 pthread_t t1851; [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L772] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L851] FCALL, FORK 0 pthread_create(&t1851, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1851, ((void *)0), P2, ((void *)0))=0, t1849={5:0}, t1850={6:0}, t1851={3: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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 y$flush_delayed = weak$$choice2 [L795] 3 y$mem_tmp = y [L796] 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) [L797] 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)) [L798] 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)) [L799] 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)) [L800] 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)) [L801] 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)) [L802] 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)) [L803] 3 __unbuffered_p2_EAX = y [L804] 3 y = y$flush_delayed ? y$mem_tmp : y [L805] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L808] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 3 y$flush_delayed = weak$$choice2 [L811] 3 y$mem_tmp = y [L812] 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) [L813] 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)) [L814] 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)) [L815] 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)) [L816] 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)) [L817] 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)) [L818] 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)) [L819] 3 __unbuffered_p2_EBX = y [L820] 3 y = y$flush_delayed ? y$mem_tmp : y [L821] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L758] 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) [L759] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] 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 [L761] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L762] 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_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L778] 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) [L779] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L780] 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 [L781] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L782] 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_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L824] 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) [L825] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L826] 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 [L827] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L828] 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_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L831] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 3 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 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) [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] 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 [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1849={5:0}, t1850={6:0}, t1851={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 y$flush_delayed = weak$$choice2 [L867] 0 y$mem_tmp = y [L868] 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) [L869] 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)) [L870] 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)) [L871] 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)) [L872] 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)) [L873] 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)) [L874] 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)) [L875] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L876] 0 y = y$flush_delayed ? y$mem_tmp : y [L877] 0 y$flush_delayed = (_Bool)0 [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 849]: 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: 847]: 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: 851]: 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, 138 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: 41.4s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 13.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 971 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 821 mSDsluCounter, 423 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 330 mSDsCounter, 340 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2279 IncrementalHoareTripleChecker+Invalid, 2619 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 340 mSolverCounterUnsat, 93 mSDtfsCounter, 2279 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1207occurred in iteration=17, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 19.0s InterpolantComputationTime, 311 NumberOfCodeBlocks, 311 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 269 ConstructedInterpolants, 0 QuantifiedInterpolants, 3814 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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-06 22:15:57,031 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_083a8062-0330-4592-b8c8-eedf8a4943d0/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE