./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36ca1604-4997-48ca-a7bf-06dd588274c1/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36ca1604-4997-48ca-a7bf-06dd588274c1/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_36ca1604-4997-48ca-a7bf-06dd588274c1/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36ca1604-4997-48ca-a7bf-06dd588274c1/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36ca1604-4997-48ca-a7bf-06dd588274c1/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_36ca1604-4997-48ca-a7bf-06dd588274c1/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 963498115a8eca6e92c68ab7fa8168826446f05b9b398350c3ee0745adf1bb45 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:46:04,625 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:46:04,725 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36ca1604-4997-48ca-a7bf-06dd588274c1/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:46:04,731 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:46:04,732 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:46:04,757 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:46:04,758 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:46:04,759 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:46:04,760 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:46:04,760 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:46:04,761 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:46:04,762 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:46:04,763 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:46:04,763 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:46:04,764 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:46:04,764 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:46:04,765 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:46:04,766 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:46:04,766 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:46:04,767 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:46:04,767 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:46:04,775 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:46:04,776 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:46:04,776 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:46:04,777 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:46:04,777 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:46:04,778 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:46:04,779 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:46:04,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:46:04,780 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:46:04,781 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:46:04,782 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:46:04,782 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:46:04,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:46:04,783 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:46:04,783 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:46:04,784 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:46:04,784 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:46:04,784 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:46:04,784 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_36ca1604-4997-48ca-a7bf-06dd588274c1/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_36ca1604-4997-48ca-a7bf-06dd588274c1/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 -> 963498115a8eca6e92c68ab7fa8168826446f05b9b398350c3ee0745adf1bb45 [2023-11-06 22:46:05,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:46:05,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:46:05,171 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:46:05,173 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:46:05,174 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:46:05,175 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36ca1604-4997-48ca-a7bf-06dd588274c1/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2023-11-06 22:46:08,405 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:46:08,714 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:46:08,715 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36ca1604-4997-48ca-a7bf-06dd588274c1/sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2023-11-06 22:46:08,737 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36ca1604-4997-48ca-a7bf-06dd588274c1/bin/uautomizer-verify-WvqO1wxjHP/data/1211c83c5/08d2e204c9534977bc724c79e74674f0/FLAG66d0a679d [2023-11-06 22:46:08,757 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36ca1604-4997-48ca-a7bf-06dd588274c1/bin/uautomizer-verify-WvqO1wxjHP/data/1211c83c5/08d2e204c9534977bc724c79e74674f0 [2023-11-06 22:46:08,765 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:46:08,766 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:46:08,768 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:46:08,769 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:46:08,775 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:46:08,778 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:46:08" (1/1) ... [2023-11-06 22:46:08,779 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13b5bea8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:08, skipping insertion in model container [2023-11-06 22:46:08,780 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:46:08" (1/1) ... [2023-11-06 22:46:08,851 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:46:09,338 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_36ca1604-4997-48ca-a7bf-06dd588274c1/sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i[30540,30553] [2023-11-06 22:46:09,351 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:46:09,364 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:46:09,425 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_36ca1604-4997-48ca-a7bf-06dd588274c1/sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i[30540,30553] [2023-11-06 22:46:09,429 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:46:09,496 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:46:09,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:09 WrapperNode [2023-11-06 22:46:09,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:46:09,498 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:46:09,498 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:46:09,498 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:46:09,507 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:46:09" (1/1) ... [2023-11-06 22:46:09,536 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:46:09" (1/1) ... [2023-11-06 22:46:09,572 INFO L138 Inliner]: procedures = 171, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 82 [2023-11-06 22:46:09,573 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:46:09,574 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:46:09,574 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:46:09,574 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:46:09,585 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:09" (1/1) ... [2023-11-06 22:46:09,585 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:09" (1/1) ... [2023-11-06 22:46:09,588 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:09" (1/1) ... [2023-11-06 22:46:09,588 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:09" (1/1) ... [2023-11-06 22:46:09,596 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:09" (1/1) ... [2023-11-06 22:46:09,600 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:09" (1/1) ... [2023-11-06 22:46:09,602 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:09" (1/1) ... [2023-11-06 22:46:09,604 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:09" (1/1) ... [2023-11-06 22:46:09,607 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:46:09,608 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:46:09,609 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:46:09,609 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:46:09,610 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:09" (1/1) ... [2023-11-06 22:46:09,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:46:09,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36ca1604-4997-48ca-a7bf-06dd588274c1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:46:09,657 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36ca1604-4997-48ca-a7bf-06dd588274c1/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:46:09,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36ca1604-4997-48ca-a7bf-06dd588274c1/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:46:09,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:46:09,703 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-06 22:46:09,704 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-06 22:46:09,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:46:09,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:46:09,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:46:09,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:46:09,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:46:09,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:46:09,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:46:09,707 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:46:09,873 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:46:09,875 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:46:10,120 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:46:10,168 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:46:10,168 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-06 22:46:10,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:46:10 BoogieIcfgContainer [2023-11-06 22:46:10,172 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:46:10,175 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:46:10,175 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:46:10,179 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:46:10,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:46:08" (1/3) ... [2023-11-06 22:46:10,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f456f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:46:10, skipping insertion in model container [2023-11-06 22:46:10,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:09" (2/3) ... [2023-11-06 22:46:10,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f456f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:46:10, skipping insertion in model container [2023-11-06 22:46:10,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:46:10" (3/3) ... [2023-11-06 22:46:10,183 INFO L112 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt.i [2023-11-06 22:46:10,193 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 22:46:10,203 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:46:10,203 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:46:10,204 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:46:10,304 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:46:10,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 82 transitions, 168 flow [2023-11-06 22:46:10,412 INFO L124 PetriNetUnfolderBase]: 9/93 cut-off events. [2023-11-06 22:46:10,412 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:46:10,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 93 events. 9/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 95 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 61. Up to 4 conditions per place. [2023-11-06 22:46:10,419 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 82 transitions, 168 flow [2023-11-06 22:46:10,425 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 82 transitions, 168 flow [2023-11-06 22:46:10,429 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:46:10,441 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 82 transitions, 168 flow [2023-11-06 22:46:10,444 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 82 transitions, 168 flow [2023-11-06 22:46:10,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 82 transitions, 168 flow [2023-11-06 22:46:10,492 INFO L124 PetriNetUnfolderBase]: 9/93 cut-off events. [2023-11-06 22:46:10,492 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:46:10,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 93 events. 9/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 95 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 61. Up to 4 conditions per place. [2023-11-06 22:46:10,496 INFO L119 LiptonReduction]: Number of co-enabled transitions 1344 [2023-11-06 22:46:13,823 INFO L134 LiptonReduction]: Checked pairs total: 1145 [2023-11-06 22:46:13,823 INFO L136 LiptonReduction]: Total number of compositions: 88 [2023-11-06 22:46:13,840 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:46:13,847 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;@52d1a6c2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:46:13,848 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-06 22:46:13,852 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:46:13,852 INFO L124 PetriNetUnfolderBase]: 1/9 cut-off events. [2023-11-06 22:46:13,852 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:46:13,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:13,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:46:13,854 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:46:13,860 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:13,860 INFO L85 PathProgramCache]: Analyzing trace with hash 390351297, now seen corresponding path program 1 times [2023-11-06 22:46:13,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:13,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835724405] [2023-11-06 22:46:13,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:13,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:14,126 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:46:14,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:14,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835724405] [2023-11-06 22:46:14,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835724405] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:14,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:14,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:46:14,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751754780] [2023-11-06 22:46:14,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:14,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:46:14,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:14,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:46:14,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:46:14,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 170 [2023-11-06 22:46:14,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 12 places, 10 transitions, 24 flow. Second operand has 2 states, 2 states have (on average 75.5) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:14,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:46:14,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 170 [2023-11-06 22:46:14,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:46:14,226 INFO L124 PetriNetUnfolderBase]: 7/20 cut-off events. [2023-11-06 22:46:14,226 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:46:14,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 20 events. 7/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 4 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 30. Up to 19 conditions per place. [2023-11-06 22:46:14,228 INFO L140 encePairwiseOnDemand]: 168/170 looper letters, 7 selfloop transitions, 0 changer transitions 0/8 dead transitions. [2023-11-06 22:46:14,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 11 places, 8 transitions, 34 flow [2023-11-06 22:46:14,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:46:14,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:46:14,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 155 transitions. [2023-11-06 22:46:14,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45588235294117646 [2023-11-06 22:46:14,244 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 155 transitions. [2023-11-06 22:46:14,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 155 transitions. [2023-11-06 22:46:14,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:46:14,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 155 transitions. [2023-11-06 22:46:14,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 77.5) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states 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:46:14,257 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 states 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:46:14,257 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 states 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:46:14,259 INFO L175 Difference]: Start difference. First operand has 12 places, 10 transitions, 24 flow. Second operand 2 states and 155 transitions. [2023-11-06 22:46:14,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 11 places, 8 transitions, 34 flow [2023-11-06 22:46:14,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 11 places, 8 transitions, 34 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:46:14,264 INFO L231 Difference]: Finished difference. Result has 11 places, 8 transitions, 20 flow [2023-11-06 22:46:14,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=20, PETRI_DIFFERENCE_MINUEND_PLACES=10, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=8, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=20, PETRI_PLACES=11, PETRI_TRANSITIONS=8} [2023-11-06 22:46:14,270 INFO L281 CegarLoopForPetriNet]: 12 programPoint places, -1 predicate places. [2023-11-06 22:46:14,270 INFO L495 AbstractCegarLoop]: Abstraction has has 11 places, 8 transitions, 20 flow [2023-11-06 22:46:14,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 75.5) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:14,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:14,271 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-11-06 22:46:14,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:46:14,272 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:46:14,272 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:14,272 INFO L85 PathProgramCache]: Analyzing trace with hash -784072858, now seen corresponding path program 1 times [2023-11-06 22:46:14,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:14,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253604333] [2023-11-06 22:46:14,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:14,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:46:14,303 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:46:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:46:14,341 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:46:14,341 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:46:14,344 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-06 22:46:14,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-11-06 22:46:14,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-11-06 22:46:14,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:46:14,347 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-06 22:46:14,351 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-06 22:46:14,351 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-06 22:46:14,389 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:46:14,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 131 transitions, 272 flow [2023-11-06 22:46:14,459 INFO L124 PetriNetUnfolderBase]: 17/155 cut-off events. [2023-11-06 22:46:14,459 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-06 22:46:14,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 155 events. 17/155 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 289 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 109. Up to 6 conditions per place. [2023-11-06 22:46:14,468 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 131 transitions, 272 flow [2023-11-06 22:46:14,471 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 131 transitions, 272 flow [2023-11-06 22:46:14,472 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:46:14,472 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 131 transitions, 272 flow [2023-11-06 22:46:14,473 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 131 transitions, 272 flow [2023-11-06 22:46:14,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 131 transitions, 272 flow [2023-11-06 22:46:14,529 INFO L124 PetriNetUnfolderBase]: 17/155 cut-off events. [2023-11-06 22:46:14,529 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-06 22:46:14,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 155 events. 17/155 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 289 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 109. Up to 6 conditions per place. [2023-11-06 22:46:14,541 INFO L119 LiptonReduction]: Number of co-enabled transitions 7392 [2023-11-06 22:46:17,895 INFO L134 LiptonReduction]: Checked pairs total: 10042 [2023-11-06 22:46:17,896 INFO L136 LiptonReduction]: Total number of compositions: 121 [2023-11-06 22:46:17,899 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:46:17,901 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;@52d1a6c2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:46:17,901 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-06 22:46:17,905 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:46:17,905 INFO L124 PetriNetUnfolderBase]: 2/15 cut-off events. [2023-11-06 22:46:17,905 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-06 22:46:17,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:17,906 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:46:17,906 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-11-06 22:46:17,907 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:17,907 INFO L85 PathProgramCache]: Analyzing trace with hash -339200909, now seen corresponding path program 1 times [2023-11-06 22:46:17,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:17,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789171514] [2023-11-06 22:46:17,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:17,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:17,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:17,953 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:46:17,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:17,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789171514] [2023-11-06 22:46:17,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789171514] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:17,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:17,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:46:17,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410515071] [2023-11-06 22:46:17,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:17,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:46:17,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:17,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:46:17,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:46:17,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 252 [2023-11-06 22:46:17,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 32 transitions, 74 flow. Second operand has 2 states, 2 states have (on average 117.5) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:17,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:46:17,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 252 [2023-11-06 22:46:17,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:46:18,027 INFO L124 PetriNetUnfolderBase]: 98/222 cut-off events. [2023-11-06 22:46:18,028 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-06 22:46:18,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 391 conditions, 222 events. 98/222 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 909 event pairs, 64 based on Foata normal form. 21/202 useless extension candidates. Maximal degree in co-relation 104. Up to 149 conditions per place. [2023-11-06 22:46:18,031 INFO L140 encePairwiseOnDemand]: 247/252 looper letters, 14 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2023-11-06 22:46:18,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 27 transitions, 92 flow [2023-11-06 22:46:18,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:46:18,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:46:18,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 249 transitions. [2023-11-06 22:46:18,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49404761904761907 [2023-11-06 22:46:18,035 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 249 transitions. [2023-11-06 22:46:18,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 249 transitions. [2023-11-06 22:46:18,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:46:18,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 249 transitions. [2023-11-06 22:46:18,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 124.5) internal successors, (249), 2 states have internal predecessors, (249), 0 states have call successors, (0), 0 states 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:46:18,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 0 states have call successors, (0), 0 states 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:46:18,041 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 0 states have call successors, (0), 0 states 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:46:18,041 INFO L175 Difference]: Start difference. First operand has 29 places, 32 transitions, 74 flow. Second operand 2 states and 249 transitions. [2023-11-06 22:46:18,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 27 transitions, 92 flow [2023-11-06 22:46:18,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 92 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:46:18,043 INFO L231 Difference]: Finished difference. Result has 29 places, 27 transitions, 64 flow [2023-11-06 22:46:18,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=64, PETRI_PLACES=29, PETRI_TRANSITIONS=27} [2023-11-06 22:46:18,044 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2023-11-06 22:46:18,045 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 27 transitions, 64 flow [2023-11-06 22:46:18,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 117.5) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:18,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:18,046 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:18,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:46:18,046 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-11-06 22:46:18,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:18,047 INFO L85 PathProgramCache]: Analyzing trace with hash 872263878, now seen corresponding path program 1 times [2023-11-06 22:46:18,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:18,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247335930] [2023-11-06 22:46:18,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:18,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:18,137 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:46:18,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:18,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247335930] [2023-11-06 22:46:18,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247335930] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:18,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:18,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:46:18,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200351764] [2023-11-06 22:46:18,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:18,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:46:18,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:18,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:46:18,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:46:18,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 252 [2023-11-06 22:46:18,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states 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:46:18,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:46:18,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 252 [2023-11-06 22:46:18,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:46:18,238 INFO L124 PetriNetUnfolderBase]: 115/243 cut-off events. [2023-11-06 22:46:18,238 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-06 22:46:18,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 243 events. 115/243 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1025 event pairs, 54 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 440. Up to 149 conditions per place. [2023-11-06 22:46:18,242 INFO L140 encePairwiseOnDemand]: 249/252 looper letters, 20 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2023-11-06 22:46:18,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 35 transitions, 129 flow [2023-11-06 22:46:18,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:46:18,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:46:18,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2023-11-06 22:46:18,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.458994708994709 [2023-11-06 22:46:18,246 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 347 transitions. [2023-11-06 22:46:18,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 347 transitions. [2023-11-06 22:46:18,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:46:18,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 347 transitions. [2023-11-06 22:46:18,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states 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:46:18,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states 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:46:18,253 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states 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:46:18,253 INFO L175 Difference]: Start difference. First operand has 29 places, 27 transitions, 64 flow. Second operand 3 states and 347 transitions. [2023-11-06 22:46:18,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 35 transitions, 129 flow [2023-11-06 22:46:18,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 35 transitions, 129 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:46:18,256 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 76 flow [2023-11-06 22:46:18,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=32, PETRI_TRANSITIONS=28} [2023-11-06 22:46:18,257 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2023-11-06 22:46:18,257 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 28 transitions, 76 flow [2023-11-06 22:46:18,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states 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:46:18,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:18,258 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:18,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:46:18,259 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-11-06 22:46:18,259 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:18,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1323557030, now seen corresponding path program 1 times [2023-11-06 22:46:18,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:18,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261978747] [2023-11-06 22:46:18,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:18,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:18,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:18,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:46:18,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:18,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261978747] [2023-11-06 22:46:18,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261978747] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:18,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:18,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:46:18,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419308470] [2023-11-06 22:46:18,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:18,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:46:18,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:18,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:46:18,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:46:18,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 252 [2023-11-06 22:46:18,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states 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:46:18,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:46:18,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 252 [2023-11-06 22:46:18,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:46:18,507 INFO L124 PetriNetUnfolderBase]: 186/378 cut-off events. [2023-11-06 22:46:18,507 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2023-11-06 22:46:18,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 773 conditions, 378 events. 186/378 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1731 event pairs, 92 based on Foata normal form. 0/313 useless extension candidates. Maximal degree in co-relation 766. Up to 233 conditions per place. [2023-11-06 22:46:18,512 INFO L140 encePairwiseOnDemand]: 247/252 looper letters, 26 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2023-11-06 22:46:18,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 38 transitions, 161 flow [2023-11-06 22:46:18,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:46:18,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:46:18,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2023-11-06 22:46:18,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2023-11-06 22:46:18,520 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 342 transitions. [2023-11-06 22:46:18,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 342 transitions. [2023-11-06 22:46:18,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:46:18,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 342 transitions. [2023-11-06 22:46:18,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states 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:46:18,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states 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:46:18,526 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states 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:46:18,526 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 76 flow. Second operand 3 states and 342 transitions. [2023-11-06 22:46:18,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 38 transitions, 161 flow [2023-11-06 22:46:18,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 38 transitions, 157 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-06 22:46:18,529 INFO L231 Difference]: Finished difference. Result has 34 places, 30 transitions, 94 flow [2023-11-06 22:46:18,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=34, PETRI_TRANSITIONS=30} [2023-11-06 22:46:18,532 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2023-11-06 22:46:18,532 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 94 flow [2023-11-06 22:46:18,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states 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:46:18,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:18,533 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-11-06 22:46:18,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:46:18,534 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-11-06 22:46:18,535 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:18,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1286792491, now seen corresponding path program 1 times [2023-11-06 22:46:18,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:18,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365702035] [2023-11-06 22:46:18,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:18,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:46:18,566 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:46:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:46:18,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:46:18,600 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:46:18,601 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2023-11-06 22:46:18,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-11-06 22:46:18,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-11-06 22:46:18,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-11-06 22:46:18,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:46:18,602 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-06 22:46:18,603 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-06 22:46:18,603 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-06 22:46:18,653 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:46:18,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 180 transitions, 378 flow [2023-11-06 22:46:18,728 INFO L124 PetriNetUnfolderBase]: 25/217 cut-off events. [2023-11-06 22:46:18,729 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-06 22:46:18,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 217 events. 25/217 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 538 event pairs, 0 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 159. Up to 8 conditions per place. [2023-11-06 22:46:18,733 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 180 transitions, 378 flow [2023-11-06 22:46:18,736 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 165 places, 180 transitions, 378 flow [2023-11-06 22:46:18,736 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:46:18,736 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 180 transitions, 378 flow [2023-11-06 22:46:18,737 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 165 places, 180 transitions, 378 flow [2023-11-06 22:46:18,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 180 transitions, 378 flow [2023-11-06 22:46:18,771 INFO L124 PetriNetUnfolderBase]: 25/217 cut-off events. [2023-11-06 22:46:18,772 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-06 22:46:18,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 217 events. 25/217 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 538 event pairs, 0 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 159. Up to 8 conditions per place. [2023-11-06 22:46:18,790 INFO L119 LiptonReduction]: Number of co-enabled transitions 18144 [2023-11-06 22:46:23,204 INFO L134 LiptonReduction]: Checked pairs total: 26393 [2023-11-06 22:46:23,212 INFO L136 LiptonReduction]: Total number of compositions: 175 [2023-11-06 22:46:23,214 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:46:23,215 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;@52d1a6c2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:46:23,218 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-06 22:46:23,221 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:46:23,222 INFO L124 PetriNetUnfolderBase]: 2/15 cut-off events. [2023-11-06 22:46:23,222 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-06 22:46:23,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:23,223 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:46:23,223 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-06 22:46:23,225 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:23,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1358987439, now seen corresponding path program 1 times [2023-11-06 22:46:23,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:23,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639533861] [2023-11-06 22:46:23,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:23,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:23,254 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:46:23,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:23,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639533861] [2023-11-06 22:46:23,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639533861] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:23,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:23,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:46:23,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798773986] [2023-11-06 22:46:23,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:23,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:46:23,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:23,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:46:23,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:46:23,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 355 [2023-11-06 22:46:23,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 45 transitions, 108 flow. Second operand has 2 states, 2 states have (on average 159.5) internal successors, (319), 2 states have internal predecessors, (319), 0 states have call successors, (0), 0 states 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:46:23,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:46:23,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 355 [2023-11-06 22:46:23,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:46:23,486 INFO L124 PetriNetUnfolderBase]: 798/1428 cut-off events. [2023-11-06 22:46:23,486 INFO L125 PetriNetUnfolderBase]: For 211/211 co-relation queries the response was YES. [2023-11-06 22:46:23,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2598 conditions, 1428 events. 798/1428 cut-off events. For 211/211 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7758 event pairs, 564 based on Foata normal form. 166/1328 useless extension candidates. Maximal degree in co-relation 393. Up to 1049 conditions per place. [2023-11-06 22:46:23,500 INFO L140 encePairwiseOnDemand]: 348/355 looper letters, 20 selfloop transitions, 0 changer transitions 0/38 dead transitions. [2023-11-06 22:46:23,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 38 transitions, 134 flow [2023-11-06 22:46:23,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:46:23,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:46:23,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 341 transitions. [2023-11-06 22:46:23,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4802816901408451 [2023-11-06 22:46:23,503 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 341 transitions. [2023-11-06 22:46:23,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 341 transitions. [2023-11-06 22:46:23,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:46:23,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 341 transitions. [2023-11-06 22:46:23,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 170.5) internal successors, (341), 2 states have internal predecessors, (341), 0 states have call successors, (0), 0 states 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:46:23,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 355.0) internal successors, (1065), 3 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states 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:46:23,509 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 355.0) internal successors, (1065), 3 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states 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:46:23,509 INFO L175 Difference]: Start difference. First operand has 40 places, 45 transitions, 108 flow. Second operand 2 states and 341 transitions. [2023-11-06 22:46:23,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 38 transitions, 134 flow [2023-11-06 22:46:23,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 38 transitions, 132 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-06 22:46:23,514 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 92 flow [2023-11-06 22:46:23,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=92, PETRI_PLACES=40, PETRI_TRANSITIONS=38} [2023-11-06 22:46:23,516 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-11-06 22:46:23,517 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 92 flow [2023-11-06 22:46:23,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 159.5) internal successors, (319), 2 states have internal predecessors, (319), 0 states have call successors, (0), 0 states 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:46:23,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:23,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:23,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:46:23,518 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-06 22:46:23,518 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:23,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1309202918, now seen corresponding path program 1 times [2023-11-06 22:46:23,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:23,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525561396] [2023-11-06 22:46:23,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:23,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:23,586 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:46:23,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:23,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525561396] [2023-11-06 22:46:23,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525561396] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:23,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:23,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:46:23,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567439276] [2023-11-06 22:46:23,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:23,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:46:23,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:23,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:46:23,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:46:23,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 355 [2023-11-06 22:46:23,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states 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:46:23,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:46:23,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 355 [2023-11-06 22:46:23,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:46:23,872 INFO L124 PetriNetUnfolderBase]: 943/1627 cut-off events. [2023-11-06 22:46:23,873 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2023-11-06 22:46:23,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3000 conditions, 1627 events. 943/1627 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8919 event pairs, 564 based on Foata normal form. 0/1333 useless extension candidates. Maximal degree in co-relation 2994. Up to 1049 conditions per place. [2023-11-06 22:46:23,892 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 32 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-11-06 22:46:23,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 52 transitions, 198 flow [2023-11-06 22:46:23,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:46:23,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:46:23,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2023-11-06 22:46:23,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45539906103286387 [2023-11-06 22:46:23,896 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 485 transitions. [2023-11-06 22:46:23,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 485 transitions. [2023-11-06 22:46:23,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:46:23,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 485 transitions. [2023-11-06 22:46:23,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states 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:46:23,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 355.0) internal successors, (1420), 4 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states 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:46:23,904 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 355.0) internal successors, (1420), 4 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states 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:46:23,904 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 92 flow. Second operand 3 states and 485 transitions. [2023-11-06 22:46:23,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 52 transitions, 198 flow [2023-11-06 22:46:23,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 198 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:46:23,909 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 104 flow [2023-11-06 22:46:23,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2023-11-06 22:46:23,912 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2023-11-06 22:46:23,912 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 104 flow [2023-11-06 22:46:23,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states 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:46:23,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:23,913 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:23,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:46:23,914 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-06 22:46:23,914 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:23,915 INFO L85 PathProgramCache]: Analyzing trace with hash 548977534, now seen corresponding path program 1 times [2023-11-06 22:46:23,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:23,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045881422] [2023-11-06 22:46:23,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:23,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:23,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:46:23,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:23,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045881422] [2023-11-06 22:46:23,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045881422] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:23,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:23,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:46:23,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970448611] [2023-11-06 22:46:23,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:23,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:46:23,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:23,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:46:23,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:46:24,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 355 [2023-11-06 22:46:24,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states 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:46:24,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:46:24,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 355 [2023-11-06 22:46:24,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:46:24,530 INFO L124 PetriNetUnfolderBase]: 2044/3360 cut-off events. [2023-11-06 22:46:24,530 INFO L125 PetriNetUnfolderBase]: For 593/593 co-relation queries the response was YES. [2023-11-06 22:46:24,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6691 conditions, 3360 events. 2044/3360 cut-off events. For 593/593 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 20203 event pairs, 1058 based on Foata normal form. 0/2796 useless extension candidates. Maximal degree in co-relation 6683. Up to 2231 conditions per place. [2023-11-06 22:46:24,560 INFO L140 encePairwiseOnDemand]: 349/355 looper letters, 39 selfloop transitions, 5 changer transitions 0/56 dead transitions. [2023-11-06 22:46:24,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 236 flow [2023-11-06 22:46:24,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:46:24,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:46:24,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2023-11-06 22:46:24,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4497652582159624 [2023-11-06 22:46:24,564 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 479 transitions. [2023-11-06 22:46:24,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 479 transitions. [2023-11-06 22:46:24,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:46:24,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 479 transitions. [2023-11-06 22:46:24,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 0 states 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:46:24,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 355.0) internal successors, (1420), 4 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states 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:46:24,571 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 355.0) internal successors, (1420), 4 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states 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:46:24,571 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 104 flow. Second operand 3 states and 479 transitions. [2023-11-06 22:46:24,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 236 flow [2023-11-06 22:46:24,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 56 transitions, 232 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-06 22:46:24,577 INFO L231 Difference]: Finished difference. Result has 45 places, 42 transitions, 129 flow [2023-11-06 22:46:24,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=45, PETRI_TRANSITIONS=42} [2023-11-06 22:46:24,579 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2023-11-06 22:46:24,579 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 42 transitions, 129 flow [2023-11-06 22:46:24,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states 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:46:24,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:24,580 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:24,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:46:24,580 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-06 22:46:24,581 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:24,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1047161479, now seen corresponding path program 1 times [2023-11-06 22:46:24,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:24,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591496521] [2023-11-06 22:46:24,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:24,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:24,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:46:24,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:24,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591496521] [2023-11-06 22:46:24,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591496521] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:24,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:24,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:46:24,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875567056] [2023-11-06 22:46:24,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:24,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:46:24,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:24,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:46:24,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:46:24,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 355 [2023-11-06 22:46:24,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 129 flow. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 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:46:24,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:46:24,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 355 [2023-11-06 22:46:24,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:46:25,122 INFO L124 PetriNetUnfolderBase]: 1393/2372 cut-off events. [2023-11-06 22:46:25,123 INFO L125 PetriNetUnfolderBase]: For 487/524 co-relation queries the response was YES. [2023-11-06 22:46:25,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4951 conditions, 2372 events. 1393/2372 cut-off events. For 487/524 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 13801 event pairs, 751 based on Foata normal form. 0/1965 useless extension candidates. Maximal degree in co-relation 4942. Up to 1570 conditions per place. [2023-11-06 22:46:25,151 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 35 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-11-06 22:46:25,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 57 transitions, 249 flow [2023-11-06 22:46:25,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:46:25,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:46:25,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2023-11-06 22:46:25,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4544600938967136 [2023-11-06 22:46:25,155 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 484 transitions. [2023-11-06 22:46:25,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 484 transitions. [2023-11-06 22:46:25,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:46:25,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 484 transitions. [2023-11-06 22:46:25,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states 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:46:25,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 355.0) internal successors, (1420), 4 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states 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:46:25,162 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 355.0) internal successors, (1420), 4 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states 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:46:25,162 INFO L175 Difference]: Start difference. First operand has 45 places, 42 transitions, 129 flow. Second operand 3 states and 484 transitions. [2023-11-06 22:46:25,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 57 transitions, 249 flow [2023-11-06 22:46:25,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 57 transitions, 243 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:46:25,167 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 136 flow [2023-11-06 22:46:25,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=47, PETRI_TRANSITIONS=43} [2023-11-06 22:46:25,170 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2023-11-06 22:46:25,170 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 136 flow [2023-11-06 22:46:25,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 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:46:25,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:25,171 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:25,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:46:25,171 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-06 22:46:25,172 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:25,172 INFO L85 PathProgramCache]: Analyzing trace with hash 496988528, now seen corresponding path program 1 times [2023-11-06 22:46:25,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:25,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33562961] [2023-11-06 22:46:25,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:25,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:25,210 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:46:25,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:25,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33562961] [2023-11-06 22:46:25,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33562961] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:25,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:25,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:46:25,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116149985] [2023-11-06 22:46:25,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:25,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:46:25,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:25,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:46:25,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:46:25,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 355 [2023-11-06 22:46:25,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states 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:46:25,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:46:25,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 355 [2023-11-06 22:46:25,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:46:25,876 INFO L124 PetriNetUnfolderBase]: 2835/4607 cut-off events. [2023-11-06 22:46:25,876 INFO L125 PetriNetUnfolderBase]: For 1516/1548 co-relation queries the response was YES. [2023-11-06 22:46:25,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10231 conditions, 4607 events. 2835/4607 cut-off events. For 1516/1548 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 28663 event pairs, 1463 based on Foata normal form. 0/3936 useless extension candidates. Maximal degree in co-relation 10221. Up to 3016 conditions per place. [2023-11-06 22:46:25,919 INFO L140 encePairwiseOnDemand]: 349/355 looper letters, 43 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2023-11-06 22:46:25,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 62 transitions, 295 flow [2023-11-06 22:46:25,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:46:25,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:46:25,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 478 transitions. [2023-11-06 22:46:25,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4488262910798122 [2023-11-06 22:46:25,923 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 478 transitions. [2023-11-06 22:46:25,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 478 transitions. [2023-11-06 22:46:25,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:46:25,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 478 transitions. [2023-11-06 22:46:25,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:25,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 355.0) internal successors, (1420), 4 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states 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:46:25,928 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 355.0) internal successors, (1420), 4 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states 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:46:25,929 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 136 flow. Second operand 3 states and 478 transitions. [2023-11-06 22:46:25,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 62 transitions, 295 flow [2023-11-06 22:46:25,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 62 transitions, 291 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-06 22:46:25,935 INFO L231 Difference]: Finished difference. Result has 49 places, 47 transitions, 177 flow [2023-11-06 22:46:25,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=177, PETRI_PLACES=49, PETRI_TRANSITIONS=47} [2023-11-06 22:46:25,936 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2023-11-06 22:46:25,936 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 47 transitions, 177 flow [2023-11-06 22:46:25,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states 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:46:25,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:25,937 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2023-11-06 22:46:25,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:46:25,938 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-06 22:46:25,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:25,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1996677712, now seen corresponding path program 1 times [2023-11-06 22:46:25,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:25,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834237755] [2023-11-06 22:46:25,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:25,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:25,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:46:25,965 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:46:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:46:25,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:46:25,989 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:46:25,989 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-11-06 22:46:25,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-06 22:46:25,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-11-06 22:46:25,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-11-06 22:46:25,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-06 22:46:25,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:46:25,990 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-06 22:46:25,991 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-06 22:46:25,991 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-06 22:46:26,039 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:46:26,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 229 transitions, 486 flow [2023-11-06 22:46:26,091 INFO L124 PetriNetUnfolderBase]: 33/279 cut-off events. [2023-11-06 22:46:26,092 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-06 22:46:26,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 279 events. 33/279 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 819 event pairs, 0 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 225. Up to 10 conditions per place. [2023-11-06 22:46:26,094 INFO L82 GeneralOperation]: Start removeDead. Operand has 209 places, 229 transitions, 486 flow [2023-11-06 22:46:26,098 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 209 places, 229 transitions, 486 flow [2023-11-06 22:46:26,098 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:46:26,099 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 209 places, 229 transitions, 486 flow [2023-11-06 22:46:26,099 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 209 places, 229 transitions, 486 flow [2023-11-06 22:46:26,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 229 transitions, 486 flow [2023-11-06 22:46:26,146 INFO L124 PetriNetUnfolderBase]: 33/279 cut-off events. [2023-11-06 22:46:26,146 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-06 22:46:26,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 279 events. 33/279 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 819 event pairs, 0 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 225. Up to 10 conditions per place. [2023-11-06 22:46:26,173 INFO L119 LiptonReduction]: Number of co-enabled transitions 33600 [2023-11-06 22:46:31,620 INFO L134 LiptonReduction]: Checked pairs total: 47158 [2023-11-06 22:46:31,621 INFO L136 LiptonReduction]: Total number of compositions: 218 [2023-11-06 22:46:31,624 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:46:31,625 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;@52d1a6c2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:46:31,625 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-06 22:46:31,628 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:46:31,628 INFO L124 PetriNetUnfolderBase]: 2/15 cut-off events. [2023-11-06 22:46:31,629 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-06 22:46:31,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:31,629 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:46:31,629 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-06 22:46:31,629 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:31,630 INFO L85 PathProgramCache]: Analyzing trace with hash 399563734, now seen corresponding path program 1 times [2023-11-06 22:46:31,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:31,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201189274] [2023-11-06 22:46:31,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:31,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:31,648 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:46:31,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:31,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201189274] [2023-11-06 22:46:31,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201189274] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:31,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:31,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:46:31,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444361305] [2023-11-06 22:46:31,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:31,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:46:31,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:31,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:46:31,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:46:31,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 447 [2023-11-06 22:46:31,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 58 transitions, 144 flow. Second operand has 2 states, 2 states have (on average 201.5) internal successors, (403), 2 states have internal predecessors, (403), 0 states have call successors, (0), 0 states 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:46:31,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:46:31,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 447 [2023-11-06 22:46:31,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:46:32,803 INFO L124 PetriNetUnfolderBase]: 5548/8708 cut-off events. [2023-11-06 22:46:32,803 INFO L125 PetriNetUnfolderBase]: For 1921/1921 co-relation queries the response was YES. [2023-11-06 22:46:32,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16254 conditions, 8708 events. 5548/8708 cut-off events. For 1921/1921 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 54870 event pairs, 4064 based on Foata normal form. 1141/8208 useless extension candidates. Maximal degree in co-relation 2624. Up to 6799 conditions per place. [2023-11-06 22:46:32,889 INFO L140 encePairwiseOnDemand]: 438/447 looper letters, 26 selfloop transitions, 0 changer transitions 0/49 dead transitions. [2023-11-06 22:46:32,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 49 transitions, 178 flow [2023-11-06 22:46:32,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:46:32,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:46:32,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 433 transitions. [2023-11-06 22:46:32,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4843400447427293 [2023-11-06 22:46:32,892 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 433 transitions. [2023-11-06 22:46:32,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 433 transitions. [2023-11-06 22:46:32,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:46:32,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 433 transitions. [2023-11-06 22:46:32,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 216.5) internal successors, (433), 2 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:46:32,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 447.0) internal successors, (1341), 3 states have internal predecessors, (1341), 0 states have call successors, (0), 0 states 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:46:32,899 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 447.0) internal successors, (1341), 3 states have internal predecessors, (1341), 0 states have call successors, (0), 0 states 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:46:32,899 INFO L175 Difference]: Start difference. First operand has 51 places, 58 transitions, 144 flow. Second operand 2 states and 433 transitions. [2023-11-06 22:46:32,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 49 transitions, 178 flow [2023-11-06 22:46:32,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 49 transitions, 172 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-11-06 22:46:32,905 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 120 flow [2023-11-06 22:46:32,906 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=120, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2023-11-06 22:46:32,907 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2023-11-06 22:46:32,908 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 120 flow [2023-11-06 22:46:32,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 201.5) internal successors, (403), 2 states have internal predecessors, (403), 0 states have call successors, (0), 0 states 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:46:32,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:32,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:32,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:46:32,909 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-06 22:46:32,909 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:32,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1958355113, now seen corresponding path program 1 times [2023-11-06 22:46:32,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:32,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528452553] [2023-11-06 22:46:32,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:32,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:32,961 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:46:32,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:32,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528452553] [2023-11-06 22:46:32,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528452553] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:32,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:32,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:46:32,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715035028] [2023-11-06 22:46:32,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:32,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:46:32,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:32,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:46:32,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:46:32,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 447 [2023-11-06 22:46:32,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 states 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:46:32,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:46:32,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 447 [2023-11-06 22:46:32,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:46:34,523 INFO L124 PetriNetUnfolderBase]: 6593/10057 cut-off events. [2023-11-06 22:46:34,523 INFO L125 PetriNetUnfolderBase]: For 1108/1108 co-relation queries the response was YES. [2023-11-06 22:46:34,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18781 conditions, 10057 events. 6593/10057 cut-off events. For 1108/1108 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 62880 event pairs, 4064 based on Foata normal form. 0/8213 useless extension candidates. Maximal degree in co-relation 18774. Up to 6799 conditions per place. [2023-11-06 22:46:34,628 INFO L140 encePairwiseOnDemand]: 444/447 looper letters, 44 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-11-06 22:46:34,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 69 transitions, 267 flow [2023-11-06 22:46:34,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:46:34,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:46:34,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 623 transitions. [2023-11-06 22:46:34,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4645786726323639 [2023-11-06 22:46:34,633 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 623 transitions. [2023-11-06 22:46:34,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 623 transitions. [2023-11-06 22:46:34,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:46:34,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 623 transitions. [2023-11-06 22:46:34,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 0 states have call successors, (0), 0 states 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:46:34,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 447.0) internal successors, (1788), 4 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states 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:46:34,641 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 447.0) internal successors, (1788), 4 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states 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:46:34,641 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 120 flow. Second operand 3 states and 623 transitions. [2023-11-06 22:46:34,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 69 transitions, 267 flow [2023-11-06 22:46:34,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 69 transitions, 267 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:46:34,647 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 132 flow [2023-11-06 22:46:34,648 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2023-11-06 22:46:34,649 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2023-11-06 22:46:34,649 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 132 flow [2023-11-06 22:46:34,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 states 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:46:34,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:34,650 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:34,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:46:34,651 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-06 22:46:34,651 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:34,651 INFO L85 PathProgramCache]: Analyzing trace with hash -699372456, now seen corresponding path program 1 times [2023-11-06 22:46:34,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:34,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259513920] [2023-11-06 22:46:34,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:34,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:34,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:46:34,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:34,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259513920] [2023-11-06 22:46:34,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259513920] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:34,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:34,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:46:34,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853059795] [2023-11-06 22:46:34,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:34,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:46:34,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:34,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:46:34,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:46:34,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 447 [2023-11-06 22:46:34,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states 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:46:34,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:46:34,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 447 [2023-11-06 22:46:34,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:46:37,843 INFO L124 PetriNetUnfolderBase]: 18284/26572 cut-off events. [2023-11-06 22:46:37,843 INFO L125 PetriNetUnfolderBase]: For 4252/4252 co-relation queries the response was YES. [2023-11-06 22:46:37,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52795 conditions, 26572 events. 18284/26572 cut-off events. For 4252/4252 co-relation queries the response was YES. Maximal size of possible extension queue 1190. Compared 176972 event pairs, 9690 based on Foata normal form. 0/22074 useless extension candidates. Maximal degree in co-relation 52786. Up to 18717 conditions per place. [2023-11-06 22:46:38,066 INFO L140 encePairwiseOnDemand]: 440/447 looper letters, 52 selfloop transitions, 6 changer transitions 0/74 dead transitions. [2023-11-06 22:46:38,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 74 transitions, 311 flow [2023-11-06 22:46:38,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:46:38,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:46:38,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 616 transitions. [2023-11-06 22:46:38,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.459358687546607 [2023-11-06 22:46:38,071 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 616 transitions. [2023-11-06 22:46:38,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 616 transitions. [2023-11-06 22:46:38,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:46:38,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 616 transitions. [2023-11-06 22:46:38,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:38,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 447.0) internal successors, (1788), 4 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states 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:46:38,079 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 447.0) internal successors, (1788), 4 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states 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:46:38,079 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 132 flow. Second operand 3 states and 616 transitions. [2023-11-06 22:46:38,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 74 transitions, 311 flow [2023-11-06 22:46:38,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 74 transitions, 307 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-06 22:46:38,093 INFO L231 Difference]: Finished difference. Result has 56 places, 54 transitions, 164 flow [2023-11-06 22:46:38,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2023-11-06 22:46:38,094 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places. [2023-11-06 22:46:38,095 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 164 flow [2023-11-06 22:46:38,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states 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:46:38,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:38,096 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:38,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:46:38,096 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-06 22:46:38,096 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:38,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1273339423, now seen corresponding path program 1 times [2023-11-06 22:46:38,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:38,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319226621] [2023-11-06 22:46:38,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:38,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:38,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:46:38,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:38,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319226621] [2023-11-06 22:46:38,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319226621] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:38,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:38,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:46:38,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999021550] [2023-11-06 22:46:38,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:38,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:46:38,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:38,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:46:38,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:46:38,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 447 [2023-11-06 22:46:38,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 0 states have call successors, (0), 0 states 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:46:38,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:46:38,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 447 [2023-11-06 22:46:38,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:46:40,151 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1346] L714-1-->L718: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_13|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 220#true, 102#L718true, thr1Thread1of4ForFork0InUse, 97#L718true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 225#true, thr1Thread4of4ForFork0InUse, 4#L718true, 179#L729-5true, 76#L714-1true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 212#true]) [2023-11-06 22:46:40,151 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-06 22:46:40,152 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:46:40,152 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:46:40,152 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:46:40,200 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1346] L714-1-->L718: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_13|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 220#true, 102#L718true, 97#L718true, 118#L718true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 225#true, thr1Thread4of4ForFork0InUse, 4#L718true, 179#L729-5true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 212#true]) [2023-11-06 22:46:40,200 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-06 22:46:40,200 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:46:40,201 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:46:40,201 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:46:40,208 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1346] L714-1-->L718: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_13|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 220#true, 102#L718true, 108#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 225#true, thr1Thread4of4ForFork0InUse, 4#L718true, 179#L729-5true, 76#L714-1true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 212#true]) [2023-11-06 22:46:40,208 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-06 22:46:40,208 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:46:40,208 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:46:40,209 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:46:40,209 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1346] L714-1-->L718: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_13|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 220#true, 102#L718true, thr1Thread1of4ForFork0InUse, 97#L718true, 87#thr1EXITtrue, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 225#true, thr1Thread4of4ForFork0InUse, 179#L729-5true, 76#L714-1true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 212#true]) [2023-11-06 22:46:40,210 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-06 22:46:40,210 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:46:40,210 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:46:40,210 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:46:40,248 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1346] L714-1-->L718: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_13|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 220#true, 102#L718true, 108#thr1EXITtrue, 118#L718true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 225#true, 4#L718true, thr1Thread4of4ForFork0InUse, 179#L729-5true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 212#true]) [2023-11-06 22:46:40,248 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-06 22:46:40,248 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:46:40,248 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 22:46:40,248 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:46:40,250 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1346] L714-1-->L718: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_13|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 220#true, 102#L718true, 97#L718true, 118#L718true, thr1Thread1of4ForFork0InUse, 87#thr1EXITtrue, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 225#true, thr1Thread4of4ForFork0InUse, 179#L729-5true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 212#true]) [2023-11-06 22:46:40,250 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-06 22:46:40,250 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 22:46:40,250 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:46:40,251 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:46:40,257 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1346] L714-1-->L718: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_13|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 220#true, 102#L718true, 108#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 87#thr1EXITtrue, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 225#true, thr1Thread4of4ForFork0InUse, 179#L729-5true, 76#L714-1true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 212#true]) [2023-11-06 22:46:40,258 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-06 22:46:40,258 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:46:40,258 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:46:40,258 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 22:46:40,293 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1346] L714-1-->L718: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_13|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 220#true, 102#L718true, thr1Thread1of4ForFork0InUse, 97#L718true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 225#true, thr1Thread4of4ForFork0InUse, 4#L718true, 76#L714-1true, 169#L729-4true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 212#true]) [2023-11-06 22:46:40,293 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-06 22:46:40,294 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 22:46:40,294 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 22:46:40,294 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 22:46:40,307 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1346] L714-1-->L718: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_13|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 220#true, 102#L718true, 108#thr1EXITtrue, 118#L718true, thr1Thread1of4ForFork0InUse, 87#thr1EXITtrue, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 225#true, thr1Thread4of4ForFork0InUse, 179#L729-5true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 212#true]) [2023-11-06 22:46:40,307 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-06 22:46:40,307 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 22:46:40,307 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 22:46:40,308 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 22:46:40,326 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1346] L714-1-->L718: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_13|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 220#true, 102#L718true, 97#L718true, 118#L718true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 225#true, thr1Thread4of4ForFork0InUse, 4#L718true, 169#L729-4true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 212#true]) [2023-11-06 22:46:40,326 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-06 22:46:40,326 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 22:46:40,326 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 22:46:40,327 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-06 22:46:40,340 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1346] L714-1-->L718: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_13|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 220#true, 102#L718true, 108#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 225#true, thr1Thread4of4ForFork0InUse, 4#L718true, 76#L714-1true, 169#L729-4true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 212#true]) [2023-11-06 22:46:40,340 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-06 22:46:40,340 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 22:46:40,341 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 22:46:40,341 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-06 22:46:40,342 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1346] L714-1-->L718: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_13|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 220#true, 102#L718true, thr1Thread1of4ForFork0InUse, 97#L718true, 87#thr1EXITtrue, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 225#true, thr1Thread4of4ForFork0InUse, 76#L714-1true, 169#L729-4true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 212#true]) [2023-11-06 22:46:40,342 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-06 22:46:40,342 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 22:46:40,343 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-06 22:46:40,343 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 22:46:40,360 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1346] L714-1-->L718: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_13|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 220#true, 102#L718true, 108#thr1EXITtrue, 118#L718true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 225#true, 4#L718true, thr1Thread4of4ForFork0InUse, 169#L729-4true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 212#true]) [2023-11-06 22:46:40,361 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-06 22:46:40,361 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-06 22:46:40,361 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-06 22:46:40,361 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-06 22:46:40,363 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1346] L714-1-->L718: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_13|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 220#true, 102#L718true, 97#L718true, 118#L718true, thr1Thread1of4ForFork0InUse, 87#thr1EXITtrue, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 225#true, thr1Thread4of4ForFork0InUse, 169#L729-4true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 212#true]) [2023-11-06 22:46:40,363 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-06 22:46:40,363 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-06 22:46:40,364 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-06 22:46:40,364 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-06 22:46:40,553 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1346] L714-1-->L718: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_13|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 220#true, 102#L718true, 108#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 87#thr1EXITtrue, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 225#true, thr1Thread4of4ForFork0InUse, 76#L714-1true, 169#L729-4true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 212#true]) [2023-11-06 22:46:40,553 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-06 22:46:40,553 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-06 22:46:40,553 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-06 22:46:40,553 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-06 22:46:40,560 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1346] L714-1-->L718: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_13|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 220#true, 102#L718true, 108#thr1EXITtrue, 118#L718true, thr1Thread1of4ForFork0InUse, 87#thr1EXITtrue, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 225#true, thr1Thread4of4ForFork0InUse, 169#L729-4true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 212#true]) [2023-11-06 22:46:40,560 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-06 22:46:40,561 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-06 22:46:40,561 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-06 22:46:40,561 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-06 22:46:40,568 INFO L124 PetriNetUnfolderBase]: 11278/17137 cut-off events. [2023-11-06 22:46:40,568 INFO L125 PetriNetUnfolderBase]: For 3268/3689 co-relation queries the response was YES. [2023-11-06 22:46:40,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35046 conditions, 17137 events. 11278/17137 cut-off events. For 3268/3689 co-relation queries the response was YES. Maximal size of possible extension queue 754. Compared 115467 event pairs, 6613 based on Foata normal form. 0/14063 useless extension candidates. Maximal degree in co-relation 35036. Up to 11689 conditions per place. [2023-11-06 22:46:40,731 INFO L140 encePairwiseOnDemand]: 444/447 looper letters, 47 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2023-11-06 22:46:40,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 75 transitions, 325 flow [2023-11-06 22:46:40,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:46:40,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:46:40,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 622 transitions. [2023-11-06 22:46:40,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4638329604772558 [2023-11-06 22:46:40,736 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 622 transitions. [2023-11-06 22:46:40,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 622 transitions. [2023-11-06 22:46:40,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:46:40,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 622 transitions. [2023-11-06 22:46:40,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 0 states 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:46:40,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 447.0) internal successors, (1788), 4 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states 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:46:40,745 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 447.0) internal successors, (1788), 4 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states 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:46:40,745 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 164 flow. Second operand 3 states and 622 transitions. [2023-11-06 22:46:40,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 75 transitions, 325 flow [2023-11-06 22:46:40,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 75 transitions, 318 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:46:40,755 INFO L231 Difference]: Finished difference. Result has 58 places, 55 transitions, 170 flow [2023-11-06 22:46:40,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=58, PETRI_TRANSITIONS=55} [2023-11-06 22:46:40,757 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2023-11-06 22:46:40,758 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 55 transitions, 170 flow [2023-11-06 22:46:40,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 0 states have call successors, (0), 0 states 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:46:40,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:40,759 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:40,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:46:40,759 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-06 22:46:40,759 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:40,760 INFO L85 PathProgramCache]: Analyzing trace with hash -44437868, now seen corresponding path program 1 times [2023-11-06 22:46:40,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:40,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971610936] [2023-11-06 22:46:40,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:40,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:40,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:46:40,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:40,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971610936] [2023-11-06 22:46:40,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971610936] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:40,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:40,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:46:40,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992555204] [2023-11-06 22:46:40,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:40,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:46:40,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:40,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:46:40,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:46:40,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 447 [2023-11-06 22:46:40,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 states 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:46:40,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:46:40,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 447 [2023-11-06 22:46:40,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:46:45,300 INFO L124 PetriNetUnfolderBase]: 27148/39748 cut-off events. [2023-11-06 22:46:45,300 INFO L125 PetriNetUnfolderBase]: For 12602/13088 co-relation queries the response was YES. [2023-11-06 22:46:45,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86646 conditions, 39748 events. 27148/39748 cut-off events. For 12602/13088 co-relation queries the response was YES. Maximal size of possible extension queue 1733. Compared 282043 event pairs, 13944 based on Foata normal form. 20/33694 useless extension candidates. Maximal degree in co-relation 86635. Up to 27347 conditions per place. [2023-11-06 22:46:45,620 INFO L140 encePairwiseOnDemand]: 440/447 looper letters, 57 selfloop transitions, 9 changer transitions 0/82 dead transitions. [2023-11-06 22:46:45,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 82 transitions, 386 flow [2023-11-06 22:46:45,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:46:45,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:46:45,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 615 transitions. [2023-11-06 22:46:45,625 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45861297539149887 [2023-11-06 22:46:45,625 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 615 transitions. [2023-11-06 22:46:45,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 615 transitions. [2023-11-06 22:46:45,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:46:45,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 615 transitions. [2023-11-06 22:46:45,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 205.0) internal successors, (615), 3 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:45,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 447.0) internal successors, (1788), 4 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states 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:46:45,635 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 447.0) internal successors, (1788), 4 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states 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:46:45,635 INFO L175 Difference]: Start difference. First operand has 58 places, 55 transitions, 170 flow. Second operand 3 states and 615 transitions. [2023-11-06 22:46:45,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 82 transitions, 386 flow [2023-11-06 22:46:45,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 82 transitions, 382 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-06 22:46:45,658 INFO L231 Difference]: Finished difference. Result has 60 places, 61 transitions, 229 flow [2023-11-06 22:46:45,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=229, PETRI_PLACES=60, PETRI_TRANSITIONS=61} [2023-11-06 22:46:45,659 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places. [2023-11-06 22:46:45,659 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 61 transitions, 229 flow [2023-11-06 22:46:45,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 states 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:46:45,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:45,660 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:45,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:46:45,661 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-06 22:46:45,661 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:45,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1289095767, now seen corresponding path program 1 times [2023-11-06 22:46:45,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:45,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235496770] [2023-11-06 22:46:45,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:45,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:45,707 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:46:45,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:45,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235496770] [2023-11-06 22:46:45,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235496770] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:45,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:45,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:46:45,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374991990] [2023-11-06 22:46:45,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:45,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:46:45,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:45,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:46:45,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:46:45,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 447 [2023-11-06 22:46:45,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 61 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 0 states 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:46:45,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:46:45,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 447 [2023-11-06 22:46:45,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:46:48,933 INFO L124 PetriNetUnfolderBase]: 17528/26228 cut-off events. [2023-11-06 22:46:48,934 INFO L125 PetriNetUnfolderBase]: For 8252/9879 co-relation queries the response was YES. [2023-11-06 22:46:49,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58291 conditions, 26228 events. 17528/26228 cut-off events. For 8252/9879 co-relation queries the response was YES. Maximal size of possible extension queue 1221. Compared 184590 event pairs, 10278 based on Foata normal form. 21/21654 useless extension candidates. Maximal degree in co-relation 58279. Up to 18416 conditions per place. [2023-11-06 22:46:49,138 INFO L140 encePairwiseOnDemand]: 444/447 looper letters, 50 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2023-11-06 22:46:49,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 83 transitions, 403 flow [2023-11-06 22:46:49,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:46:49,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:46:49,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 621 transitions. [2023-11-06 22:46:49,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46308724832214765 [2023-11-06 22:46:49,143 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 621 transitions. [2023-11-06 22:46:49,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 621 transitions. [2023-11-06 22:46:49,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:46:49,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 621 transitions. [2023-11-06 22:46:49,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 0 states 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:46:49,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 447.0) internal successors, (1788), 4 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states 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:46:49,152 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 447.0) internal successors, (1788), 4 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states 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:46:49,152 INFO L175 Difference]: Start difference. First operand has 60 places, 61 transitions, 229 flow. Second operand 3 states and 621 transitions. [2023-11-06 22:46:49,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 83 transitions, 403 flow [2023-11-06 22:46:49,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 83 transitions, 393 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:46:49,175 INFO L231 Difference]: Finished difference. Result has 62 places, 62 transitions, 232 flow [2023-11-06 22:46:49,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=62, PETRI_TRANSITIONS=62} [2023-11-06 22:46:49,176 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2023-11-06 22:46:49,176 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 62 transitions, 232 flow [2023-11-06 22:46:49,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 0 states 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:46:49,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:49,177 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:49,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 22:46:49,178 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-06 22:46:49,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:49,178 INFO L85 PathProgramCache]: Analyzing trace with hash 2081967756, now seen corresponding path program 1 times [2023-11-06 22:46:49,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:49,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257737245] [2023-11-06 22:46:49,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:49,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:49,407 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:46:49,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:49,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257737245] [2023-11-06 22:46:49,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257737245] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:49,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:49,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:46:49,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384765610] [2023-11-06 22:46:49,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:49,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:46:49,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:49,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:46:49,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:46:49,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 447 [2023-11-06 22:46:49,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 62 transitions, 232 flow. Second operand has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 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:46:49,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:46:49,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 447 [2023-11-06 22:46:49,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:46:55,777 INFO L124 PetriNetUnfolderBase]: 39033/56101 cut-off events. [2023-11-06 22:46:55,778 INFO L125 PetriNetUnfolderBase]: For 30885/32122 co-relation queries the response was YES. [2023-11-06 22:46:55,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135030 conditions, 56101 events. 39033/56101 cut-off events. For 30885/32122 co-relation queries the response was YES. Maximal size of possible extension queue 2399. Compared 399658 event pairs, 19817 based on Foata normal form. 0/48282 useless extension candidates. Maximal degree in co-relation 135017. Up to 38900 conditions per place. [2023-11-06 22:46:56,183 INFO L140 encePairwiseOnDemand]: 440/447 looper letters, 63 selfloop transitions, 14 changer transitions 0/93 dead transitions. [2023-11-06 22:46:56,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 93 transitions, 505 flow [2023-11-06 22:46:56,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:46:56,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:46:56,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 614 transitions. [2023-11-06 22:46:56,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45786726323639076 [2023-11-06 22:46:56,188 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 614 transitions. [2023-11-06 22:46:56,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 614 transitions. [2023-11-06 22:46:56,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:46:56,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 614 transitions. [2023-11-06 22:46:56,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 0 states have call successors, (0), 0 states 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:46:56,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 447.0) internal successors, (1788), 4 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states 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:46:56,197 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 447.0) internal successors, (1788), 4 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states 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:46:56,197 INFO L175 Difference]: Start difference. First operand has 62 places, 62 transitions, 232 flow. Second operand 3 states and 614 transitions. [2023-11-06 22:46:56,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 93 transitions, 505 flow [2023-11-06 22:46:56,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 93 transitions, 501 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-06 22:46:56,259 INFO L231 Difference]: Finished difference. Result has 64 places, 71 transitions, 340 flow [2023-11-06 22:46:56,259 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=64, PETRI_TRANSITIONS=71} [2023-11-06 22:46:56,260 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2023-11-06 22:46:56,260 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 71 transitions, 340 flow [2023-11-06 22:46:56,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 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:46:56,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:56,261 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:56,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 22:46:56,261 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-06 22:46:56,262 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:56,262 INFO L85 PathProgramCache]: Analyzing trace with hash -436414910, now seen corresponding path program 1 times [2023-11-06 22:46:56,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:56,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038177484] [2023-11-06 22:46:56,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:56,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:46:56,280 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:46:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:46:56,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:46:56,298 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:46:56,298 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-11-06 22:46:56,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-06 22:46:56,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-11-06 22:46:56,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2023-11-06 22:46:56,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2023-11-06 22:46:56,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-06 22:46:56,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-06 22:46:56,299 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:56,300 WARN L233 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-06 22:46:56,300 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2023-11-06 22:46:56,340 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:46:56,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 253 places, 278 transitions, 596 flow [2023-11-06 22:46:56,400 INFO L124 PetriNetUnfolderBase]: 41/341 cut-off events. [2023-11-06 22:46:56,400 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-06 22:46:56,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 341 events. 41/341 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1089 event pairs, 0 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 292. Up to 12 conditions per place. [2023-11-06 22:46:56,402 INFO L82 GeneralOperation]: Start removeDead. Operand has 253 places, 278 transitions, 596 flow [2023-11-06 22:46:56,406 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 253 places, 278 transitions, 596 flow [2023-11-06 22:46:56,407 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:46:56,407 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 253 places, 278 transitions, 596 flow [2023-11-06 22:46:56,407 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 253 places, 278 transitions, 596 flow [2023-11-06 22:46:56,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 253 places, 278 transitions, 596 flow [2023-11-06 22:46:56,475 INFO L124 PetriNetUnfolderBase]: 41/341 cut-off events. [2023-11-06 22:46:56,475 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-06 22:46:56,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 341 events. 41/341 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1089 event pairs, 0 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 292. Up to 12 conditions per place. [2023-11-06 22:46:56,503 INFO L119 LiptonReduction]: Number of co-enabled transitions 53760 [2023-11-06 22:47:02,306 INFO L134 LiptonReduction]: Checked pairs total: 77823 [2023-11-06 22:47:02,306 INFO L136 LiptonReduction]: Total number of compositions: 268 [2023-11-06 22:47:02,308 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:47:02,308 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;@52d1a6c2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:47:02,309 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-06 22:47:02,311 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:47:02,311 INFO L124 PetriNetUnfolderBase]: 2/15 cut-off events. [2023-11-06 22:47:02,311 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-06 22:47:02,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:02,312 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:47:02,312 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-11-06 22:47:02,312 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:02,312 INFO L85 PathProgramCache]: Analyzing trace with hash 752915248, now seen corresponding path program 1 times [2023-11-06 22:47:02,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:02,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044203424] [2023-11-06 22:47:02,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:02,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:02,327 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:47:02,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:02,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044203424] [2023-11-06 22:47:02,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044203424] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:02,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:02,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:47:02,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441653429] [2023-11-06 22:47:02,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:02,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:47:02,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:02,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:47:02,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:47:02,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 546 [2023-11-06 22:47:02,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 71 transitions, 182 flow. Second operand has 2 states, 2 states have (on average 243.5) internal successors, (487), 2 states have internal predecessors, (487), 0 states have call successors, (0), 0 states 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:47:02,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:02,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 546 [2023-11-06 22:47:02,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:07,446 INFO L124 PetriNetUnfolderBase]: 35548/51358 cut-off events. [2023-11-06 22:47:07,446 INFO L125 PetriNetUnfolderBase]: For 15196/15196 co-relation queries the response was YES. [2023-11-06 22:47:07,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97655 conditions, 51358 events. 35548/51358 cut-off events. For 15196/15196 co-relation queries the response was YES. Maximal size of possible extension queue 1891. Compared 354482 event pairs, 26564 based on Foata normal form. 7266/48858 useless extension candidates. Maximal degree in co-relation 16404. Up to 41799 conditions per place. [2023-11-06 22:47:07,858 INFO L140 encePairwiseOnDemand]: 535/546 looper letters, 32 selfloop transitions, 0 changer transitions 0/60 dead transitions. [2023-11-06 22:47:07,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 60 transitions, 224 flow [2023-11-06 22:47:07,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:47:07,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:47:07,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 525 transitions. [2023-11-06 22:47:07,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4807692307692308 [2023-11-06 22:47:07,861 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 525 transitions. [2023-11-06 22:47:07,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 525 transitions. [2023-11-06 22:47:07,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:07,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 525 transitions. [2023-11-06 22:47:07,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 262.5) internal successors, (525), 2 states have internal predecessors, (525), 0 states have call successors, (0), 0 states 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:47:07,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 546.0) internal successors, (1638), 3 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states 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:47:07,868 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 546.0) internal successors, (1638), 3 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states 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:47:07,869 INFO L175 Difference]: Start difference. First operand has 62 places, 71 transitions, 182 flow. Second operand 2 states and 525 transitions. [2023-11-06 22:47:07,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 60 transitions, 224 flow [2023-11-06 22:47:07,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 60 transitions, 212 flow, removed 6 selfloop flow, removed 0 redundant places. [2023-11-06 22:47:07,885 INFO L231 Difference]: Finished difference. Result has 62 places, 60 transitions, 148 flow [2023-11-06 22:47:07,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=546, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=148, PETRI_PLACES=62, PETRI_TRANSITIONS=60} [2023-11-06 22:47:07,886 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 0 predicate places. [2023-11-06 22:47:07,886 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 60 transitions, 148 flow [2023-11-06 22:47:07,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 243.5) internal successors, (487), 2 states have internal predecessors, (487), 0 states have call successors, (0), 0 states 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:47:07,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:07,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:07,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-06 22:47:07,887 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-11-06 22:47:07,888 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:07,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1663975988, now seen corresponding path program 1 times [2023-11-06 22:47:07,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:07,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494386859] [2023-11-06 22:47:07,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:07,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:07,917 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:47:07,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:07,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494386859] [2023-11-06 22:47:07,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494386859] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:07,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:07,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:47:07,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122079722] [2023-11-06 22:47:07,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:07,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:47:07,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:07,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:47:07,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:47:07,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 546 [2023-11-06 22:47:07,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 60 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 states 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:47:07,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:07,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 546 [2023-11-06 22:47:07,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand