./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.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_a7b5daed-17ac-488e-a401-6ae316999dc1/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7b5daed-17ac-488e-a401-6ae316999dc1/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_a7b5daed-17ac-488e-a401-6ae316999dc1/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7b5daed-17ac-488e-a401-6ae316999dc1/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7b5daed-17ac-488e-a401-6ae316999dc1/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_a7b5daed-17ac-488e-a401-6ae316999dc1/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 bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:22:40,828 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:22:40,952 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7b5daed-17ac-488e-a401-6ae316999dc1/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:22:40,957 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:22:40,958 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:22:40,984 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:22:40,986 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:22:40,986 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:22:40,988 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:22:40,988 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:22:40,989 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:22:40,990 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:22:40,991 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:22:40,992 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:22:40,993 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:22:40,994 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:22:40,994 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:22:40,995 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:22:40,996 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:22:40,997 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:22:40,997 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:22:40,999 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:22:40,999 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:22:41,000 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:22:41,001 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:22:41,002 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:22:41,003 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:22:41,003 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:22:41,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:22:41,005 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:22:41,005 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:22:41,006 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:22:41,007 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:22:41,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:22:41,008 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:22:41,008 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:22:41,009 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:22:41,010 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:22:41,010 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:22:41,011 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_a7b5daed-17ac-488e-a401-6ae316999dc1/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_a7b5daed-17ac-488e-a401-6ae316999dc1/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 -> bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 [2023-11-06 22:22:41,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:22:41,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:22:41,315 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:22:41,317 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:22:41,317 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:22:41,319 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7b5daed-17ac-488e-a401-6ae316999dc1/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2023-11-06 22:22:44,674 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:22:45,054 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:22:45,055 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7b5daed-17ac-488e-a401-6ae316999dc1/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2023-11-06 22:22:45,079 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7b5daed-17ac-488e-a401-6ae316999dc1/bin/uautomizer-verify-WvqO1wxjHP/data/fd04cbf5a/83444229b64d46b7a4e2d074d3b8b01c/FLAGcb8d577e4 [2023-11-06 22:22:45,095 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7b5daed-17ac-488e-a401-6ae316999dc1/bin/uautomizer-verify-WvqO1wxjHP/data/fd04cbf5a/83444229b64d46b7a4e2d074d3b8b01c [2023-11-06 22:22:45,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:22:45,101 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:22:45,102 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:22:45,102 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:22:45,119 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:22:45,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:22:45" (1/1) ... [2023-11-06 22:22:45,122 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@469ec7ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:45, skipping insertion in model container [2023-11-06 22:22:45,122 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:22:45" (1/1) ... [2023-11-06 22:22:45,199 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:22:45,411 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_a7b5daed-17ac-488e-a401-6ae316999dc1/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2023-11-06 22:22:45,796 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:22:45,815 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:22:45,834 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_a7b5daed-17ac-488e-a401-6ae316999dc1/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2023-11-06 22:22:45,933 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:22:45,986 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:22:45,987 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:22:45,995 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:22:45,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:45 WrapperNode [2023-11-06 22:22:45,996 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:22:45,999 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:22:46,000 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:22:46,001 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:22:46,010 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:22:45" (1/1) ... [2023-11-06 22:22:46,049 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:22:45" (1/1) ... [2023-11-06 22:22:46,115 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2023-11-06 22:22:46,117 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:22:46,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:22:46,119 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:22:46,119 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:22:46,131 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:45" (1/1) ... [2023-11-06 22:22:46,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:45" (1/1) ... [2023-11-06 22:22:46,148 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:45" (1/1) ... [2023-11-06 22:22:46,156 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:45" (1/1) ... [2023-11-06 22:22:46,166 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:45" (1/1) ... [2023-11-06 22:22:46,183 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:45" (1/1) ... [2023-11-06 22:22:46,186 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:45" (1/1) ... [2023-11-06 22:22:46,188 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:45" (1/1) ... [2023-11-06 22:22:46,204 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:22:46,206 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:22:46,206 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:22:46,206 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:22:46,207 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:45" (1/1) ... [2023-11-06 22:22:46,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:22:46,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7b5daed-17ac-488e-a401-6ae316999dc1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:22:46,253 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7b5daed-17ac-488e-a401-6ae316999dc1/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:22:46,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7b5daed-17ac-488e-a401-6ae316999dc1/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:22:46,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:22:46,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:22:46,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:22:46,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:22:46,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:22:46,315 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:22:46,316 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:22:46,316 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:22:46,316 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:22:46,316 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:22:46,318 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:22:46,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:22:46,320 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:22:46,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:22:46,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:22:46,322 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:22:46,534 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:22:46,536 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:22:46,907 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:22:47,201 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:22:47,201 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:22:47,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:22:47 BoogieIcfgContainer [2023-11-06 22:22:47,204 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:22:47,206 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:22:47,206 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:22:47,209 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:22:47,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:22:45" (1/3) ... [2023-11-06 22:22:47,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5100fb52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:22:47, skipping insertion in model container [2023-11-06 22:22:47,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:45" (2/3) ... [2023-11-06 22:22:47,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5100fb52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:22:47, skipping insertion in model container [2023-11-06 22:22:47,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:22:47" (3/3) ... [2023-11-06 22:22:47,212 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i [2023-11-06 22:22:47,221 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 22:22:47,233 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:22:47,233 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-06 22:22:47,234 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:22:47,289 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:22:47,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 230 flow [2023-11-06 22:22:47,377 INFO L124 PetriNetUnfolderBase]: 2/106 cut-off events. [2023-11-06 22:22:47,378 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:22:47,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2023-11-06 22:22:47,383 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 109 transitions, 230 flow [2023-11-06 22:22:47,388 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 106 transitions, 221 flow [2023-11-06 22:22:47,392 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:22:47,402 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 106 transitions, 221 flow [2023-11-06 22:22:47,405 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 106 transitions, 221 flow [2023-11-06 22:22:47,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 221 flow [2023-11-06 22:22:47,441 INFO L124 PetriNetUnfolderBase]: 2/106 cut-off events. [2023-11-06 22:22:47,441 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:22:47,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2023-11-06 22:22:47,446 INFO L119 LiptonReduction]: Number of co-enabled transitions 2096 [2023-11-06 22:22:52,613 INFO L134 LiptonReduction]: Checked pairs total: 5127 [2023-11-06 22:22:52,614 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-11-06 22:22:52,634 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:22:52,642 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;@14b114d0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:22:52,643 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-06 22:22:52,646 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:22:52,646 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-06 22:22:52,647 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:22:52,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:22:52,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 22:22:52,648 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:22:52,655 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:52,655 INFO L85 PathProgramCache]: Analyzing trace with hash 475712, now seen corresponding path program 1 times [2023-11-06 22:22:52,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:22:52,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291725695] [2023-11-06 22:22:52,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:52,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:22:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:53,186 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:22:53,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:22:53,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291725695] [2023-11-06 22:22:53,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291725695] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:22:53,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:22:53,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:22:53,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7842730] [2023-11-06 22:22:53,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:22:53,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:22:53,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:22:53,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:22:53,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:22:53,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 201 [2023-11-06 22:22:53,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 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:22:53,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:22:53,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 201 [2023-11-06 22:22:53,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:22:53,780 INFO L124 PetriNetUnfolderBase]: 999/1533 cut-off events. [2023-11-06 22:22:53,781 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-06 22:22:53,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3068 conditions, 1533 events. 999/1533 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7064 event pairs, 419 based on Foata normal form. 64/1465 useless extension candidates. Maximal degree in co-relation 3057. Up to 1207 conditions per place. [2023-11-06 22:22:53,806 INFO L140 encePairwiseOnDemand]: 197/201 looper letters, 31 selfloop transitions, 2 changer transitions 4/40 dead transitions. [2023-11-06 22:22:53,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 40 transitions, 169 flow [2023-11-06 22:22:53,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:22:53,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:22:53,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2023-11-06 22:22:53,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.538971807628524 [2023-11-06 22:22:53,833 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 325 transitions. [2023-11-06 22:22:53,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 325 transitions. [2023-11-06 22:22:53,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:22:53,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 325 transitions. [2023-11-06 22:22:53,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states 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:22:53,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states 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:22:53,860 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states 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:22:53,863 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 325 transitions. [2023-11-06 22:22:53,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 40 transitions, 169 flow [2023-11-06 22:22:53,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 40 transitions, 164 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:22:53,871 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2023-11-06 22:22:53,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, 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=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-11-06 22:22:53,883 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2023-11-06 22:22:53,883 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2023-11-06 22:22:53,884 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:22:53,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:22:53,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:22:53,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:22:53,885 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:22:53,886 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:53,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1122048760, now seen corresponding path program 1 times [2023-11-06 22:22:53,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:22:53,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005965532] [2023-11-06 22:22:53,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:53,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:22:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:55,297 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:22:55,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:22:55,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005965532] [2023-11-06 22:22:55,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005965532] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:22:55,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:22:55,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:22:55,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871806455] [2023-11-06 22:22:55,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:22:55,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:22:55,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:22:55,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:22:55,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:22:55,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 201 [2023-11-06 22:22:55,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 0 states have call successors, (0), 0 states 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:22:55,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:22:55,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 201 [2023-11-06 22:22:55,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:22:56,432 INFO L124 PetriNetUnfolderBase]: 1677/2618 cut-off events. [2023-11-06 22:22:56,433 INFO L125 PetriNetUnfolderBase]: For 146/146 co-relation queries the response was YES. [2023-11-06 22:22:56,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5359 conditions, 2618 events. 1677/2618 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 13125 event pairs, 284 based on Foata normal form. 132/2750 useless extension candidates. Maximal degree in co-relation 5349. Up to 1640 conditions per place. [2023-11-06 22:22:56,461 INFO L140 encePairwiseOnDemand]: 189/201 looper letters, 36 selfloop transitions, 12 changer transitions 31/80 dead transitions. [2023-11-06 22:22:56,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 80 transitions, 342 flow [2023-11-06 22:22:56,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:22:56,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:22:56,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 670 transitions. [2023-11-06 22:22:56,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2023-11-06 22:22:56,468 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 670 transitions. [2023-11-06 22:22:56,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 670 transitions. [2023-11-06 22:22:56,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:22:56,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 670 transitions. [2023-11-06 22:22:56,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 95.71428571428571) internal successors, (670), 7 states have internal predecessors, (670), 0 states have call successors, (0), 0 states 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:22:56,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 201.0) internal successors, (1608), 8 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states 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:22:56,486 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 201.0) internal successors, (1608), 8 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states 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:22:56,487 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 7 states and 670 transitions. [2023-11-06 22:22:56,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 80 transitions, 342 flow [2023-11-06 22:22:56,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 80 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:22:56,494 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 160 flow [2023-11-06 22:22:56,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=160, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2023-11-06 22:22:56,496 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2023-11-06 22:22:56,502 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 160 flow [2023-11-06 22:22:56,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 0 states have call successors, (0), 0 states 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:22:56,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:22:56,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:22:56,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:22:56,504 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:22:56,509 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:56,510 INFO L85 PathProgramCache]: Analyzing trace with hash 423800673, now seen corresponding path program 1 times [2023-11-06 22:22:56,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:22:56,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447142240] [2023-11-06 22:22:56,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:56,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:22:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:57,558 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:22:57,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:22:57,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447142240] [2023-11-06 22:22:57,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447142240] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:22:57,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:22:57,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:22:57,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71556642] [2023-11-06 22:22:57,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:22:57,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:22:57,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:22:57,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:22:57,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:22:57,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 201 [2023-11-06 22:22:57,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 160 flow. Second operand has 5 states, 5 states have (on average 86.2) internal successors, (431), 5 states have internal predecessors, (431), 0 states have call successors, (0), 0 states 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:22:57,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:22:57,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 201 [2023-11-06 22:22:57,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:22:58,397 INFO L124 PetriNetUnfolderBase]: 1554/2415 cut-off events. [2023-11-06 22:22:58,398 INFO L125 PetriNetUnfolderBase]: For 2822/2834 co-relation queries the response was YES. [2023-11-06 22:22:58,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8070 conditions, 2415 events. 1554/2415 cut-off events. For 2822/2834 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 11953 event pairs, 363 based on Foata normal form. 99/2512 useless extension candidates. Maximal degree in co-relation 8054. Up to 1648 conditions per place. [2023-11-06 22:22:58,424 INFO L140 encePairwiseOnDemand]: 189/201 looper letters, 41 selfloop transitions, 19 changer transitions 26/87 dead transitions. [2023-11-06 22:22:58,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 87 transitions, 576 flow [2023-11-06 22:22:58,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:22:58,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:22:58,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 668 transitions. [2023-11-06 22:22:58,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47476901208244493 [2023-11-06 22:22:58,428 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 668 transitions. [2023-11-06 22:22:58,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 668 transitions. [2023-11-06 22:22:58,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:22:58,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 668 transitions. [2023-11-06 22:22:58,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 95.42857142857143) internal successors, (668), 7 states have internal predecessors, (668), 0 states have call successors, (0), 0 states 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:22:58,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 201.0) internal successors, (1608), 8 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states 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:22:58,436 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 201.0) internal successors, (1608), 8 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states 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:22:58,436 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 160 flow. Second operand 7 states and 668 transitions. [2023-11-06 22:22:58,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 87 transitions, 576 flow [2023-11-06 22:22:58,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 87 transitions, 572 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-06 22:22:58,450 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 306 flow [2023-11-06 22:22:58,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=306, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2023-11-06 22:22:58,451 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 14 predicate places. [2023-11-06 22:22:58,452 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 306 flow [2023-11-06 22:22:58,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.2) internal successors, (431), 5 states have internal predecessors, (431), 0 states have call successors, (0), 0 states 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:22:58,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:22:58,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:22:58,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:22:58,453 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:22:58,453 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:58,453 INFO L85 PathProgramCache]: Analyzing trace with hash 277353934, now seen corresponding path program 1 times [2023-11-06 22:22:58,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:22:58,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871909545] [2023-11-06 22:22:58,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:58,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:22:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:59,360 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:22:59,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:22:59,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871909545] [2023-11-06 22:22:59,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871909545] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:22:59,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:22:59,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:22:59,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807991558] [2023-11-06 22:22:59,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:22:59,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:22:59,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:22:59,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:22:59,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:22:59,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 201 [2023-11-06 22:22:59,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 306 flow. Second operand has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states 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:22:59,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:22:59,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 201 [2023-11-06 22:22:59,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:00,642 INFO L124 PetriNetUnfolderBase]: 2001/3116 cut-off events. [2023-11-06 22:23:00,643 INFO L125 PetriNetUnfolderBase]: For 8081/8081 co-relation queries the response was YES. [2023-11-06 22:23:00,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12627 conditions, 3116 events. 2001/3116 cut-off events. For 8081/8081 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 16626 event pairs, 332 based on Foata normal form. 126/3242 useless extension candidates. Maximal degree in co-relation 12604. Up to 1525 conditions per place. [2023-11-06 22:23:00,685 INFO L140 encePairwiseOnDemand]: 189/201 looper letters, 46 selfloop transitions, 24 changer transitions 27/98 dead transitions. [2023-11-06 22:23:00,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 98 transitions, 838 flow [2023-11-06 22:23:00,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:23:00,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:23:00,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 665 transitions. [2023-11-06 22:23:00,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.472636815920398 [2023-11-06 22:23:00,690 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 665 transitions. [2023-11-06 22:23:00,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 665 transitions. [2023-11-06 22:23:00,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:00,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 665 transitions. [2023-11-06 22:23:00,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 0 states 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:23:00,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 201.0) internal successors, (1608), 8 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states 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:23:00,701 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 201.0) internal successors, (1608), 8 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states 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:23:00,701 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 306 flow. Second operand 7 states and 665 transitions. [2023-11-06 22:23:00,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 98 transitions, 838 flow [2023-11-06 22:23:00,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 98 transitions, 816 flow, removed 11 selfloop flow, removed 3 redundant places. [2023-11-06 22:23:00,750 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 506 flow [2023-11-06 22:23:00,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=506, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2023-11-06 22:23:00,753 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 20 predicate places. [2023-11-06 22:23:00,753 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 506 flow [2023-11-06 22:23:00,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states 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:23:00,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:00,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:00,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:23:00,758 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:23:00,759 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:00,759 INFO L85 PathProgramCache]: Analyzing trace with hash 278783902, now seen corresponding path program 1 times [2023-11-06 22:23:00,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:00,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428601060] [2023-11-06 22:23:00,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:00,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:01,717 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:23:01,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:01,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428601060] [2023-11-06 22:23:01,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428601060] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:01,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:01,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:23:01,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350734651] [2023-11-06 22:23:01,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:01,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:23:01,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:01,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:23:01,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:23:01,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 201 [2023-11-06 22:23:01,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 506 flow. Second operand has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states 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:23:01,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:01,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 201 [2023-11-06 22:23:01,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:02,838 INFO L124 PetriNetUnfolderBase]: 2193/3380 cut-off events. [2023-11-06 22:23:02,839 INFO L125 PetriNetUnfolderBase]: For 15603/16115 co-relation queries the response was YES. [2023-11-06 22:23:02,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15555 conditions, 3380 events. 2193/3380 cut-off events. For 15603/16115 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 17933 event pairs, 869 based on Foata normal form. 445/3777 useless extension candidates. Maximal degree in co-relation 15527. Up to 2746 conditions per place. [2023-11-06 22:23:02,892 INFO L140 encePairwiseOnDemand]: 196/201 looper letters, 53 selfloop transitions, 5 changer transitions 22/90 dead transitions. [2023-11-06 22:23:02,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 90 transitions, 968 flow [2023-11-06 22:23:02,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:23:02,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:23:02,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 492 transitions. [2023-11-06 22:23:02,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48955223880597015 [2023-11-06 22:23:02,896 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 492 transitions. [2023-11-06 22:23:02,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 492 transitions. [2023-11-06 22:23:02,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:02,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 492 transitions. [2023-11-06 22:23:02,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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:23:02,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states 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:23:02,903 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states 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:23:02,903 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 506 flow. Second operand 5 states and 492 transitions. [2023-11-06 22:23:02,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 90 transitions, 968 flow [2023-11-06 22:23:02,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 90 transitions, 927 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-06 22:23:02,930 INFO L231 Difference]: Finished difference. Result has 57 places, 54 transitions, 531 flow [2023-11-06 22:23:02,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=531, PETRI_PLACES=57, PETRI_TRANSITIONS=54} [2023-11-06 22:23:02,934 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 22 predicate places. [2023-11-06 22:23:02,934 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 54 transitions, 531 flow [2023-11-06 22:23:02,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states 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:23:02,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:02,935 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:02,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:23:02,936 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:23:02,936 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:02,936 INFO L85 PathProgramCache]: Analyzing trace with hash -198803861, now seen corresponding path program 1 times [2023-11-06 22:23:02,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:02,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741561508] [2023-11-06 22:23:02,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:02,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:03,863 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:23:03,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:03,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741561508] [2023-11-06 22:23:03,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741561508] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:03,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:03,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:23:03,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754846807] [2023-11-06 22:23:03,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:03,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:23:03,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:03,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:23:03,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:23:03,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 201 [2023-11-06 22:23:03,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 531 flow. Second operand has 5 states, 5 states have (on average 86.6) internal successors, (433), 5 states have internal predecessors, (433), 0 states have call successors, (0), 0 states 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:23:03,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:03,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 201 [2023-11-06 22:23:03,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:05,528 INFO L124 PetriNetUnfolderBase]: 2966/4698 cut-off events. [2023-11-06 22:23:05,529 INFO L125 PetriNetUnfolderBase]: For 21192/21234 co-relation queries the response was YES. [2023-11-06 22:23:05,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21976 conditions, 4698 events. 2966/4698 cut-off events. For 21192/21234 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 27458 event pairs, 707 based on Foata normal form. 164/4818 useless extension candidates. Maximal degree in co-relation 21945. Up to 2187 conditions per place. [2023-11-06 22:23:05,594 INFO L140 encePairwiseOnDemand]: 189/201 looper letters, 54 selfloop transitions, 22 changer transitions 30/108 dead transitions. [2023-11-06 22:23:05,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 108 transitions, 1124 flow [2023-11-06 22:23:05,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:23:05,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:23:05,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 665 transitions. [2023-11-06 22:23:05,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.472636815920398 [2023-11-06 22:23:05,600 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 665 transitions. [2023-11-06 22:23:05,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 665 transitions. [2023-11-06 22:23:05,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:05,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 665 transitions. [2023-11-06 22:23:05,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 0 states 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:23:05,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 201.0) internal successors, (1608), 8 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states 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:23:05,609 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 201.0) internal successors, (1608), 8 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states 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:23:05,609 INFO L175 Difference]: Start difference. First operand has 57 places, 54 transitions, 531 flow. Second operand 7 states and 665 transitions. [2023-11-06 22:23:05,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 108 transitions, 1124 flow [2023-11-06 22:23:05,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 108 transitions, 1113 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-06 22:23:05,652 INFO L231 Difference]: Finished difference. Result has 65 places, 56 transitions, 665 flow [2023-11-06 22:23:05,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=665, PETRI_PLACES=65, PETRI_TRANSITIONS=56} [2023-11-06 22:23:05,656 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 30 predicate places. [2023-11-06 22:23:05,657 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 56 transitions, 665 flow [2023-11-06 22:23:05,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.6) internal successors, (433), 5 states have internal predecessors, (433), 0 states have call successors, (0), 0 states 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:23:05,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:05,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:05,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:23:05,658 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:23:05,658 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:05,659 INFO L85 PathProgramCache]: Analyzing trace with hash -141834820, now seen corresponding path program 1 times [2023-11-06 22:23:05,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:05,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729711170] [2023-11-06 22:23:05,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:05,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:06,549 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:23:06,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:06,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729711170] [2023-11-06 22:23:06,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729711170] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:06,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:06,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:23:06,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108807477] [2023-11-06 22:23:06,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:06,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:23:06,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:06,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:23:06,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:23:06,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 201 [2023-11-06 22:23:06,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 665 flow. Second operand has 6 states, 6 states have (on average 83.16666666666667) internal successors, (499), 6 states have internal predecessors, (499), 0 states have call successors, (0), 0 states 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:23:06,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:06,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 201 [2023-11-06 22:23:06,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:08,199 INFO L124 PetriNetUnfolderBase]: 3491/5413 cut-off events. [2023-11-06 22:23:08,200 INFO L125 PetriNetUnfolderBase]: For 41391/41391 co-relation queries the response was YES. [2023-11-06 22:23:08,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27796 conditions, 5413 events. 3491/5413 cut-off events. For 41391/41391 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 30278 event pairs, 1274 based on Foata normal form. 238/5651 useless extension candidates. Maximal degree in co-relation 27759. Up to 4585 conditions per place. [2023-11-06 22:23:08,256 INFO L140 encePairwiseOnDemand]: 189/201 looper letters, 82 selfloop transitions, 31 changer transitions 79/192 dead transitions. [2023-11-06 22:23:08,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 192 transitions, 2667 flow [2023-11-06 22:23:08,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:23:08,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:23:08,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 818 transitions. [2023-11-06 22:23:08,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4521835268103925 [2023-11-06 22:23:08,261 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 818 transitions. [2023-11-06 22:23:08,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 818 transitions. [2023-11-06 22:23:08,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:08,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 818 transitions. [2023-11-06 22:23:08,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 90.88888888888889) internal successors, (818), 9 states have internal predecessors, (818), 0 states have call successors, (0), 0 states 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:23:08,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 201.0) internal successors, (2010), 10 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states 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:23:08,271 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 201.0) internal successors, (2010), 10 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states 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:23:08,271 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 665 flow. Second operand 9 states and 818 transitions. [2023-11-06 22:23:08,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 192 transitions, 2667 flow [2023-11-06 22:23:08,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 192 transitions, 2631 flow, removed 18 selfloop flow, removed 2 redundant places. [2023-11-06 22:23:08,346 INFO L231 Difference]: Finished difference. Result has 75 places, 82 transitions, 1154 flow [2023-11-06 22:23:08,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1154, PETRI_PLACES=75, PETRI_TRANSITIONS=82} [2023-11-06 22:23:08,347 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 40 predicate places. [2023-11-06 22:23:08,348 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 82 transitions, 1154 flow [2023-11-06 22:23:08,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.16666666666667) internal successors, (499), 6 states have internal predecessors, (499), 0 states have call successors, (0), 0 states 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:23:08,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:08,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:08,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:23:08,349 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:23:08,350 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:08,350 INFO L85 PathProgramCache]: Analyzing trace with hash 52392890, now seen corresponding path program 2 times [2023-11-06 22:23:08,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:08,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486742144] [2023-11-06 22:23:08,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:08,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:09,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:09,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:09,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486742144] [2023-11-06 22:23:09,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486742144] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:09,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:09,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:23:09,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497587329] [2023-11-06 22:23:09,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:09,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:23:09,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:09,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:23:09,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:23:09,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 201 [2023-11-06 22:23:09,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 82 transitions, 1154 flow. Second operand has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 0 states have call successors, (0), 0 states 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:23:09,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:09,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 201 [2023-11-06 22:23:09,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:11,495 INFO L124 PetriNetUnfolderBase]: 3422/5304 cut-off events. [2023-11-06 22:23:11,496 INFO L125 PetriNetUnfolderBase]: For 53033/53033 co-relation queries the response was YES. [2023-11-06 22:23:11,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32153 conditions, 5304 events. 3422/5304 cut-off events. For 53033/53033 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 29656 event pairs, 1023 based on Foata normal form. 176/5480 useless extension candidates. Maximal degree in co-relation 32109. Up to 3818 conditions per place. [2023-11-06 22:23:11,561 INFO L140 encePairwiseOnDemand]: 188/201 looper letters, 69 selfloop transitions, 53 changer transitions 37/159 dead transitions. [2023-11-06 22:23:11,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 159 transitions, 2325 flow [2023-11-06 22:23:11,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:23:11,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:23:11,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 569 transitions. [2023-11-06 22:23:11,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47180762852404645 [2023-11-06 22:23:11,566 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 569 transitions. [2023-11-06 22:23:11,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 569 transitions. [2023-11-06 22:23:11,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:11,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 569 transitions. [2023-11-06 22:23:11,570 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:23:11,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states 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:23:11,574 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states 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:23:11,575 INFO L175 Difference]: Start difference. First operand has 75 places, 82 transitions, 1154 flow. Second operand 6 states and 569 transitions. [2023-11-06 22:23:11,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 159 transitions, 2325 flow [2023-11-06 22:23:11,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 159 transitions, 2287 flow, removed 19 selfloop flow, removed 1 redundant places. [2023-11-06 22:23:11,685 INFO L231 Difference]: Finished difference. Result has 80 places, 99 transitions, 1590 flow [2023-11-06 22:23:11,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=1128, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1590, PETRI_PLACES=80, PETRI_TRANSITIONS=99} [2023-11-06 22:23:11,686 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 45 predicate places. [2023-11-06 22:23:11,686 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 99 transitions, 1590 flow [2023-11-06 22:23:11,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 0 states have call successors, (0), 0 states 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:23:11,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:11,687 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:11,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:23:11,688 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:23:11,688 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:11,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1823599578, now seen corresponding path program 3 times [2023-11-06 22:23:11,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:11,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676480365] [2023-11-06 22:23:11,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:11,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:12,223 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:23:12,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:12,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676480365] [2023-11-06 22:23:12,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676480365] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:12,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:12,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:23:12,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455244831] [2023-11-06 22:23:12,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:12,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:23:12,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:12,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:23:12,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:23:12,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 201 [2023-11-06 22:23:12,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 99 transitions, 1590 flow. Second operand has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 0 states 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:23:12,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:12,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 201 [2023-11-06 22:23:12,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:13,705 INFO L124 PetriNetUnfolderBase]: 2896/4618 cut-off events. [2023-11-06 22:23:13,705 INFO L125 PetriNetUnfolderBase]: For 71952/73015 co-relation queries the response was YES. [2023-11-06 22:23:13,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31548 conditions, 4618 events. 2896/4618 cut-off events. For 71952/73015 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 27104 event pairs, 1014 based on Foata normal form. 832/5403 useless extension candidates. Maximal degree in co-relation 31499. Up to 3638 conditions per place. [2023-11-06 22:23:13,750 INFO L140 encePairwiseOnDemand]: 194/201 looper letters, 97 selfloop transitions, 24 changer transitions 30/164 dead transitions. [2023-11-06 22:23:13,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 164 transitions, 2842 flow [2023-11-06 22:23:13,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:23:13,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:23:13,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 604 transitions. [2023-11-06 22:23:13,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5008291873963516 [2023-11-06 22:23:13,754 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 604 transitions. [2023-11-06 22:23:13,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 604 transitions. [2023-11-06 22:23:13,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:13,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 604 transitions. [2023-11-06 22:23:13,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states 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:23:13,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states 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:23:13,761 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states 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:23:13,761 INFO L175 Difference]: Start difference. First operand has 80 places, 99 transitions, 1590 flow. Second operand 6 states and 604 transitions. [2023-11-06 22:23:13,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 164 transitions, 2842 flow [2023-11-06 22:23:13,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 164 transitions, 2824 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-11-06 22:23:13,859 INFO L231 Difference]: Finished difference. Result has 84 places, 106 transitions, 1804 flow [2023-11-06 22:23:13,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=1576, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1804, PETRI_PLACES=84, PETRI_TRANSITIONS=106} [2023-11-06 22:23:13,861 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 49 predicate places. [2023-11-06 22:23:13,861 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 106 transitions, 1804 flow [2023-11-06 22:23:13,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 0 states 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:23:13,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:13,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:13,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:23:13,862 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:23:13,863 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:13,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1804494898, now seen corresponding path program 1 times [2023-11-06 22:23:13,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:13,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000023180] [2023-11-06 22:23:13,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:13,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:14,304 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:23:14,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:14,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000023180] [2023-11-06 22:23:14,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000023180] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:14,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:14,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:23:14,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562718038] [2023-11-06 22:23:14,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:14,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:23:14,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:14,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:23:14,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:23:14,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 201 [2023-11-06 22:23:14,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 106 transitions, 1804 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:23:14,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:14,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 201 [2023-11-06 22:23:14,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:15,515 INFO L124 PetriNetUnfolderBase]: 3003/4769 cut-off events. [2023-11-06 22:23:15,516 INFO L125 PetriNetUnfolderBase]: For 87707/88663 co-relation queries the response was YES. [2023-11-06 22:23:15,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35019 conditions, 4769 events. 3003/4769 cut-off events. For 87707/88663 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 28033 event pairs, 1203 based on Foata normal form. 780/5485 useless extension candidates. Maximal degree in co-relation 34967. Up to 3538 conditions per place. [2023-11-06 22:23:15,568 INFO L140 encePairwiseOnDemand]: 194/201 looper letters, 90 selfloop transitions, 22 changer transitions 41/166 dead transitions. [2023-11-06 22:23:15,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 166 transitions, 3283 flow [2023-11-06 22:23:15,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:23:15,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:23:15,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 598 transitions. [2023-11-06 22:23:15,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49585406301824214 [2023-11-06 22:23:15,572 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 598 transitions. [2023-11-06 22:23:15,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 598 transitions. [2023-11-06 22:23:15,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:15,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 598 transitions. [2023-11-06 22:23:15,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 99.66666666666667) internal successors, (598), 6 states have internal predecessors, (598), 0 states have call successors, (0), 0 states 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:23:15,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states 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:23:15,580 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states 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:23:15,581 INFO L175 Difference]: Start difference. First operand has 84 places, 106 transitions, 1804 flow. Second operand 6 states and 598 transitions. [2023-11-06 22:23:15,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 166 transitions, 3283 flow [2023-11-06 22:23:15,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 166 transitions, 3196 flow, removed 30 selfloop flow, removed 3 redundant places. [2023-11-06 22:23:15,789 INFO L231 Difference]: Finished difference. Result has 87 places, 112 transitions, 1977 flow [2023-11-06 22:23:15,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=1745, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1977, PETRI_PLACES=87, PETRI_TRANSITIONS=112} [2023-11-06 22:23:15,792 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 52 predicate places. [2023-11-06 22:23:15,792 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 112 transitions, 1977 flow [2023-11-06 22:23:15,792 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:23:15,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:15,793 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:15,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:23:15,793 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:23:15,794 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:15,794 INFO L85 PathProgramCache]: Analyzing trace with hash -105296889, now seen corresponding path program 1 times [2023-11-06 22:23:15,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:15,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375232810] [2023-11-06 22:23:15,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:15,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:16,557 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:23:16,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:16,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375232810] [2023-11-06 22:23:16,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375232810] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:16,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:16,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:23:16,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256842691] [2023-11-06 22:23:16,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:16,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:23:16,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:16,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:23:16,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:23:16,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 201 [2023-11-06 22:23:16,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 112 transitions, 1977 flow. Second operand has 6 states, 6 states have (on average 94.33333333333333) internal successors, (566), 6 states have internal predecessors, (566), 0 states have call successors, (0), 0 states 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:23:16,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:16,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 201 [2023-11-06 22:23:16,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:17,950 INFO L124 PetriNetUnfolderBase]: 3083/5027 cut-off events. [2023-11-06 22:23:17,950 INFO L125 PetriNetUnfolderBase]: For 90504/91182 co-relation queries the response was YES. [2023-11-06 22:23:17,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37066 conditions, 5027 events. 3083/5027 cut-off events. For 90504/91182 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 31147 event pairs, 774 based on Foata normal form. 596/5557 useless extension candidates. Maximal degree in co-relation 37012. Up to 2827 conditions per place. [2023-11-06 22:23:17,988 INFO L140 encePairwiseOnDemand]: 195/201 looper letters, 85 selfloop transitions, 19 changer transitions 41/156 dead transitions. [2023-11-06 22:23:17,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 156 transitions, 3091 flow [2023-11-06 22:23:17,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:23:17,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:23:17,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 598 transitions. [2023-11-06 22:23:17,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49585406301824214 [2023-11-06 22:23:17,996 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 598 transitions. [2023-11-06 22:23:17,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 598 transitions. [2023-11-06 22:23:17,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:17,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 598 transitions. [2023-11-06 22:23:17,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 99.66666666666667) internal successors, (598), 6 states have internal predecessors, (598), 0 states have call successors, (0), 0 states 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:23:18,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states 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:23:18,002 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states 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:23:18,003 INFO L175 Difference]: Start difference. First operand has 87 places, 112 transitions, 1977 flow. Second operand 6 states and 598 transitions. [2023-11-06 22:23:18,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 156 transitions, 3091 flow [2023-11-06 22:23:18,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 156 transitions, 3024 flow, removed 22 selfloop flow, removed 4 redundant places. [2023-11-06 22:23:18,158 INFO L231 Difference]: Finished difference. Result has 89 places, 104 transitions, 1850 flow [2023-11-06 22:23:18,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=1930, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1850, PETRI_PLACES=89, PETRI_TRANSITIONS=104} [2023-11-06 22:23:18,159 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 54 predicate places. [2023-11-06 22:23:18,159 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 104 transitions, 1850 flow [2023-11-06 22:23:18,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.33333333333333) internal successors, (566), 6 states have internal predecessors, (566), 0 states have call successors, (0), 0 states 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:23:18,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:18,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:18,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:23:18,161 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:23:18,161 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:18,161 INFO L85 PathProgramCache]: Analyzing trace with hash -913781893, now seen corresponding path program 1 times [2023-11-06 22:23:18,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:18,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850817923] [2023-11-06 22:23:18,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:18,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:18,339 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:23:18,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:18,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850817923] [2023-11-06 22:23:18,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850817923] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:18,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:18,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:23:18,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197663781] [2023-11-06 22:23:18,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:18,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:23:18,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:18,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:23:18,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:23:18,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 201 [2023-11-06 22:23:18,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 104 transitions, 1850 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states 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:23:18,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:18,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 201 [2023-11-06 22:23:18,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:19,019 INFO L124 PetriNetUnfolderBase]: 1236/2223 cut-off events. [2023-11-06 22:23:19,019 INFO L125 PetriNetUnfolderBase]: For 47905/48344 co-relation queries the response was YES. [2023-11-06 22:23:19,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17209 conditions, 2223 events. 1236/2223 cut-off events. For 47905/48344 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 13653 event pairs, 266 based on Foata normal form. 344/2557 useless extension candidates. Maximal degree in co-relation 17154. Up to 1805 conditions per place. [2023-11-06 22:23:19,041 INFO L140 encePairwiseOnDemand]: 196/201 looper letters, 90 selfloop transitions, 4 changer transitions 8/115 dead transitions. [2023-11-06 22:23:19,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 115 transitions, 2278 flow [2023-11-06 22:23:19,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:23:19,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:23:19,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2023-11-06 22:23:19,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5124378109452736 [2023-11-06 22:23:19,044 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 309 transitions. [2023-11-06 22:23:19,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 309 transitions. [2023-11-06 22:23:19,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:19,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 309 transitions. [2023-11-06 22:23:19,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states 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:23:19,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states 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:23:19,050 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states 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:23:19,050 INFO L175 Difference]: Start difference. First operand has 89 places, 104 transitions, 1850 flow. Second operand 3 states and 309 transitions. [2023-11-06 22:23:19,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 115 transitions, 2278 flow [2023-11-06 22:23:19,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 115 transitions, 2087 flow, removed 34 selfloop flow, removed 12 redundant places. [2023-11-06 22:23:19,137 INFO L231 Difference]: Finished difference. Result has 78 places, 85 transitions, 1365 flow [2023-11-06 22:23:19,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=1354, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1365, PETRI_PLACES=78, PETRI_TRANSITIONS=85} [2023-11-06 22:23:19,138 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 43 predicate places. [2023-11-06 22:23:19,138 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 85 transitions, 1365 flow [2023-11-06 22:23:19,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states 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:23:19,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:19,139 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:23:19,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:23:19,140 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:23:19,140 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:19,140 INFO L85 PathProgramCache]: Analyzing trace with hash -589566012, now seen corresponding path program 1 times [2023-11-06 22:23:19,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:19,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949345552] [2023-11-06 22:23:19,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:19,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:19,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:19,339 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:23:19,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:19,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949345552] [2023-11-06 22:23:19,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949345552] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:19,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:19,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:23:19,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119137799] [2023-11-06 22:23:19,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:19,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:23:19,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:19,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:23:19,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:23:19,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 201 [2023-11-06 22:23:19,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 85 transitions, 1365 flow. Second operand has 4 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 0 states 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:23:19,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:19,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 201 [2023-11-06 22:23:19,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:19,786 INFO L124 PetriNetUnfolderBase]: 515/1071 cut-off events. [2023-11-06 22:23:19,786 INFO L125 PetriNetUnfolderBase]: For 14805/14910 co-relation queries the response was YES. [2023-11-06 22:23:19,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7903 conditions, 1071 events. 515/1071 cut-off events. For 14805/14910 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6236 event pairs, 51 based on Foata normal form. 187/1252 useless extension candidates. Maximal degree in co-relation 7856. Up to 530 conditions per place. [2023-11-06 22:23:19,798 INFO L140 encePairwiseOnDemand]: 196/201 looper letters, 90 selfloop transitions, 7 changer transitions 22/131 dead transitions. [2023-11-06 22:23:19,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 131 transitions, 2386 flow [2023-11-06 22:23:19,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:23:19,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:23:19,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 412 transitions. [2023-11-06 22:23:19,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5124378109452736 [2023-11-06 22:23:19,802 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 412 transitions. [2023-11-06 22:23:19,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 412 transitions. [2023-11-06 22:23:19,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:19,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 412 transitions. [2023-11-06 22:23:19,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 states 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:23:19,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states 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:23:19,808 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states 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:23:19,808 INFO L175 Difference]: Start difference. First operand has 78 places, 85 transitions, 1365 flow. Second operand 4 states and 412 transitions. [2023-11-06 22:23:19,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 131 transitions, 2386 flow [2023-11-06 22:23:19,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 131 transitions, 2355 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-11-06 22:23:19,852 INFO L231 Difference]: Finished difference. Result has 77 places, 78 transitions, 1153 flow [2023-11-06 22:23:19,853 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=1335, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1153, PETRI_PLACES=77, PETRI_TRANSITIONS=78} [2023-11-06 22:23:19,855 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 42 predicate places. [2023-11-06 22:23:19,856 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 78 transitions, 1153 flow [2023-11-06 22:23:19,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 0 states 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:23:19,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:19,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:19,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:23:19,857 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:23:19,857 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:19,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1588177950, now seen corresponding path program 1 times [2023-11-06 22:23:19,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:19,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442031635] [2023-11-06 22:23:19,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:19,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:20,861 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:23:20,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:20,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442031635] [2023-11-06 22:23:20,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442031635] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:20,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:20,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:23:20,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630128750] [2023-11-06 22:23:20,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:20,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:23:20,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:20,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:23:20,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:23:20,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 201 [2023-11-06 22:23:20,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 78 transitions, 1153 flow. Second operand has 8 states, 8 states have (on average 93.125) internal successors, (745), 8 states have internal predecessors, (745), 0 states have call successors, (0), 0 states 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:23:20,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:20,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 201 [2023-11-06 22:23:20,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:21,435 INFO L124 PetriNetUnfolderBase]: 477/1046 cut-off events. [2023-11-06 22:23:21,436 INFO L125 PetriNetUnfolderBase]: For 12799/12856 co-relation queries the response was YES. [2023-11-06 22:23:21,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7842 conditions, 1046 events. 477/1046 cut-off events. For 12799/12856 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6061 event pairs, 125 based on Foata normal form. 41/1082 useless extension candidates. Maximal degree in co-relation 7797. Up to 883 conditions per place. [2023-11-06 22:23:21,442 INFO L140 encePairwiseOnDemand]: 194/201 looper letters, 70 selfloop transitions, 14 changer transitions 22/115 dead transitions. [2023-11-06 22:23:21,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 115 transitions, 1861 flow [2023-11-06 22:23:21,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:23:21,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:23:21,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 779 transitions. [2023-11-06 22:23:21,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48445273631840796 [2023-11-06 22:23:21,449 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 779 transitions. [2023-11-06 22:23:21,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 779 transitions. [2023-11-06 22:23:21,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:21,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 779 transitions. [2023-11-06 22:23:21,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 97.375) internal successors, (779), 8 states have internal predecessors, (779), 0 states have call successors, (0), 0 states 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:23:21,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 201.0) internal successors, (1809), 9 states have internal predecessors, (1809), 0 states have call successors, (0), 0 states 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:23:21,458 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 201.0) internal successors, (1809), 9 states have internal predecessors, (1809), 0 states have call successors, (0), 0 states 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:23:21,459 INFO L175 Difference]: Start difference. First operand has 77 places, 78 transitions, 1153 flow. Second operand 8 states and 779 transitions. [2023-11-06 22:23:21,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 115 transitions, 1861 flow [2023-11-06 22:23:21,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 115 transitions, 1788 flow, removed 12 selfloop flow, removed 4 redundant places. [2023-11-06 22:23:21,502 INFO L231 Difference]: Finished difference. Result has 85 places, 83 transitions, 1258 flow [2023-11-06 22:23:21,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=1104, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1258, PETRI_PLACES=85, PETRI_TRANSITIONS=83} [2023-11-06 22:23:21,503 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 50 predicate places. [2023-11-06 22:23:21,503 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 83 transitions, 1258 flow [2023-11-06 22:23:21,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.125) internal successors, (745), 8 states have internal predecessors, (745), 0 states have call successors, (0), 0 states 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:23:21,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:21,504 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:23:21,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:23:21,504 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:23:21,505 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:21,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1352811657, now seen corresponding path program 1 times [2023-11-06 22:23:21,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:21,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67030558] [2023-11-06 22:23:21,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:21,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:21,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:21,714 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:23:21,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:21,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67030558] [2023-11-06 22:23:21,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67030558] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:21,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:21,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:23:21,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340559603] [2023-11-06 22:23:21,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:21,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:23:21,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:21,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:23:21,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:23:21,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 201 [2023-11-06 22:23:21,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 83 transitions, 1258 flow. Second operand has 5 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 0 states have call successors, (0), 0 states 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:23:21,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:21,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 201 [2023-11-06 22:23:21,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:22,027 INFO L124 PetriNetUnfolderBase]: 332/715 cut-off events. [2023-11-06 22:23:22,028 INFO L125 PetriNetUnfolderBase]: For 10113/10186 co-relation queries the response was YES. [2023-11-06 22:23:22,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5294 conditions, 715 events. 332/715 cut-off events. For 10113/10186 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4054 event pairs, 31 based on Foata normal form. 87/794 useless extension candidates. Maximal degree in co-relation 5251. Up to 326 conditions per place. [2023-11-06 22:23:22,033 INFO L140 encePairwiseOnDemand]: 196/201 looper letters, 50 selfloop transitions, 10 changer transitions 57/121 dead transitions. [2023-11-06 22:23:22,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 121 transitions, 2125 flow [2023-11-06 22:23:22,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:23:22,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:23:22,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 504 transitions. [2023-11-06 22:23:22,037 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5014925373134328 [2023-11-06 22:23:22,037 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 504 transitions. [2023-11-06 22:23:22,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 504 transitions. [2023-11-06 22:23:22,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:22,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 504 transitions. [2023-11-06 22:23:22,040 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:23:22,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states 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:23:22,044 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states 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:23:22,044 INFO L175 Difference]: Start difference. First operand has 85 places, 83 transitions, 1258 flow. Second operand 5 states and 504 transitions. [2023-11-06 22:23:22,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 121 transitions, 2125 flow [2023-11-06 22:23:22,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 121 transitions, 1931 flow, removed 85 selfloop flow, removed 8 redundant places. [2023-11-06 22:23:22,080 INFO L231 Difference]: Finished difference. Result has 79 places, 44 transitions, 503 flow [2023-11-06 22:23:22,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=1131, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=503, PETRI_PLACES=79, PETRI_TRANSITIONS=44} [2023-11-06 22:23:22,081 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 44 predicate places. [2023-11-06 22:23:22,081 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 44 transitions, 503 flow [2023-11-06 22:23:22,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 0 states have call successors, (0), 0 states 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:23:22,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:22,082 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:22,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:23:22,082 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:23:22,083 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:22,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1993882086, now seen corresponding path program 1 times [2023-11-06 22:23:22,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:22,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379291423] [2023-11-06 22:23:22,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:22,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:22,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:23,833 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:23:23,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:23,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379291423] [2023-11-06 22:23:23,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379291423] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:23,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:23,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:23:23,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893486900] [2023-11-06 22:23:23,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:23,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:23:23,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:23,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:23:23,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:23:23,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 201 [2023-11-06 22:23:23,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 44 transitions, 503 flow. Second operand has 10 states, 10 states have (on average 83.2) internal successors, (832), 10 states have internal predecessors, (832), 0 states have call successors, (0), 0 states 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:23:23,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:23,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 201 [2023-11-06 22:23:23,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:24,486 INFO L124 PetriNetUnfolderBase]: 145/294 cut-off events. [2023-11-06 22:23:24,486 INFO L125 PetriNetUnfolderBase]: For 2329/2329 co-relation queries the response was YES. [2023-11-06 22:23:24,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1895 conditions, 294 events. 145/294 cut-off events. For 2329/2329 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1018 event pairs, 15 based on Foata normal form. 1/295 useless extension candidates. Maximal degree in co-relation 1852. Up to 146 conditions per place. [2023-11-06 22:23:24,489 INFO L140 encePairwiseOnDemand]: 192/201 looper letters, 39 selfloop transitions, 12 changer transitions 30/81 dead transitions. [2023-11-06 22:23:24,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 81 transitions, 969 flow [2023-11-06 22:23:24,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:23:24,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:23:24,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 702 transitions. [2023-11-06 22:23:24,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43656716417910446 [2023-11-06 22:23:24,495 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 702 transitions. [2023-11-06 22:23:24,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 702 transitions. [2023-11-06 22:23:24,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:24,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 702 transitions. [2023-11-06 22:23:24,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 87.75) internal successors, (702), 8 states have internal predecessors, (702), 0 states have call successors, (0), 0 states 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:23:24,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 201.0) internal successors, (1809), 9 states have internal predecessors, (1809), 0 states have call successors, (0), 0 states 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:23:24,507 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 201.0) internal successors, (1809), 9 states have internal predecessors, (1809), 0 states have call successors, (0), 0 states 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:23:24,507 INFO L175 Difference]: Start difference. First operand has 79 places, 44 transitions, 503 flow. Second operand 8 states and 702 transitions. [2023-11-06 22:23:24,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 81 transitions, 969 flow [2023-11-06 22:23:24,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 81 transitions, 694 flow, removed 77 selfloop flow, removed 22 redundant places. [2023-11-06 22:23:24,519 INFO L231 Difference]: Finished difference. Result has 63 places, 39 transitions, 300 flow [2023-11-06 22:23:24,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=300, PETRI_PLACES=63, PETRI_TRANSITIONS=39} [2023-11-06 22:23:24,521 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 28 predicate places. [2023-11-06 22:23:24,523 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 39 transitions, 300 flow [2023-11-06 22:23:24,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 83.2) internal successors, (832), 10 states have internal predecessors, (832), 0 states have call successors, (0), 0 states 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:23:24,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:24,525 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:24,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:23:24,525 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:23:24,532 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:24,532 INFO L85 PathProgramCache]: Analyzing trace with hash 919336834, now seen corresponding path program 2 times [2023-11-06 22:23:24,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:24,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848880388] [2023-11-06 22:23:24,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:24,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:23:24,628 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:23:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:23:24,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:23:24,724 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:23:24,726 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-06 22:23:24,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-06 22:23:24,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-06 22:23:24,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-06 22:23:24,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-06 22:23:24,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-06 22:23:24,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:23:24,730 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:24,739 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:23:24,739 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:23:24,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:23:24 BasicIcfg [2023-11-06 22:23:24,861 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:23:24,861 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:23:24,862 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:23:24,862 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:23:24,863 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:22:47" (3/4) ... [2023-11-06 22:23:24,864 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 22:23:24,993 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7b5daed-17ac-488e-a401-6ae316999dc1/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:23:24,993 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:23:24,994 INFO L158 Benchmark]: Toolchain (without parser) took 39893.70ms. Allocated memory was 142.6MB in the beginning and 979.4MB in the end (delta: 836.8MB). Free memory was 110.9MB in the beginning and 631.7MB in the end (delta: -520.8MB). Peak memory consumption was 319.1MB. Max. memory is 16.1GB. [2023-11-06 22:23:24,995 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 117.4MB. Free memory is still 72.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:23:24,995 INFO L158 Benchmark]: CACSL2BoogieTranslator took 893.80ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 87.3MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 22:23:24,999 INFO L158 Benchmark]: Boogie Procedure Inliner took 118.42ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 84.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:23:24,999 INFO L158 Benchmark]: Boogie Preprocessor took 86.42ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 82.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:23:25,000 INFO L158 Benchmark]: RCFGBuilder took 998.53ms. Allocated memory is still 142.6MB. Free memory was 82.5MB in the beginning and 104.6MB in the end (delta: -22.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2023-11-06 22:23:25,001 INFO L158 Benchmark]: TraceAbstraction took 37654.78ms. Allocated memory was 142.6MB in the beginning and 979.4MB in the end (delta: 836.8MB). Free memory was 103.9MB in the beginning and 641.1MB in the end (delta: -537.2MB). Peak memory consumption was 300.2MB. Max. memory is 16.1GB. [2023-11-06 22:23:25,001 INFO L158 Benchmark]: Witness Printer took 132.01ms. Allocated memory is still 979.4MB. Free memory was 641.1MB in the beginning and 631.7MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:23:25,004 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 117.4MB. Free memory is still 72.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 893.80ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 87.3MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 118.42ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 84.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.42ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 82.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 998.53ms. Allocated memory is still 142.6MB. Free memory was 82.5MB in the beginning and 104.6MB in the end (delta: -22.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 37654.78ms. Allocated memory was 142.6MB in the beginning and 979.4MB in the end (delta: 836.8MB). Free memory was 103.9MB in the beginning and 641.1MB in the end (delta: -537.2MB). Peak memory consumption was 300.2MB. Max. memory is 16.1GB. * Witness Printer took 132.01ms. Allocated memory is still 979.4MB. Free memory was 641.1MB in the beginning and 631.7MB in the end (delta: 9.4MB). 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: 5.2s, 114 PlacesBefore, 35 PlacesAfterwards, 106 TransitionsBefore, 26 TransitionsAfterwards, 2096 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 92 TotalNumberOfCompositions, 5127 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2447, independent: 2289, independent conditional: 0, independent unconditional: 2289, dependent: 158, dependent conditional: 0, dependent unconditional: 158, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1123, independent: 1087, independent conditional: 0, independent unconditional: 1087, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2447, independent: 1202, independent conditional: 0, independent unconditional: 1202, dependent: 122, dependent conditional: 0, dependent unconditional: 122, unknown: 1123, unknown conditional: 0, unknown unconditional: 1123] , Statistics on independence cache: Total cache size (in pairs): 105, Positive cache size: 88, Positive conditional cache size: 0, Positive unconditional cache size: 88, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, 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; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L718] 0 _Bool z$flush_delayed; [L719] 0 int z$mem_tmp; [L720] 0 _Bool z$r_buff0_thd0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L723] 0 _Bool z$r_buff0_thd3; [L724] 0 _Bool z$r_buff1_thd0; [L725] 0 _Bool z$r_buff1_thd1; [L726] 0 _Bool z$r_buff1_thd2; [L727] 0 _Bool z$r_buff1_thd3; [L728] 0 _Bool z$read_delayed; [L729] 0 int *z$read_delayed_var; [L730] 0 int z$w_buff0; [L731] 0 _Bool z$w_buff0_used; [L732] 0 int z$w_buff1; [L733] 0 _Bool z$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L816] 0 pthread_t t2489; [L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2489, ((void *)0), P0, ((void *)0))=-1, t2489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L818] 0 pthread_t t2490; [L819] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2490, ((void *)0), P1, ((void *)0))=0, t2489={5:0}, t2490={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L820] 0 pthread_t t2491; [L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2491, ((void *)0), P2, ((void *)0))=1, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=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=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 y = 1 VAL [__unbuffered_cnt=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=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=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=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L788] 3 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L791] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L794] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 2 return 0; [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 3 return 0; [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L825] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L825] RET 0 assume_abort_if_not(main$tmp_guard0) [L827] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 [L849] 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=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: 819]: 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: 817]: 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: 821]: 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, 136 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: 37.4s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 18.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 983 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 719 mSDsluCounter, 846 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 660 mSDsCounter, 254 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2117 IncrementalHoareTripleChecker+Invalid, 2371 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 254 mSolverCounterUnsat, 186 mSDtfsCounter, 2117 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1977occurred in iteration=10, InterpolantAutomatonStates: 97, 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.7s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 239 NumberOfCodeBlocks, 239 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 201 ConstructedInterpolants, 0 QuantifiedInterpolants, 2492 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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:23:25,057 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7b5daed-17ac-488e-a401-6ae316999dc1/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE