./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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_4240bfd8-1623-4faf-a36f-f45396075018/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4240bfd8-1623-4faf-a36f-f45396075018/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_4240bfd8-1623-4faf-a36f-f45396075018/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4240bfd8-1623-4faf-a36f-f45396075018/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4240bfd8-1623-4faf-a36f-f45396075018/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_4240bfd8-1623-4faf-a36f-f45396075018/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 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:06:21,210 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:06:21,286 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4240bfd8-1623-4faf-a36f-f45396075018/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:06:21,291 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:06:21,291 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:06:21,318 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:06:21,318 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:06:21,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:06:21,320 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:06:21,321 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:06:21,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:06:21,322 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:06:21,322 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:06:21,323 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:06:21,324 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:06:21,324 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:06:21,325 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:06:21,325 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:06:21,325 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:06:21,326 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:06:21,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:06:21,327 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:06:21,327 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:06:21,328 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:06:21,328 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:06:21,329 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:06:21,329 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:06:21,329 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:06:21,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:06:21,330 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:06:21,331 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:06:21,331 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:06:21,331 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:06:21,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:06:21,332 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:06:21,332 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:06:21,332 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:06:21,333 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:06:21,333 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:06:21,333 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_4240bfd8-1623-4faf-a36f-f45396075018/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_4240bfd8-1623-4faf-a36f-f45396075018/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 -> 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 [2023-11-06 22:06:21,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:06:21,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:06:21,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:06:21,622 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:06:21,622 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:06:21,624 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4240bfd8-1623-4faf-a36f-f45396075018/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-06 22:06:24,685 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:06:24,969 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:06:24,969 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4240bfd8-1623-4faf-a36f-f45396075018/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-06 22:06:24,998 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4240bfd8-1623-4faf-a36f-f45396075018/bin/uautomizer-verify-WvqO1wxjHP/data/f29a57197/0d4254f60b3249f385bd165f32159a01/FLAGf1c6505de [2023-11-06 22:06:25,019 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4240bfd8-1623-4faf-a36f-f45396075018/bin/uautomizer-verify-WvqO1wxjHP/data/f29a57197/0d4254f60b3249f385bd165f32159a01 [2023-11-06 22:06:25,029 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:06:25,031 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:06:25,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:06:25,036 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:06:25,041 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:06:25,042 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:06:25" (1/1) ... [2023-11-06 22:06:25,043 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4abb379 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:25, skipping insertion in model container [2023-11-06 22:06:25,044 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:06:25" (1/1) ... [2023-11-06 22:06:25,122 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:06:25,360 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_4240bfd8-1623-4faf-a36f-f45396075018/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-11-06 22:06:25,694 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:06:25,706 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:06:25,720 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_4240bfd8-1623-4faf-a36f-f45396075018/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-11-06 22:06:25,809 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:06:25,853 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:06:25,853 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:06:25,864 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:06:25,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:25 WrapperNode [2023-11-06 22:06:25,865 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:06:25,866 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:06:25,866 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:06:25,867 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:06:25,875 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:06:25" (1/1) ... [2023-11-06 22:06:25,920 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:06:25" (1/1) ... [2023-11-06 22:06:25,957 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2023-11-06 22:06:25,958 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:06:25,959 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:06:25,959 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:06:25,959 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:06:25,970 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:25" (1/1) ... [2023-11-06 22:06:25,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:25" (1/1) ... [2023-11-06 22:06:25,985 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:25" (1/1) ... [2023-11-06 22:06:25,995 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:25" (1/1) ... [2023-11-06 22:06:26,006 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:25" (1/1) ... [2023-11-06 22:06:26,018 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:25" (1/1) ... [2023-11-06 22:06:26,020 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:25" (1/1) ... [2023-11-06 22:06:26,023 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:25" (1/1) ... [2023-11-06 22:06:26,040 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:06:26,041 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:06:26,041 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:06:26,041 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:06:26,042 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:25" (1/1) ... [2023-11-06 22:06:26,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:06:26,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4240bfd8-1623-4faf-a36f-f45396075018/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:06:26,091 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4240bfd8-1623-4faf-a36f-f45396075018/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:06:26,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4240bfd8-1623-4faf-a36f-f45396075018/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:06:26,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:06:26,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:06:26,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:06:26,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:06:26,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:06:26,140 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:06:26,140 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:06:26,140 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:06:26,140 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:06:26,140 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:06:26,142 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:06:26,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:06:26,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:06:26,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:06:26,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:06:26,145 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:06:26,310 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:06:26,312 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:06:26,711 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:06:27,057 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:06:27,057 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:06:27,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:06:27 BoogieIcfgContainer [2023-11-06 22:06:27,060 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:06:27,062 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:06:27,063 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:06:27,066 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:06:27,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:06:25" (1/3) ... [2023-11-06 22:06:27,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6560e469 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:06:27, skipping insertion in model container [2023-11-06 22:06:27,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:25" (2/3) ... [2023-11-06 22:06:27,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6560e469 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:06:27, skipping insertion in model container [2023-11-06 22:06:27,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:06:27" (3/3) ... [2023-11-06 22:06:27,069 INFO L112 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-06 22:06:27,078 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 22:06:27,089 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:06:27,090 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-06 22:06:27,090 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:06:27,153 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:06:27,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 232 flow [2023-11-06 22:06:27,290 INFO L124 PetriNetUnfolderBase]: 2/107 cut-off events. [2023-11-06 22:06:27,290 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:06:27,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2023-11-06 22:06:27,297 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 110 transitions, 232 flow [2023-11-06 22:06:27,304 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 107 transitions, 223 flow [2023-11-06 22:06:27,309 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:06:27,332 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 107 transitions, 223 flow [2023-11-06 22:06:27,334 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 107 transitions, 223 flow [2023-11-06 22:06:27,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 223 flow [2023-11-06 22:06:27,363 INFO L124 PetriNetUnfolderBase]: 2/107 cut-off events. [2023-11-06 22:06:27,363 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:06:27,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2023-11-06 22:06:27,366 INFO L119 LiptonReduction]: Number of co-enabled transitions 2052 [2023-11-06 22:06:31,794 INFO L134 LiptonReduction]: Checked pairs total: 5199 [2023-11-06 22:06:31,794 INFO L136 LiptonReduction]: Total number of compositions: 93 [2023-11-06 22:06:31,809 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:06:31,817 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;@63c934db, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:06:31,817 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-06 22:06:31,828 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:06:31,834 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-11-06 22:06:31,834 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:06:31,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:06:31,834 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:31,835 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:06:31,840 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:31,840 INFO L85 PathProgramCache]: Analyzing trace with hash 41533709, now seen corresponding path program 1 times [2023-11-06 22:06:31,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:31,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863940998] [2023-11-06 22:06:31,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:31,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:32,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:32,404 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:06:32,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:32,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863940998] [2023-11-06 22:06:32,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863940998] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:32,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:32,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:06:32,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247750642] [2023-11-06 22:06:32,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:32,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:06:32,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:32,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:06:32,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:06:32,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 203 [2023-11-06 22:06:32,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:32,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:06:32,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 203 [2023-11-06 22:06:32,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:06:33,071 INFO L124 PetriNetUnfolderBase]: 1555/2452 cut-off events. [2023-11-06 22:06:33,071 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-11-06 22:06:33,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4799 conditions, 2452 events. 1555/2452 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 12269 event pairs, 325 based on Foata normal form. 96/2356 useless extension candidates. Maximal degree in co-relation 4788. Up to 1735 conditions per place. [2023-11-06 22:06:33,100 INFO L140 encePairwiseOnDemand]: 199/203 looper letters, 31 selfloop transitions, 2 changer transitions 4/38 dead transitions. [2023-11-06 22:06:33,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 38 transitions, 159 flow [2023-11-06 22:06:33,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:06:33,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:06:33,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 322 transitions. [2023-11-06 22:06:33,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5287356321839081 [2023-11-06 22:06:33,126 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 322 transitions. [2023-11-06 22:06:33,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 322 transitions. [2023-11-06 22:06:33,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:06:33,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 322 transitions. [2023-11-06 22:06:33,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:33,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:33,146 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:33,148 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 322 transitions. [2023-11-06 22:06:33,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 38 transitions, 159 flow [2023-11-06 22:06:33,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 38 transitions, 156 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:06:33,154 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2023-11-06 22:06:33,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-11-06 22:06:33,159 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2023-11-06 22:06:33,160 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2023-11-06 22:06:33,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:33,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:06:33,161 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:33,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:06:33,161 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:06:33,162 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:33,162 INFO L85 PathProgramCache]: Analyzing trace with hash 381668258, now seen corresponding path program 1 times [2023-11-06 22:06:33,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:33,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908848372] [2023-11-06 22:06:33,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:33,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:33,955 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:06:33,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:33,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908848372] [2023-11-06 22:06:33,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908848372] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:33,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:33,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:06:33,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673812174] [2023-11-06 22:06:33,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:33,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:06:33,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:33,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:06:33,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:06:34,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 203 [2023-11-06 22:06:34,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:34,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:06:34,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 203 [2023-11-06 22:06:34,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:06:34,946 INFO L124 PetriNetUnfolderBase]: 1783/2662 cut-off events. [2023-11-06 22:06:34,947 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2023-11-06 22:06:34,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5518 conditions, 2662 events. 1783/2662 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 12257 event pairs, 365 based on Foata normal form. 142/2804 useless extension candidates. Maximal degree in co-relation 5508. Up to 1971 conditions per place. [2023-11-06 22:06:34,968 INFO L140 encePairwiseOnDemand]: 192/203 looper letters, 37 selfloop transitions, 11 changer transitions 31/79 dead transitions. [2023-11-06 22:06:34,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 79 transitions, 336 flow [2023-11-06 22:06:34,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:06:34,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:06:34,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 670 transitions. [2023-11-06 22:06:34,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47149894440534834 [2023-11-06 22:06:34,974 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 670 transitions. [2023-11-06 22:06:34,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 670 transitions. [2023-11-06 22:06:34,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:06:34,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 670 transitions. [2023-11-06 22:06:34,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 95.71428571428571) internal successors, (670), 7 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:34,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 203.0) internal successors, (1624), 8 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:34,988 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 203.0) internal successors, (1624), 8 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:34,989 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 7 states and 670 transitions. [2023-11-06 22:06:34,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 79 transitions, 336 flow [2023-11-06 22:06:34,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 79 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:06:34,995 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 136 flow [2023-11-06 22:06:34,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=136, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2023-11-06 22:06:34,998 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2023-11-06 22:06:35,004 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 136 flow [2023-11-06 22:06:35,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:35,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:06:35,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:35,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:06:35,006 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:06:35,010 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:35,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1053185783, now seen corresponding path program 1 times [2023-11-06 22:06:35,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:35,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075540412] [2023-11-06 22:06:35,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:35,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:35,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:35,559 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:06:35,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:35,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075540412] [2023-11-06 22:06:35,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075540412] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:35,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:35,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:06:35,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359700414] [2023-11-06 22:06:35,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:35,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:06:35,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:35,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:06:35,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:06:35,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 203 [2023-11-06 22:06:35,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 86.2) internal successors, (431), 5 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:35,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:06:35,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 203 [2023-11-06 22:06:35,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:06:36,394 INFO L124 PetriNetUnfolderBase]: 1463/2200 cut-off events. [2023-11-06 22:06:36,394 INFO L125 PetriNetUnfolderBase]: For 1835/1835 co-relation queries the response was YES. [2023-11-06 22:06:36,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6908 conditions, 2200 events. 1463/2200 cut-off events. For 1835/1835 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 9569 event pairs, 426 based on Foata normal form. 126/2326 useless extension candidates. Maximal degree in co-relation 6893. Up to 1054 conditions per place. [2023-11-06 22:06:36,416 INFO L140 encePairwiseOnDemand]: 193/203 looper letters, 42 selfloop transitions, 10 changer transitions 29/81 dead transitions. [2023-11-06 22:06:36,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 81 transitions, 503 flow [2023-11-06 22:06:36,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:06:36,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:06:36,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 658 transitions. [2023-11-06 22:06:36,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4630541871921182 [2023-11-06 22:06:36,421 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 658 transitions. [2023-11-06 22:06:36,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 658 transitions. [2023-11-06 22:06:36,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:06:36,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 658 transitions. [2023-11-06 22:06:36,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.0) internal successors, (658), 7 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:36,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 203.0) internal successors, (1624), 8 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:36,429 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 203.0) internal successors, (1624), 8 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:36,429 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 136 flow. Second operand 7 states and 658 transitions. [2023-11-06 22:06:36,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 81 transitions, 503 flow [2023-11-06 22:06:36,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 81 transitions, 495 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-06 22:06:36,444 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 229 flow [2023-11-06 22:06:36,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=229, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2023-11-06 22:06:36,445 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 12 predicate places. [2023-11-06 22:06:36,445 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 229 flow [2023-11-06 22:06:36,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.2) internal successors, (431), 5 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:36,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:06:36,446 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:36,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:06:36,446 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:06:36,447 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:36,447 INFO L85 PathProgramCache]: Analyzing trace with hash 814865143, now seen corresponding path program 1 times [2023-11-06 22:06:36,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:36,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953109674] [2023-11-06 22:06:36,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:36,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:37,483 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:06:37,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:37,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953109674] [2023-11-06 22:06:37,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953109674] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:37,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:37,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:06:37,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255825141] [2023-11-06 22:06:37,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:37,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:06:37,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:37,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:06:37,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:06:37,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 203 [2023-11-06 22:06:37,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 229 flow. Second operand has 8 states, 8 states have (on average 91.75) internal successors, (734), 8 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:37,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:06:37,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 203 [2023-11-06 22:06:37,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:06:38,253 INFO L124 PetriNetUnfolderBase]: 1384/2141 cut-off events. [2023-11-06 22:06:38,254 INFO L125 PetriNetUnfolderBase]: For 3362/3374 co-relation queries the response was YES. [2023-11-06 22:06:38,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7417 conditions, 2141 events. 1384/2141 cut-off events. For 3362/3374 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9854 event pairs, 93 based on Foata normal form. 56/2197 useless extension candidates. Maximal degree in co-relation 7396. Up to 1393 conditions per place. [2023-11-06 22:06:38,277 INFO L140 encePairwiseOnDemand]: 195/203 looper letters, 59 selfloop transitions, 11 changer transitions 16/90 dead transitions. [2023-11-06 22:06:38,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 90 transitions, 643 flow [2023-11-06 22:06:38,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:06:38,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:06:38,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 703 transitions. [2023-11-06 22:06:38,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49472202674173116 [2023-11-06 22:06:38,281 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 703 transitions. [2023-11-06 22:06:38,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 703 transitions. [2023-11-06 22:06:38,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:06:38,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 703 transitions. [2023-11-06 22:06:38,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.42857142857143) internal successors, (703), 7 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:38,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 203.0) internal successors, (1624), 8 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:38,289 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 203.0) internal successors, (1624), 8 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:38,289 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 229 flow. Second operand 7 states and 703 transitions. [2023-11-06 22:06:38,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 90 transitions, 643 flow [2023-11-06 22:06:38,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 90 transitions, 626 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-11-06 22:06:38,306 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 317 flow [2023-11-06 22:06:38,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=317, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2023-11-06 22:06:38,307 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 18 predicate places. [2023-11-06 22:06:38,307 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 317 flow [2023-11-06 22:06:38,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.75) internal successors, (734), 8 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:38,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:06:38,308 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:38,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:06:38,309 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:06:38,309 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:38,309 INFO L85 PathProgramCache]: Analyzing trace with hash -828822297, now seen corresponding path program 2 times [2023-11-06 22:06:38,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:38,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286484644] [2023-11-06 22:06:38,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:38,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:39,060 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:06:39,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:39,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286484644] [2023-11-06 22:06:39,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286484644] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:39,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:39,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:06:39,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552893387] [2023-11-06 22:06:39,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:39,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:06:39,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:39,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:06:39,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:06:39,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 203 [2023-11-06 22:06:39,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 317 flow. Second operand has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:39,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:06:39,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 203 [2023-11-06 22:06:39,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:06:39,765 INFO L124 PetriNetUnfolderBase]: 1372/2120 cut-off events. [2023-11-06 22:06:39,766 INFO L125 PetriNetUnfolderBase]: For 4880/4927 co-relation queries the response was YES. [2023-11-06 22:06:39,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8450 conditions, 2120 events. 1372/2120 cut-off events. For 4880/4927 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9784 event pairs, 190 based on Foata normal form. 93/2213 useless extension candidates. Maximal degree in co-relation 8424. Up to 1395 conditions per place. [2023-11-06 22:06:39,791 INFO L140 encePairwiseOnDemand]: 193/203 looper letters, 55 selfloop transitions, 20 changer transitions 19/98 dead transitions. [2023-11-06 22:06:39,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 98 transitions, 811 flow [2023-11-06 22:06:39,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:06:39,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:06:39,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 784 transitions. [2023-11-06 22:06:39,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4827586206896552 [2023-11-06 22:06:39,796 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 784 transitions. [2023-11-06 22:06:39,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 784 transitions. [2023-11-06 22:06:39,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:06:39,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 784 transitions. [2023-11-06 22:06:39,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:39,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 203.0) internal successors, (1827), 9 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:39,803 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 203.0) internal successors, (1827), 9 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:39,803 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 317 flow. Second operand 8 states and 784 transitions. [2023-11-06 22:06:39,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 98 transitions, 811 flow [2023-11-06 22:06:39,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 98 transitions, 797 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-11-06 22:06:39,822 INFO L231 Difference]: Finished difference. Result has 60 places, 60 transitions, 514 flow [2023-11-06 22:06:39,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=514, PETRI_PLACES=60, PETRI_TRANSITIONS=60} [2023-11-06 22:06:39,825 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 25 predicate places. [2023-11-06 22:06:39,825 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 60 transitions, 514 flow [2023-11-06 22:06:39,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:39,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:06:39,826 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:39,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:06:39,827 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:06:39,827 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:39,827 INFO L85 PathProgramCache]: Analyzing trace with hash -520343053, now seen corresponding path program 1 times [2023-11-06 22:06:39,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:39,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839088405] [2023-11-06 22:06:39,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:39,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:40,715 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:06:40,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:40,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839088405] [2023-11-06 22:06:40,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839088405] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:40,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:40,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:06:40,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927870919] [2023-11-06 22:06:40,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:40,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:06:40,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:40,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:06:40,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:06:40,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 203 [2023-11-06 22:06:40,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 60 transitions, 514 flow. Second operand has 6 states, 6 states have (on average 91.5) internal successors, (549), 6 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:40,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:06:40,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 203 [2023-11-06 22:06:40,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:06:41,693 INFO L124 PetriNetUnfolderBase]: 1774/2756 cut-off events. [2023-11-06 22:06:41,693 INFO L125 PetriNetUnfolderBase]: For 9559/9582 co-relation queries the response was YES. [2023-11-06 22:06:41,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12683 conditions, 2756 events. 1774/2756 cut-off events. For 9559/9582 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 13491 event pairs, 111 based on Foata normal form. 53/2809 useless extension candidates. Maximal degree in co-relation 12653. Up to 1281 conditions per place. [2023-11-06 22:06:41,739 INFO L140 encePairwiseOnDemand]: 192/203 looper letters, 92 selfloop transitions, 52 changer transitions 31/179 dead transitions. [2023-11-06 22:06:41,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 179 transitions, 1775 flow [2023-11-06 22:06:41,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:06:41,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-06 22:06:41,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1091 transitions. [2023-11-06 22:06:41,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4885803851321093 [2023-11-06 22:06:41,745 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1091 transitions. [2023-11-06 22:06:41,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1091 transitions. [2023-11-06 22:06:41,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:06:41,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1091 transitions. [2023-11-06 22:06:41,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 99.18181818181819) internal successors, (1091), 11 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:41,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 203.0) internal successors, (2436), 12 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:41,757 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 203.0) internal successors, (2436), 12 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:41,757 INFO L175 Difference]: Start difference. First operand has 60 places, 60 transitions, 514 flow. Second operand 11 states and 1091 transitions. [2023-11-06 22:06:41,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 179 transitions, 1775 flow [2023-11-06 22:06:41,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 179 transitions, 1659 flow, removed 51 selfloop flow, removed 4 redundant places. [2023-11-06 22:06:41,814 INFO L231 Difference]: Finished difference. Result has 71 places, 98 transitions, 1056 flow [2023-11-06 22:06:41,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1056, PETRI_PLACES=71, PETRI_TRANSITIONS=98} [2023-11-06 22:06:41,817 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 36 predicate places. [2023-11-06 22:06:41,817 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 98 transitions, 1056 flow [2023-11-06 22:06:41,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.5) internal successors, (549), 6 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:41,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:06:41,818 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:41,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:06:41,818 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:06:41,819 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:41,819 INFO L85 PathProgramCache]: Analyzing trace with hash -589498535, now seen corresponding path program 1 times [2023-11-06 22:06:41,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:41,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214660716] [2023-11-06 22:06:41,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:41,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:42,834 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:06:42,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:42,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214660716] [2023-11-06 22:06:42,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214660716] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:42,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:42,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:06:42,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784214995] [2023-11-06 22:06:42,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:42,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:06:42,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:42,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:06:42,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:06:42,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 203 [2023-11-06 22:06:42,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 98 transitions, 1056 flow. Second operand has 9 states, 9 states have (on average 90.66666666666667) internal successors, (816), 9 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:42,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:06:42,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 203 [2023-11-06 22:06:42,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:06:43,725 INFO L124 PetriNetUnfolderBase]: 1520/2368 cut-off events. [2023-11-06 22:06:43,725 INFO L125 PetriNetUnfolderBase]: For 14749/14770 co-relation queries the response was YES. [2023-11-06 22:06:43,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13113 conditions, 2368 events. 1520/2368 cut-off events. For 14749/14770 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 11193 event pairs, 111 based on Foata normal form. 57/2425 useless extension candidates. Maximal degree in co-relation 13077. Up to 1656 conditions per place. [2023-11-06 22:06:43,755 INFO L140 encePairwiseOnDemand]: 198/203 looper letters, 91 selfloop transitions, 22 changer transitions 15/132 dead transitions. [2023-11-06 22:06:43,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 132 transitions, 1623 flow [2023-11-06 22:06:43,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:06:43,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:06:43,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 587 transitions. [2023-11-06 22:06:43,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4819376026272578 [2023-11-06 22:06:43,759 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 587 transitions. [2023-11-06 22:06:43,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 587 transitions. [2023-11-06 22:06:43,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:06:43,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 587 transitions. [2023-11-06 22:06:43,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:43,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 203.0) internal successors, (1421), 7 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:43,765 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 203.0) internal successors, (1421), 7 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:43,766 INFO L175 Difference]: Start difference. First operand has 71 places, 98 transitions, 1056 flow. Second operand 6 states and 587 transitions. [2023-11-06 22:06:43,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 132 transitions, 1623 flow [2023-11-06 22:06:43,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 132 transitions, 1542 flow, removed 30 selfloop flow, removed 3 redundant places. [2023-11-06 22:06:43,832 INFO L231 Difference]: Finished difference. Result has 74 places, 102 transitions, 1090 flow [2023-11-06 22:06:43,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=983, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1090, PETRI_PLACES=74, PETRI_TRANSITIONS=102} [2023-11-06 22:06:43,833 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 39 predicate places. [2023-11-06 22:06:43,833 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 102 transitions, 1090 flow [2023-11-06 22:06:43,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 90.66666666666667) internal successors, (816), 9 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:43,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:06:43,834 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:43,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:06:43,835 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:06:43,835 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:43,835 INFO L85 PathProgramCache]: Analyzing trace with hash 75884070, now seen corresponding path program 1 times [2023-11-06 22:06:43,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:43,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958197642] [2023-11-06 22:06:43,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:43,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:43,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:44,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:06:44,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:44,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958197642] [2023-11-06 22:06:44,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958197642] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:44,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:44,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:06:44,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861141211] [2023-11-06 22:06:44,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:44,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:06:44,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:44,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:06:44,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:06:45,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 203 [2023-11-06 22:06:45,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 102 transitions, 1090 flow. Second operand has 8 states, 8 states have (on average 89.875) internal successors, (719), 8 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:45,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:06:45,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 203 [2023-11-06 22:06:45,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:06:46,047 INFO L124 PetriNetUnfolderBase]: 1873/2907 cut-off events. [2023-11-06 22:06:46,048 INFO L125 PetriNetUnfolderBase]: For 19204/19273 co-relation queries the response was YES. [2023-11-06 22:06:46,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16154 conditions, 2907 events. 1873/2907 cut-off events. For 19204/19273 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 14625 event pairs, 131 based on Foata normal form. 120/3011 useless extension candidates. Maximal degree in co-relation 16116. Up to 1768 conditions per place. [2023-11-06 22:06:46,077 INFO L140 encePairwiseOnDemand]: 192/203 looper letters, 96 selfloop transitions, 60 changer transitions 21/181 dead transitions. [2023-11-06 22:06:46,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 181 transitions, 2209 flow [2023-11-06 22:06:46,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:06:46,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:06:46,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 685 transitions. [2023-11-06 22:06:46,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48205489092188597 [2023-11-06 22:06:46,081 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 685 transitions. [2023-11-06 22:06:46,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 685 transitions. [2023-11-06 22:06:46,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:06:46,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 685 transitions. [2023-11-06 22:06:46,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:46,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 203.0) internal successors, (1624), 8 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:46,089 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 203.0) internal successors, (1624), 8 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:46,089 INFO L175 Difference]: Start difference. First operand has 74 places, 102 transitions, 1090 flow. Second operand 7 states and 685 transitions. [2023-11-06 22:06:46,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 181 transitions, 2209 flow [2023-11-06 22:06:46,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 181 transitions, 2184 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-06 22:06:46,149 INFO L231 Difference]: Finished difference. Result has 79 places, 132 transitions, 1655 flow [2023-11-06 22:06:46,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=1069, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1655, PETRI_PLACES=79, PETRI_TRANSITIONS=132} [2023-11-06 22:06:46,150 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 44 predicate places. [2023-11-06 22:06:46,150 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 132 transitions, 1655 flow [2023-11-06 22:06:46,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 89.875) internal successors, (719), 8 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:46,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:06:46,151 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:46,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:06:46,152 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:06:46,152 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:46,153 INFO L85 PathProgramCache]: Analyzing trace with hash 76316520, now seen corresponding path program 2 times [2023-11-06 22:06:46,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:46,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62157302] [2023-11-06 22:06:46,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:46,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:46,886 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:06:46,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:46,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62157302] [2023-11-06 22:06:46,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62157302] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:46,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:46,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:06:46,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592119497] [2023-11-06 22:06:46,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:46,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:06:46,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:46,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:06:46,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:06:46,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 203 [2023-11-06 22:06:46,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 132 transitions, 1655 flow. Second operand has 7 states, 7 states have (on average 90.14285714285714) internal successors, (631), 7 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:46,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:06:46,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 203 [2023-11-06 22:06:46,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:06:47,915 INFO L124 PetriNetUnfolderBase]: 1867/2901 cut-off events. [2023-11-06 22:06:47,915 INFO L125 PetriNetUnfolderBase]: For 26405/26474 co-relation queries the response was YES. [2023-11-06 22:06:47,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18135 conditions, 2901 events. 1867/2901 cut-off events. For 26405/26474 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 14693 event pairs, 168 based on Foata normal form. 99/2990 useless extension candidates. Maximal degree in co-relation 18094. Up to 1948 conditions per place. [2023-11-06 22:06:47,947 INFO L140 encePairwiseOnDemand]: 193/203 looper letters, 102 selfloop transitions, 84 changer transitions 18/208 dead transitions. [2023-11-06 22:06:47,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 208 transitions, 2924 flow [2023-11-06 22:06:47,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:06:47,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:06:47,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 778 transitions. [2023-11-06 22:06:47,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.479064039408867 [2023-11-06 22:06:47,951 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 778 transitions. [2023-11-06 22:06:47,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 778 transitions. [2023-11-06 22:06:47,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:06:47,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 778 transitions. [2023-11-06 22:06:47,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 97.25) internal successors, (778), 8 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:47,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 203.0) internal successors, (1827), 9 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:47,960 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 203.0) internal successors, (1827), 9 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:47,960 INFO L175 Difference]: Start difference. First operand has 79 places, 132 transitions, 1655 flow. Second operand 8 states and 778 transitions. [2023-11-06 22:06:47,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 208 transitions, 2924 flow [2023-11-06 22:06:48,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 208 transitions, 2806 flow, removed 33 selfloop flow, removed 2 redundant places. [2023-11-06 22:06:48,077 INFO L231 Difference]: Finished difference. Result has 85 places, 162 transitions, 2263 flow [2023-11-06 22:06:48,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=1572, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2263, PETRI_PLACES=85, PETRI_TRANSITIONS=162} [2023-11-06 22:06:48,078 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 50 predicate places. [2023-11-06 22:06:48,079 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 162 transitions, 2263 flow [2023-11-06 22:06:48,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.14285714285714) internal successors, (631), 7 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:48,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:06:48,079 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:48,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:06:48,080 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:06:48,080 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:48,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1628208654, now seen corresponding path program 3 times [2023-11-06 22:06:48,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:48,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539448540] [2023-11-06 22:06:48,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:48,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:48,942 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:06:48,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:48,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539448540] [2023-11-06 22:06:48,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539448540] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:48,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:48,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:06:48,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484489340] [2023-11-06 22:06:48,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:48,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:06:48,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:48,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:06:48,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:06:48,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 203 [2023-11-06 22:06:48,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 162 transitions, 2263 flow. Second operand has 6 states, 6 states have (on average 90.5) internal successors, (543), 6 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:48,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:06:48,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 203 [2023-11-06 22:06:48,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:06:50,143 INFO L124 PetriNetUnfolderBase]: 2107/3277 cut-off events. [2023-11-06 22:06:50,143 INFO L125 PetriNetUnfolderBase]: For 38861/38956 co-relation queries the response was YES. [2023-11-06 22:06:50,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22375 conditions, 3277 events. 2107/3277 cut-off events. For 38861/38956 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 17040 event pairs, 198 based on Foata normal form. 132/3393 useless extension candidates. Maximal degree in co-relation 22331. Up to 1853 conditions per place. [2023-11-06 22:06:50,188 INFO L140 encePairwiseOnDemand]: 194/203 looper letters, 113 selfloop transitions, 120 changer transitions 19/256 dead transitions. [2023-11-06 22:06:50,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 256 transitions, 3991 flow [2023-11-06 22:06:50,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:06:50,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:06:50,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 872 transitions. [2023-11-06 22:06:50,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47728516694033934 [2023-11-06 22:06:50,194 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 872 transitions. [2023-11-06 22:06:50,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 872 transitions. [2023-11-06 22:06:50,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:06:50,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 872 transitions. [2023-11-06 22:06:50,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.88888888888889) internal successors, (872), 9 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:50,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 203.0) internal successors, (2030), 10 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:50,204 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 203.0) internal successors, (2030), 10 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:50,205 INFO L175 Difference]: Start difference. First operand has 85 places, 162 transitions, 2263 flow. Second operand 9 states and 872 transitions. [2023-11-06 22:06:50,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 256 transitions, 3991 flow [2023-11-06 22:06:50,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 256 transitions, 3742 flow, removed 70 selfloop flow, removed 5 redundant places. [2023-11-06 22:06:50,346 INFO L231 Difference]: Finished difference. Result has 91 places, 196 transitions, 3053 flow [2023-11-06 22:06:50,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=2095, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3053, PETRI_PLACES=91, PETRI_TRANSITIONS=196} [2023-11-06 22:06:50,348 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 56 predicate places. [2023-11-06 22:06:50,348 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 196 transitions, 3053 flow [2023-11-06 22:06:50,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.5) internal successors, (543), 6 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:50,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:06:50,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:50,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:06:50,349 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:06:50,350 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:50,350 INFO L85 PathProgramCache]: Analyzing trace with hash 61834776, now seen corresponding path program 4 times [2023-11-06 22:06:50,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:50,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497088206] [2023-11-06 22:06:50,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:50,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:51,286 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:06:51,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:51,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497088206] [2023-11-06 22:06:51,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497088206] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:51,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:51,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:06:51,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605332720] [2023-11-06 22:06:51,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:51,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:06:51,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:51,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:06:51,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:06:51,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 203 [2023-11-06 22:06:51,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 196 transitions, 3053 flow. Second operand has 9 states, 9 states have (on average 90.66666666666667) internal successors, (816), 9 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:51,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:06:51,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 203 [2023-11-06 22:06:51,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:06:52,769 INFO L124 PetriNetUnfolderBase]: 2382/3692 cut-off events. [2023-11-06 22:06:52,769 INFO L125 PetriNetUnfolderBase]: For 53200/53312 co-relation queries the response was YES. [2023-11-06 22:06:52,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26891 conditions, 3692 events. 2382/3692 cut-off events. For 53200/53312 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 19686 event pairs, 142 based on Foata normal form. 173/3865 useless extension candidates. Maximal degree in co-relation 26844. Up to 1980 conditions per place. [2023-11-06 22:06:52,811 INFO L140 encePairwiseOnDemand]: 192/203 looper letters, 125 selfloop transitions, 141 changer transitions 28/298 dead transitions. [2023-11-06 22:06:52,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 298 transitions, 4844 flow [2023-11-06 22:06:52,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:06:52,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-06 22:06:52,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1177 transitions. [2023-11-06 22:06:52,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48316912972085385 [2023-11-06 22:06:52,818 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1177 transitions. [2023-11-06 22:06:52,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1177 transitions. [2023-11-06 22:06:52,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:06:52,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1177 transitions. [2023-11-06 22:06:52,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 98.08333333333333) internal successors, (1177), 12 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:52,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 203.0) internal successors, (2639), 13 states have internal predecessors, (2639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:52,830 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 203.0) internal successors, (2639), 13 states have internal predecessors, (2639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:52,830 INFO L175 Difference]: Start difference. First operand has 91 places, 196 transitions, 3053 flow. Second operand 12 states and 1177 transitions. [2023-11-06 22:06:52,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 298 transitions, 4844 flow [2023-11-06 22:06:53,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 298 transitions, 4696 flow, removed 74 selfloop flow, removed 2 redundant places. [2023-11-06 22:06:53,008 INFO L231 Difference]: Finished difference. Result has 105 places, 215 transitions, 3697 flow [2023-11-06 22:06:53,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=2941, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3697, PETRI_PLACES=105, PETRI_TRANSITIONS=215} [2023-11-06 22:06:53,009 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 70 predicate places. [2023-11-06 22:06:53,010 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 215 transitions, 3697 flow [2023-11-06 22:06:53,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 90.66666666666667) internal successors, (816), 9 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:53,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:06:53,014 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:53,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:06:53,014 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:06:53,014 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:53,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1989745816, now seen corresponding path program 5 times [2023-11-06 22:06:53,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:53,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229658970] [2023-11-06 22:06:53,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:53,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:54,070 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:06:54,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:54,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229658970] [2023-11-06 22:06:54,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229658970] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:54,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:54,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:06:54,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311700578] [2023-11-06 22:06:54,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:54,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:06:54,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:54,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:06:54,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:06:54,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 203 [2023-11-06 22:06:54,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 215 transitions, 3697 flow. Second operand has 9 states, 9 states have (on average 86.66666666666667) internal successors, (780), 9 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:54,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:06:54,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 203 [2023-11-06 22:06:54,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:06:55,748 INFO L124 PetriNetUnfolderBase]: 2978/4664 cut-off events. [2023-11-06 22:06:55,748 INFO L125 PetriNetUnfolderBase]: For 76277/76474 co-relation queries the response was YES. [2023-11-06 22:06:55,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36466 conditions, 4664 events. 2978/4664 cut-off events. For 76277/76474 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 26659 event pairs, 161 based on Foata normal form. 216/4878 useless extension candidates. Maximal degree in co-relation 36412. Up to 2470 conditions per place. [2023-11-06 22:06:55,803 INFO L140 encePairwiseOnDemand]: 192/203 looper letters, 144 selfloop transitions, 195 changer transitions 21/364 dead transitions. [2023-11-06 22:06:55,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 364 transitions, 6814 flow [2023-11-06 22:06:55,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:06:55,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:06:55,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 761 transitions. [2023-11-06 22:06:55,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4685960591133005 [2023-11-06 22:06:55,808 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 761 transitions. [2023-11-06 22:06:55,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 761 transitions. [2023-11-06 22:06:55,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:06:55,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 761 transitions. [2023-11-06 22:06:55,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 95.125) internal successors, (761), 8 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:55,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 203.0) internal successors, (1827), 9 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:55,816 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 203.0) internal successors, (1827), 9 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:55,817 INFO L175 Difference]: Start difference. First operand has 105 places, 215 transitions, 3697 flow. Second operand 8 states and 761 transitions. [2023-11-06 22:06:55,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 364 transitions, 6814 flow [2023-11-06 22:06:56,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 364 transitions, 6521 flow, removed 59 selfloop flow, removed 5 redundant places. [2023-11-06 22:06:56,150 INFO L231 Difference]: Finished difference. Result has 109 places, 300 transitions, 5760 flow [2023-11-06 22:06:56,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=3496, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5760, PETRI_PLACES=109, PETRI_TRANSITIONS=300} [2023-11-06 22:06:56,153 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 74 predicate places. [2023-11-06 22:06:56,154 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 300 transitions, 5760 flow [2023-11-06 22:06:56,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 86.66666666666667) internal successors, (780), 9 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:56,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:06:56,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:56,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:06:56,155 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:06:56,155 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:56,155 INFO L85 PathProgramCache]: Analyzing trace with hash 956514248, now seen corresponding path program 6 times [2023-11-06 22:06:56,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:56,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254887620] [2023-11-06 22:06:56,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:56,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:57,264 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:06:57,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:57,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254887620] [2023-11-06 22:06:57,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254887620] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:57,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:57,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:06:57,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250008151] [2023-11-06 22:06:57,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:57,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:06:57,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:57,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:06:57,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:06:57,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 203 [2023-11-06 22:06:57,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 300 transitions, 5760 flow. Second operand has 9 states, 9 states have (on average 85.66666666666667) internal successors, (771), 9 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:57,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:06:57,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 203 [2023-11-06 22:06:57,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:06:59,401 INFO L124 PetriNetUnfolderBase]: 3719/5883 cut-off events. [2023-11-06 22:06:59,401 INFO L125 PetriNetUnfolderBase]: For 114523/114743 co-relation queries the response was YES. [2023-11-06 22:06:59,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47860 conditions, 5883 events. 3719/5883 cut-off events. For 114523/114743 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 35660 event pairs, 118 based on Foata normal form. 333/6203 useless extension candidates. Maximal degree in co-relation 47803. Up to 3079 conditions per place. [2023-11-06 22:06:59,458 INFO L140 encePairwiseOnDemand]: 195/203 looper letters, 177 selfloop transitions, 196 changer transitions 50/427 dead transitions. [2023-11-06 22:06:59,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 427 transitions, 8535 flow [2023-11-06 22:06:59,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:06:59,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-06 22:06:59,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1025 transitions. [2023-11-06 22:06:59,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45902373488580384 [2023-11-06 22:06:59,463 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1025 transitions. [2023-11-06 22:06:59,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1025 transitions. [2023-11-06 22:06:59,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:06:59,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1025 transitions. [2023-11-06 22:06:59,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 93.18181818181819) internal successors, (1025), 11 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:59,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 203.0) internal successors, (2436), 12 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:59,473 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 203.0) internal successors, (2436), 12 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:59,474 INFO L175 Difference]: Start difference. First operand has 109 places, 300 transitions, 5760 flow. Second operand 11 states and 1025 transitions. [2023-11-06 22:06:59,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 427 transitions, 8535 flow [2023-11-06 22:07:00,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 427 transitions, 8379 flow, removed 78 selfloop flow, removed 2 redundant places. [2023-11-06 22:07:00,168 INFO L231 Difference]: Finished difference. Result has 122 places, 321 transitions, 6828 flow [2023-11-06 22:07:00,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=5626, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=170, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6828, PETRI_PLACES=122, PETRI_TRANSITIONS=321} [2023-11-06 22:07:00,170 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 87 predicate places. [2023-11-06 22:07:00,170 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 321 transitions, 6828 flow [2023-11-06 22:07:00,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 85.66666666666667) internal successors, (771), 9 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:00,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:07:00,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:00,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:07:00,172 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:07:00,172 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:00,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1942621562, now seen corresponding path program 1 times [2023-11-06 22:07:00,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:07:00,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396622030] [2023-11-06 22:07:00,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:00,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:07:00,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:00,880 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:07:00,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:07:00,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396622030] [2023-11-06 22:07:00,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396622030] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:07:00,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:07:00,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:07:00,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073031384] [2023-11-06 22:07:00,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:07:00,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:07:00,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:07:00,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:07:00,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:07:00,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 203 [2023-11-06 22:07:00,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 321 transitions, 6828 flow. Second operand has 8 states, 8 states have (on average 89.0) internal successors, (712), 8 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:00,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:07:00,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 203 [2023-11-06 22:07:00,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:07:03,146 INFO L124 PetriNetUnfolderBase]: 4073/6581 cut-off events. [2023-11-06 22:07:03,147 INFO L125 PetriNetUnfolderBase]: For 150419/150646 co-relation queries the response was YES. [2023-11-06 22:07:03,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54508 conditions, 6581 events. 4073/6581 cut-off events. For 150419/150646 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 42295 event pairs, 392 based on Foata normal form. 230/6790 useless extension candidates. Maximal degree in co-relation 54444. Up to 3398 conditions per place. [2023-11-06 22:07:03,232 INFO L140 encePairwiseOnDemand]: 193/203 looper letters, 345 selfloop transitions, 103 changer transitions 39/491 dead transitions. [2023-11-06 22:07:03,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 491 transitions, 10773 flow [2023-11-06 22:07:03,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:07:03,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-06 22:07:03,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 973 transitions. [2023-11-06 22:07:03,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4793103448275862 [2023-11-06 22:07:03,237 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 973 transitions. [2023-11-06 22:07:03,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 973 transitions. [2023-11-06 22:07:03,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:07:03,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 973 transitions. [2023-11-06 22:07:03,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.3) internal successors, (973), 10 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:03,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 203.0) internal successors, (2233), 11 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:03,246 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 203.0) internal successors, (2233), 11 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:03,246 INFO L175 Difference]: Start difference. First operand has 122 places, 321 transitions, 6828 flow. Second operand 10 states and 973 transitions. [2023-11-06 22:07:03,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 491 transitions, 10773 flow [2023-11-06 22:07:03,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 491 transitions, 10567 flow, removed 40 selfloop flow, removed 8 redundant places. [2023-11-06 22:07:03,770 INFO L231 Difference]: Finished difference. Result has 124 places, 354 transitions, 7674 flow [2023-11-06 22:07:03,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=6668, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7674, PETRI_PLACES=124, PETRI_TRANSITIONS=354} [2023-11-06 22:07:03,771 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 89 predicate places. [2023-11-06 22:07:03,771 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 354 transitions, 7674 flow [2023-11-06 22:07:03,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 89.0) internal successors, (712), 8 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:03,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:07:03,771 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:03,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:07:03,772 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:07:03,772 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:03,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1026752148, now seen corresponding path program 2 times [2023-11-06 22:07:03,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:07:03,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253900238] [2023-11-06 22:07:03,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:03,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:07:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:04,342 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:07:04,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:07:04,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253900238] [2023-11-06 22:07:04,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253900238] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:07:04,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:07:04,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:07:04,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454601457] [2023-11-06 22:07:04,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:07:04,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:07:04,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:07:04,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:07:04,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:07:04,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 203 [2023-11-06 22:07:04,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 354 transitions, 7674 flow. Second operand has 6 states, 6 states have (on average 91.66666666666667) internal successors, (550), 6 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:04,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:07:04,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 203 [2023-11-06 22:07:04,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:07:06,270 INFO L124 PetriNetUnfolderBase]: 4172/6804 cut-off events. [2023-11-06 22:07:06,270 INFO L125 PetriNetUnfolderBase]: For 156962/157225 co-relation queries the response was YES. [2023-11-06 22:07:06,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55482 conditions, 6804 events. 4172/6804 cut-off events. For 156962/157225 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 44444 event pairs, 486 based on Foata normal form. 274/7055 useless extension candidates. Maximal degree in co-relation 55419. Up to 4582 conditions per place. [2023-11-06 22:07:06,341 INFO L140 encePairwiseOnDemand]: 193/203 looper letters, 270 selfloop transitions, 160 changer transitions 26/460 dead transitions. [2023-11-06 22:07:06,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 460 transitions, 10433 flow [2023-11-06 22:07:06,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:07:06,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:07:06,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 781 transitions. [2023-11-06 22:07:06,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48091133004926107 [2023-11-06 22:07:06,344 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 781 transitions. [2023-11-06 22:07:06,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 781 transitions. [2023-11-06 22:07:06,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:07:06,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 781 transitions. [2023-11-06 22:07:06,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 97.625) internal successors, (781), 8 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:06,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 203.0) internal successors, (1827), 9 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:06,351 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 203.0) internal successors, (1827), 9 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:06,351 INFO L175 Difference]: Start difference. First operand has 124 places, 354 transitions, 7674 flow. Second operand 8 states and 781 transitions. [2023-11-06 22:07:06,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 460 transitions, 10433 flow [2023-11-06 22:07:07,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 460 transitions, 10322 flow, removed 14 selfloop flow, removed 3 redundant places. [2023-11-06 22:07:07,091 INFO L231 Difference]: Finished difference. Result has 131 places, 395 transitions, 9153 flow [2023-11-06 22:07:07,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=7574, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9153, PETRI_PLACES=131, PETRI_TRANSITIONS=395} [2023-11-06 22:07:07,092 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 96 predicate places. [2023-11-06 22:07:07,093 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 395 transitions, 9153 flow [2023-11-06 22:07:07,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.66666666666667) internal successors, (550), 6 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:07,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:07:07,093 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:07,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:07:07,094 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:07:07,094 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:07,094 INFO L85 PathProgramCache]: Analyzing trace with hash -421287080, now seen corresponding path program 1 times [2023-11-06 22:07:07,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:07:07,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610472296] [2023-11-06 22:07:07,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:07,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:07:07,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:07,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:07:07,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:07:07,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610472296] [2023-11-06 22:07:07,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610472296] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:07:07,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:07:07,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:07:07,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90133895] [2023-11-06 22:07:07,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:07:07,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:07:07,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:07:07,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:07:07,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:07:07,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 203 [2023-11-06 22:07:07,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 395 transitions, 9153 flow. Second operand has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:07,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:07:07,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 203 [2023-11-06 22:07:07,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:07:10,650 INFO L124 PetriNetUnfolderBase]: 5513/8904 cut-off events. [2023-11-06 22:07:10,650 INFO L125 PetriNetUnfolderBase]: For 202067/202067 co-relation queries the response was YES. [2023-11-06 22:07:10,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72387 conditions, 8904 events. 5513/8904 cut-off events. For 202067/202067 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 58821 event pairs, 1573 based on Foata normal form. 136/9040 useless extension candidates. Maximal degree in co-relation 72321. Up to 4587 conditions per place. [2023-11-06 22:07:10,703 INFO L140 encePairwiseOnDemand]: 199/203 looper letters, 244 selfloop transitions, 6 changer transitions 251/501 dead transitions. [2023-11-06 22:07:10,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 501 transitions, 12635 flow [2023-11-06 22:07:10,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:07:10,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:07:10,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 500 transitions. [2023-11-06 22:07:10,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49261083743842365 [2023-11-06 22:07:10,705 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 500 transitions. [2023-11-06 22:07:10,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 500 transitions. [2023-11-06 22:07:10,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:07:10,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 500 transitions. [2023-11-06 22:07:10,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.0) internal successors, (500), 5 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:10,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:10,710 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:10,710 INFO L175 Difference]: Start difference. First operand has 131 places, 395 transitions, 9153 flow. Second operand 5 states and 500 transitions. [2023-11-06 22:07:10,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 501 transitions, 12635 flow [2023-11-06 22:07:11,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 501 transitions, 12572 flow, removed 31 selfloop flow, removed 3 redundant places. [2023-11-06 22:07:11,458 INFO L231 Difference]: Finished difference. Result has 133 places, 210 transitions, 4816 flow [2023-11-06 22:07:11,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=9126, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4816, PETRI_PLACES=133, PETRI_TRANSITIONS=210} [2023-11-06 22:07:11,459 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 98 predicate places. [2023-11-06 22:07:11,459 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 210 transitions, 4816 flow [2023-11-06 22:07:11,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:11,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:07:11,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:11,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:07:11,459 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:07:11,460 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:11,460 INFO L85 PathProgramCache]: Analyzing trace with hash 2010525928, now seen corresponding path program 1 times [2023-11-06 22:07:11,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:07:11,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864247178] [2023-11-06 22:07:11,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:11,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:07:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:12,357 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:07:12,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:07:12,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864247178] [2023-11-06 22:07:12,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864247178] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:07:12,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:07:12,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:07:12,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958711666] [2023-11-06 22:07:12,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:07:12,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:07:12,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:07:12,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:07:12,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:07:12,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 203 [2023-11-06 22:07:12,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 210 transitions, 4816 flow. Second operand has 8 states, 8 states have (on average 90.125) internal successors, (721), 8 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:12,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:07:12,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 203 [2023-11-06 22:07:12,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:07:14,011 INFO L124 PetriNetUnfolderBase]: 2848/4705 cut-off events. [2023-11-06 22:07:14,011 INFO L125 PetriNetUnfolderBase]: For 125807/125939 co-relation queries the response was YES. [2023-11-06 22:07:14,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39272 conditions, 4705 events. 2848/4705 cut-off events. For 125807/125939 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 29086 event pairs, 653 based on Foata normal form. 160/4865 useless extension candidates. Maximal degree in co-relation 39205. Up to 3425 conditions per place. [2023-11-06 22:07:14,046 INFO L140 encePairwiseOnDemand]: 192/203 looper letters, 146 selfloop transitions, 103 changer transitions 19/271 dead transitions. [2023-11-06 22:07:14,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 271 transitions, 6088 flow [2023-11-06 22:07:14,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:07:14,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-06 22:07:14,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1054 transitions. [2023-11-06 22:07:14,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4720107478728168 [2023-11-06 22:07:14,049 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1054 transitions. [2023-11-06 22:07:14,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1054 transitions. [2023-11-06 22:07:14,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:07:14,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1054 transitions. [2023-11-06 22:07:14,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 95.81818181818181) internal successors, (1054), 11 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:14,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 203.0) internal successors, (2436), 12 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:14,057 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 203.0) internal successors, (2436), 12 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:14,057 INFO L175 Difference]: Start difference. First operand has 133 places, 210 transitions, 4816 flow. Second operand 11 states and 1054 transitions. [2023-11-06 22:07:14,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 271 transitions, 6088 flow [2023-11-06 22:07:14,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 271 transitions, 5822 flow, removed 75 selfloop flow, removed 15 redundant places. [2023-11-06 22:07:14,379 INFO L231 Difference]: Finished difference. Result has 129 places, 213 transitions, 4906 flow [2023-11-06 22:07:14,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=4566, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4906, PETRI_PLACES=129, PETRI_TRANSITIONS=213} [2023-11-06 22:07:14,380 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 94 predicate places. [2023-11-06 22:07:14,380 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 213 transitions, 4906 flow [2023-11-06 22:07:14,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.125) internal successors, (721), 8 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:14,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:07:14,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:14,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:07:14,381 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:07:14,382 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:14,382 INFO L85 PathProgramCache]: Analyzing trace with hash -979506722, now seen corresponding path program 2 times [2023-11-06 22:07:14,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:07:14,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850040715] [2023-11-06 22:07:14,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:14,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:07:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:15,084 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:07:15,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:07:15,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850040715] [2023-11-06 22:07:15,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850040715] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:07:15,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:07:15,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:07:15,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659848303] [2023-11-06 22:07:15,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:07:15,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:07:15,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:07:15,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:07:15,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:07:15,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 203 [2023-11-06 22:07:15,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 213 transitions, 4906 flow. Second operand has 7 states, 7 states have (on average 91.42857142857143) internal successors, (640), 7 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:15,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:07:15,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 203 [2023-11-06 22:07:15,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:07:16,659 INFO L124 PetriNetUnfolderBase]: 2778/4592 cut-off events. [2023-11-06 22:07:16,660 INFO L125 PetriNetUnfolderBase]: For 118169/118316 co-relation queries the response was YES. [2023-11-06 22:07:16,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38190 conditions, 4592 events. 2778/4592 cut-off events. For 118169/118316 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 28205 event pairs, 579 based on Foata normal form. 159/4751 useless extension candidates. Maximal degree in co-relation 38128. Up to 3388 conditions per place. [2023-11-06 22:07:16,697 INFO L140 encePairwiseOnDemand]: 194/203 looper letters, 153 selfloop transitions, 90 changer transitions 20/266 dead transitions. [2023-11-06 22:07:16,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 266 transitions, 5992 flow [2023-11-06 22:07:16,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:07:16,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-06 22:07:16,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 971 transitions. [2023-11-06 22:07:16,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47832512315270936 [2023-11-06 22:07:16,702 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 971 transitions. [2023-11-06 22:07:16,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 971 transitions. [2023-11-06 22:07:16,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:07:16,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 971 transitions. [2023-11-06 22:07:16,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.1) internal successors, (971), 10 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:16,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 203.0) internal successors, (2233), 11 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:16,710 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 203.0) internal successors, (2233), 11 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:16,710 INFO L175 Difference]: Start difference. First operand has 129 places, 213 transitions, 4906 flow. Second operand 10 states and 971 transitions. [2023-11-06 22:07:16,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 266 transitions, 5992 flow [2023-11-06 22:07:17,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 266 transitions, 5709 flow, removed 40 selfloop flow, removed 7 redundant places. [2023-11-06 22:07:17,010 INFO L231 Difference]: Finished difference. Result has 134 places, 212 transitions, 4920 flow [2023-11-06 22:07:17,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=4642, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4920, PETRI_PLACES=134, PETRI_TRANSITIONS=212} [2023-11-06 22:07:17,011 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 99 predicate places. [2023-11-06 22:07:17,011 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 212 transitions, 4920 flow [2023-11-06 22:07:17,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.42857142857143) internal successors, (640), 7 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:17,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:07:17,012 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:17,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 22:07:17,012 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:07:17,012 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:17,013 INFO L85 PathProgramCache]: Analyzing trace with hash 2034362970, now seen corresponding path program 3 times [2023-11-06 22:07:17,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:07:17,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436120319] [2023-11-06 22:07:17,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:17,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:07:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:18,072 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:07:18,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:07:18,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436120319] [2023-11-06 22:07:18,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436120319] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:07:18,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:07:18,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:07:18,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141017469] [2023-11-06 22:07:18,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:07:18,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:07:18,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:07:18,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:07:18,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:07:18,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 203 [2023-11-06 22:07:18,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 212 transitions, 4920 flow. Second operand has 9 states, 9 states have (on average 85.88888888888889) internal successors, (773), 9 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:18,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:07:18,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 203 [2023-11-06 22:07:18,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:07:19,896 INFO L124 PetriNetUnfolderBase]: 2947/4888 cut-off events. [2023-11-06 22:07:19,896 INFO L125 PetriNetUnfolderBase]: For 129612/129734 co-relation queries the response was YES. [2023-11-06 22:07:19,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40950 conditions, 4888 events. 2947/4888 cut-off events. For 129612/129734 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 30590 event pairs, 670 based on Foata normal form. 150/5034 useless extension candidates. Maximal degree in co-relation 40886. Up to 3441 conditions per place. [2023-11-06 22:07:19,947 INFO L140 encePairwiseOnDemand]: 192/203 looper letters, 149 selfloop transitions, 139 changer transitions 22/313 dead transitions. [2023-11-06 22:07:19,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 313 transitions, 7222 flow [2023-11-06 22:07:19,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:07:19,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-06 22:07:19,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1106 transitions. [2023-11-06 22:07:19,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4540229885057471 [2023-11-06 22:07:19,950 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1106 transitions. [2023-11-06 22:07:19,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1106 transitions. [2023-11-06 22:07:19,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:07:19,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1106 transitions. [2023-11-06 22:07:19,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 92.16666666666667) internal successors, (1106), 12 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:19,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 203.0) internal successors, (2639), 13 states have internal predecessors, (2639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:19,958 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 203.0) internal successors, (2639), 13 states have internal predecessors, (2639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:19,958 INFO L175 Difference]: Start difference. First operand has 134 places, 212 transitions, 4920 flow. Second operand 12 states and 1106 transitions. [2023-11-06 22:07:19,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 313 transitions, 7222 flow [2023-11-06 22:07:20,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 313 transitions, 6888 flow, removed 41 selfloop flow, removed 9 redundant places. [2023-11-06 22:07:20,176 INFO L231 Difference]: Finished difference. Result has 139 places, 250 transitions, 6026 flow [2023-11-06 22:07:20,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=4675, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=6026, PETRI_PLACES=139, PETRI_TRANSITIONS=250} [2023-11-06 22:07:20,177 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 104 predicate places. [2023-11-06 22:07:20,177 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 250 transitions, 6026 flow [2023-11-06 22:07:20,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 85.88888888888889) internal successors, (773), 9 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:20,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:07:20,177 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:20,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 22:07:20,178 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:07:20,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:20,178 INFO L85 PathProgramCache]: Analyzing trace with hash -462718874, now seen corresponding path program 4 times [2023-11-06 22:07:20,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:07:20,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600466211] [2023-11-06 22:07:20,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:20,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:07:20,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:21,089 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:07:21,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:07:21,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600466211] [2023-11-06 22:07:21,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600466211] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:07:21,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:07:21,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:07:21,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90444776] [2023-11-06 22:07:21,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:07:21,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:07:21,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:07:21,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:07:21,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:07:21,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 203 [2023-11-06 22:07:21,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 250 transitions, 6026 flow. Second operand has 9 states, 9 states have (on average 88.88888888888889) internal successors, (800), 9 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:21,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:07:21,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 203 [2023-11-06 22:07:21,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:07:22,586 INFO L124 PetriNetUnfolderBase]: 2789/4647 cut-off events. [2023-11-06 22:07:22,587 INFO L125 PetriNetUnfolderBase]: For 124766/124868 co-relation queries the response was YES. [2023-11-06 22:07:22,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39465 conditions, 4647 events. 2789/4647 cut-off events. For 124766/124868 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 28852 event pairs, 531 based on Foata normal form. 130/4777 useless extension candidates. Maximal degree in co-relation 39399. Up to 3196 conditions per place. [2023-11-06 22:07:22,624 INFO L140 encePairwiseOnDemand]: 193/203 looper letters, 135 selfloop transitions, 147 changer transitions 18/303 dead transitions. [2023-11-06 22:07:22,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 303 transitions, 7222 flow [2023-11-06 22:07:22,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:07:22,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-06 22:07:22,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1044 transitions. [2023-11-06 22:07:22,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4675324675324675 [2023-11-06 22:07:22,627 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1044 transitions. [2023-11-06 22:07:22,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1044 transitions. [2023-11-06 22:07:22,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:07:22,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1044 transitions. [2023-11-06 22:07:22,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 94.9090909090909) internal successors, (1044), 11 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:22,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 203.0) internal successors, (2436), 12 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:22,634 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 203.0) internal successors, (2436), 12 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:22,634 INFO L175 Difference]: Start difference. First operand has 139 places, 250 transitions, 6026 flow. Second operand 11 states and 1044 transitions. [2023-11-06 22:07:22,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 303 transitions, 7222 flow [2023-11-06 22:07:22,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 303 transitions, 7096 flow, removed 53 selfloop flow, removed 3 redundant places. [2023-11-06 22:07:22,935 INFO L231 Difference]: Finished difference. Result has 148 places, 249 transitions, 6292 flow [2023-11-06 22:07:22,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=5908, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6292, PETRI_PLACES=148, PETRI_TRANSITIONS=249} [2023-11-06 22:07:22,937 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 113 predicate places. [2023-11-06 22:07:22,937 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 249 transitions, 6292 flow [2023-11-06 22:07:22,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 88.88888888888889) internal successors, (800), 9 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:22,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:07:22,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:22,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-06 22:07:22,938 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:07:22,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:22,938 INFO L85 PathProgramCache]: Analyzing trace with hash 461897704, now seen corresponding path program 5 times [2023-11-06 22:07:22,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:07:22,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77977207] [2023-11-06 22:07:22,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:22,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:07:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:23,597 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:07:23,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:07:23,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77977207] [2023-11-06 22:07:23,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77977207] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:07:23,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:07:23,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:07:23,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447463851] [2023-11-06 22:07:23,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:07:23,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:07:23,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:07:23,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:07:23,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:07:23,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 203 [2023-11-06 22:07:23,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 249 transitions, 6292 flow. Second operand has 9 states, 9 states have (on average 88.88888888888889) internal successors, (800), 9 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:23,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:07:23,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 203 [2023-11-06 22:07:23,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:07:25,466 INFO L124 PetriNetUnfolderBase]: 3096/5181 cut-off events. [2023-11-06 22:07:25,467 INFO L125 PetriNetUnfolderBase]: For 138589/138625 co-relation queries the response was YES. [2023-11-06 22:07:25,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44285 conditions, 5181 events. 3096/5181 cut-off events. For 138589/138625 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 33549 event pairs, 714 based on Foata normal form. 64/5182 useless extension candidates. Maximal degree in co-relation 44216. Up to 3477 conditions per place. [2023-11-06 22:07:25,522 INFO L140 encePairwiseOnDemand]: 193/203 looper letters, 208 selfloop transitions, 102 changer transitions 22/335 dead transitions. [2023-11-06 22:07:25,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 335 transitions, 8189 flow [2023-11-06 22:07:25,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:07:25,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-06 22:07:25,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1050 transitions. [2023-11-06 22:07:25,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4702194357366771 [2023-11-06 22:07:25,525 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1050 transitions. [2023-11-06 22:07:25,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1050 transitions. [2023-11-06 22:07:25,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:07:25,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1050 transitions. [2023-11-06 22:07:25,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 95.45454545454545) internal successors, (1050), 11 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:25,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 203.0) internal successors, (2436), 12 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:25,532 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 203.0) internal successors, (2436), 12 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:25,532 INFO L175 Difference]: Start difference. First operand has 148 places, 249 transitions, 6292 flow. Second operand 11 states and 1050 transitions. [2023-11-06 22:07:25,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 335 transitions, 8189 flow [2023-11-06 22:07:25,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 335 transitions, 7841 flow, removed 34 selfloop flow, removed 10 redundant places. [2023-11-06 22:07:25,856 INFO L231 Difference]: Finished difference. Result has 152 places, 266 transitions, 6683 flow [2023-11-06 22:07:25,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=5976, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6683, PETRI_PLACES=152, PETRI_TRANSITIONS=266} [2023-11-06 22:07:25,857 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 117 predicate places. [2023-11-06 22:07:25,857 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 266 transitions, 6683 flow [2023-11-06 22:07:25,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 88.88888888888889) internal successors, (800), 9 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:25,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:07:25,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:25,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-06 22:07:25,858 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:07:25,858 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:25,858 INFO L85 PathProgramCache]: Analyzing trace with hash 535183564, now seen corresponding path program 6 times [2023-11-06 22:07:25,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:07:25,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69588645] [2023-11-06 22:07:25,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:25,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:07:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:26,438 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:07:26,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:07:26,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69588645] [2023-11-06 22:07:26,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69588645] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:07:26,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:07:26,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:07:26,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103129082] [2023-11-06 22:07:26,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:07:26,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:07:26,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:07:26,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:07:26,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:07:26,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 203 [2023-11-06 22:07:26,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 266 transitions, 6683 flow. Second operand has 8 states, 8 states have (on average 90.125) internal successors, (721), 8 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:26,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:07:26,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 203 [2023-11-06 22:07:26,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:07:28,113 INFO L124 PetriNetUnfolderBase]: 2920/4881 cut-off events. [2023-11-06 22:07:28,113 INFO L125 PetriNetUnfolderBase]: For 142747/142858 co-relation queries the response was YES. [2023-11-06 22:07:28,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42888 conditions, 4881 events. 2920/4881 cut-off events. For 142747/142858 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 30812 event pairs, 470 based on Foata normal form. 131/5009 useless extension candidates. Maximal degree in co-relation 42818. Up to 2865 conditions per place. [2023-11-06 22:07:28,148 INFO L140 encePairwiseOnDemand]: 192/203 looper letters, 127 selfloop transitions, 141 changer transitions 82/352 dead transitions. [2023-11-06 22:07:28,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 352 transitions, 8817 flow [2023-11-06 22:07:28,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:07:28,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-06 22:07:28,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1055 transitions. [2023-11-06 22:07:28,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47245857590685175 [2023-11-06 22:07:28,151 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1055 transitions. [2023-11-06 22:07:28,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1055 transitions. [2023-11-06 22:07:28,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:07:28,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1055 transitions. [2023-11-06 22:07:28,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 95.9090909090909) internal successors, (1055), 11 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:28,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 203.0) internal successors, (2436), 12 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:28,157 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 203.0) internal successors, (2436), 12 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:28,157 INFO L175 Difference]: Start difference. First operand has 152 places, 266 transitions, 6683 flow. Second operand 11 states and 1055 transitions. [2023-11-06 22:07:28,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 352 transitions, 8817 flow [2023-11-06 22:07:28,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 352 transitions, 8654 flow, removed 77 selfloop flow, removed 3 redundant places. [2023-11-06 22:07:28,553 INFO L231 Difference]: Finished difference. Result has 163 places, 243 transitions, 6260 flow [2023-11-06 22:07:28,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=6558, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6260, PETRI_PLACES=163, PETRI_TRANSITIONS=243} [2023-11-06 22:07:28,554 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 128 predicate places. [2023-11-06 22:07:28,554 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 243 transitions, 6260 flow [2023-11-06 22:07:28,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.125) internal successors, (721), 8 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:28,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:07:28,555 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:28,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-06 22:07:28,555 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:07:28,555 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:28,555 INFO L85 PathProgramCache]: Analyzing trace with hash 383061521, now seen corresponding path program 1 times [2023-11-06 22:07:28,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:07:28,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138538835] [2023-11-06 22:07:28,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:28,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:07:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:28,692 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:07:28,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:07:28,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138538835] [2023-11-06 22:07:28,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138538835] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:07:28,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:07:28,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:07:28,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504477750] [2023-11-06 22:07:28,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:07:28,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:07:28,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:07:28,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:07:28,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:07:28,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 203 [2023-11-06 22:07:28,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 243 transitions, 6260 flow. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:28,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:07:28,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 203 [2023-11-06 22:07:28,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:07:29,023 INFO L124 PetriNetUnfolderBase]: 562/1032 cut-off events. [2023-11-06 22:07:29,024 INFO L125 PetriNetUnfolderBase]: For 39294/39305 co-relation queries the response was YES. [2023-11-06 22:07:29,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9385 conditions, 1032 events. 562/1032 cut-off events. For 39294/39305 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5166 event pairs, 122 based on Foata normal form. 86/1117 useless extension candidates. Maximal degree in co-relation 9311. Up to 855 conditions per place. [2023-11-06 22:07:29,032 INFO L140 encePairwiseOnDemand]: 198/203 looper letters, 160 selfloop transitions, 4 changer transitions 1/167 dead transitions. [2023-11-06 22:07:29,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 167 transitions, 4535 flow [2023-11-06 22:07:29,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:07:29,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:07:29,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 308 transitions. [2023-11-06 22:07:29,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5057471264367817 [2023-11-06 22:07:29,034 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 308 transitions. [2023-11-06 22:07:29,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 308 transitions. [2023-11-06 22:07:29,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:07:29,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 308 transitions. [2023-11-06 22:07:29,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:29,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:29,036 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:29,036 INFO L175 Difference]: Start difference. First operand has 163 places, 243 transitions, 6260 flow. Second operand 3 states and 308 transitions. [2023-11-06 22:07:29,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 167 transitions, 4535 flow [2023-11-06 22:07:29,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 167 transitions, 3671 flow, removed 272 selfloop flow, removed 36 redundant places. [2023-11-06 22:07:29,118 INFO L231 Difference]: Finished difference. Result has 127 places, 130 transitions, 2508 flow [2023-11-06 22:07:29,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=2482, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2508, PETRI_PLACES=127, PETRI_TRANSITIONS=130} [2023-11-06 22:07:29,119 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 92 predicate places. [2023-11-06 22:07:29,119 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 130 transitions, 2508 flow [2023-11-06 22:07:29,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:29,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:07:29,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:29,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-06 22:07:29,120 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:07:29,120 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:29,120 INFO L85 PathProgramCache]: Analyzing trace with hash -323214543, now seen corresponding path program 1 times [2023-11-06 22:07:29,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:07:29,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944037717] [2023-11-06 22:07:29,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:29,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:07:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:29,258 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:07:29,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:07:29,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944037717] [2023-11-06 22:07:29,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944037717] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:07:29,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:07:29,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:07:29,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909135806] [2023-11-06 22:07:29,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:07:29,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:07:29,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:07:29,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:07:29,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:07:29,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 203 [2023-11-06 22:07:29,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 130 transitions, 2508 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:29,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:07:29,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 203 [2023-11-06 22:07:29,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:07:29,477 INFO L124 PetriNetUnfolderBase]: 244/517 cut-off events. [2023-11-06 22:07:29,477 INFO L125 PetriNetUnfolderBase]: For 12494/12494 co-relation queries the response was YES. [2023-11-06 22:07:29,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4341 conditions, 517 events. 244/517 cut-off events. For 12494/12494 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2385 event pairs, 26 based on Foata normal form. 66/583 useless extension candidates. Maximal degree in co-relation 4284. Up to 237 conditions per place. [2023-11-06 22:07:29,481 INFO L140 encePairwiseOnDemand]: 198/203 looper letters, 130 selfloop transitions, 7 changer transitions 2/141 dead transitions. [2023-11-06 22:07:29,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 141 transitions, 3191 flow [2023-11-06 22:07:29,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:07:29,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:07:29,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 406 transitions. [2023-11-06 22:07:29,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-11-06 22:07:29,482 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 406 transitions. [2023-11-06 22:07:29,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 406 transitions. [2023-11-06 22:07:29,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:07:29,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 406 transitions. [2023-11-06 22:07:29,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:29,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:29,485 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:29,485 INFO L175 Difference]: Start difference. First operand has 127 places, 130 transitions, 2508 flow. Second operand 4 states and 406 transitions. [2023-11-06 22:07:29,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 141 transitions, 3191 flow [2023-11-06 22:07:29,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 141 transitions, 2796 flow, removed 102 selfloop flow, removed 18 redundant places. [2023-11-06 22:07:29,513 INFO L231 Difference]: Finished difference. Result has 110 places, 95 transitions, 1614 flow [2023-11-06 22:07:29,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=1574, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1614, PETRI_PLACES=110, PETRI_TRANSITIONS=95} [2023-11-06 22:07:29,514 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 75 predicate places. [2023-11-06 22:07:29,514 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 95 transitions, 1614 flow [2023-11-06 22:07:29,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:29,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:07:29,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:29,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-06 22:07:29,514 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:07:29,515 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:29,515 INFO L85 PathProgramCache]: Analyzing trace with hash 881738047, now seen corresponding path program 1 times [2023-11-06 22:07:29,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:07:29,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039180722] [2023-11-06 22:07:29,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:29,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:07:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:29,704 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:07:29,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:07:29,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039180722] [2023-11-06 22:07:29,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039180722] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:07:29,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:07:29,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:07:29,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553839010] [2023-11-06 22:07:29,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:07:29,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:07:29,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:07:29,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:07:29,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:07:29,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 203 [2023-11-06 22:07:29,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 95 transitions, 1614 flow. Second operand has 5 states, 5 states have (on average 94.8) internal successors, (474), 5 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:29,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:07:29,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 203 [2023-11-06 22:07:29,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:07:29,887 INFO L124 PetriNetUnfolderBase]: 186/394 cut-off events. [2023-11-06 22:07:29,887 INFO L125 PetriNetUnfolderBase]: For 6893/6893 co-relation queries the response was YES. [2023-11-06 22:07:29,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3135 conditions, 394 events. 186/394 cut-off events. For 6893/6893 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1748 event pairs, 12 based on Foata normal form. 23/417 useless extension candidates. Maximal degree in co-relation 3089. Up to 175 conditions per place. [2023-11-06 22:07:29,889 INFO L140 encePairwiseOnDemand]: 198/203 looper letters, 104 selfloop transitions, 10 changer transitions 24/140 dead transitions. [2023-11-06 22:07:29,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 140 transitions, 2813 flow [2023-11-06 22:07:29,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:07:29,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:07:29,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 497 transitions. [2023-11-06 22:07:29,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4896551724137931 [2023-11-06 22:07:29,891 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 497 transitions. [2023-11-06 22:07:29,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 497 transitions. [2023-11-06 22:07:29,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:07:29,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 497 transitions. [2023-11-06 22:07:29,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:29,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:29,894 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:29,894 INFO L175 Difference]: Start difference. First operand has 110 places, 95 transitions, 1614 flow. Second operand 5 states and 497 transitions. [2023-11-06 22:07:29,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 140 transitions, 2813 flow [2023-11-06 22:07:29,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 140 transitions, 2572 flow, removed 72 selfloop flow, removed 8 redundant places. [2023-11-06 22:07:29,919 INFO L231 Difference]: Finished difference. Result has 107 places, 81 transitions, 1180 flow [2023-11-06 22:07:29,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1180, PETRI_PLACES=107, PETRI_TRANSITIONS=81} [2023-11-06 22:07:29,920 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 72 predicate places. [2023-11-06 22:07:29,920 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 81 transitions, 1180 flow [2023-11-06 22:07:29,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.8) internal successors, (474), 5 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:29,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:07:29,920 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:29,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-06 22:07:29,921 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:07:29,921 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:29,921 INFO L85 PathProgramCache]: Analyzing trace with hash 607733722, now seen corresponding path program 1 times [2023-11-06 22:07:29,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:07:29,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616702630] [2023-11-06 22:07:29,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:29,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:07:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:31,235 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:07:31,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:07:31,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616702630] [2023-11-06 22:07:31,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616702630] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:07:31,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:07:31,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:07:31,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610919912] [2023-11-06 22:07:31,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:07:31,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:07:31,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:07:31,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:07:31,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:07:31,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 203 [2023-11-06 22:07:31,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 81 transitions, 1180 flow. Second operand has 11 states, 11 states have (on average 88.9090909090909) internal successors, (978), 11 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:31,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:07:31,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 203 [2023-11-06 22:07:31,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:07:31,647 INFO L124 PetriNetUnfolderBase]: 156/350 cut-off events. [2023-11-06 22:07:31,647 INFO L125 PetriNetUnfolderBase]: For 4254/4259 co-relation queries the response was YES. [2023-11-06 22:07:31,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2494 conditions, 350 events. 156/350 cut-off events. For 4254/4259 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1502 event pairs, 27 based on Foata normal form. 6/356 useless extension candidates. Maximal degree in co-relation 2453. Up to 221 conditions per place. [2023-11-06 22:07:31,649 INFO L140 encePairwiseOnDemand]: 195/203 looper letters, 60 selfloop transitions, 15 changer transitions 31/108 dead transitions. [2023-11-06 22:07:31,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 108 transitions, 1653 flow [2023-11-06 22:07:31,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:07:31,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:07:31,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 745 transitions. [2023-11-06 22:07:31,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45874384236453203 [2023-11-06 22:07:31,651 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 745 transitions. [2023-11-06 22:07:31,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 745 transitions. [2023-11-06 22:07:31,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:07:31,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 745 transitions. [2023-11-06 22:07:31,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 93.125) internal successors, (745), 8 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:31,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 203.0) internal successors, (1827), 9 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:31,656 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 203.0) internal successors, (1827), 9 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:31,656 INFO L175 Difference]: Start difference. First operand has 107 places, 81 transitions, 1180 flow. Second operand 8 states and 745 transitions. [2023-11-06 22:07:31,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 108 transitions, 1653 flow [2023-11-06 22:07:31,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 108 transitions, 1525 flow, removed 38 selfloop flow, removed 10 redundant places. [2023-11-06 22:07:31,668 INFO L231 Difference]: Finished difference. Result has 104 places, 72 transitions, 993 flow [2023-11-06 22:07:31,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=993, PETRI_PLACES=104, PETRI_TRANSITIONS=72} [2023-11-06 22:07:31,669 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 69 predicate places. [2023-11-06 22:07:31,669 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 72 transitions, 993 flow [2023-11-06 22:07:31,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 88.9090909090909) internal successors, (978), 11 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:31,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:07:31,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:31,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-06 22:07:31,670 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:07:31,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:31,671 INFO L85 PathProgramCache]: Analyzing trace with hash 98941254, now seen corresponding path program 2 times [2023-11-06 22:07:31,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:07:31,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736231638] [2023-11-06 22:07:31,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:31,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:07:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:32,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:07:32,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:07:32,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736231638] [2023-11-06 22:07:32,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736231638] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:07:32,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:07:32,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:07:32,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740397068] [2023-11-06 22:07:32,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:07:32,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:07:32,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:07:32,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:07:32,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:07:32,896 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 203 [2023-11-06 22:07:32,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 72 transitions, 993 flow. Second operand has 11 states, 11 states have (on average 84.9090909090909) internal successors, (934), 11 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:32,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:07:32,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 203 [2023-11-06 22:07:32,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:07:33,287 INFO L124 PetriNetUnfolderBase]: 123/280 cut-off events. [2023-11-06 22:07:33,287 INFO L125 PetriNetUnfolderBase]: For 2567/2572 co-relation queries the response was YES. [2023-11-06 22:07:33,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1862 conditions, 280 events. 123/280 cut-off events. For 2567/2572 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1117 event pairs, 21 based on Foata normal form. 5/284 useless extension candidates. Maximal degree in co-relation 1828. Up to 192 conditions per place. [2023-11-06 22:07:33,290 INFO L140 encePairwiseOnDemand]: 193/203 looper letters, 57 selfloop transitions, 19 changer transitions 22/100 dead transitions. [2023-11-06 22:07:33,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 100 transitions, 1358 flow [2023-11-06 22:07:33,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:07:33,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-06 22:07:33,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 883 transitions. [2023-11-06 22:07:33,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4349753694581281 [2023-11-06 22:07:33,292 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 883 transitions. [2023-11-06 22:07:33,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 883 transitions. [2023-11-06 22:07:33,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:07:33,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 883 transitions. [2023-11-06 22:07:33,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 88.3) internal successors, (883), 10 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:33,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 203.0) internal successors, (2233), 11 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:33,297 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 203.0) internal successors, (2233), 11 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:33,297 INFO L175 Difference]: Start difference. First operand has 104 places, 72 transitions, 993 flow. Second operand 10 states and 883 transitions. [2023-11-06 22:07:33,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 100 transitions, 1358 flow [2023-11-06 22:07:33,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 100 transitions, 1248 flow, removed 10 selfloop flow, removed 13 redundant places. [2023-11-06 22:07:33,306 INFO L231 Difference]: Finished difference. Result has 98 places, 69 transitions, 892 flow [2023-11-06 22:07:33,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=887, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=892, PETRI_PLACES=98, PETRI_TRANSITIONS=69} [2023-11-06 22:07:33,307 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 63 predicate places. [2023-11-06 22:07:33,307 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 69 transitions, 892 flow [2023-11-06 22:07:33,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 84.9090909090909) internal successors, (934), 11 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:33,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:07:33,308 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:33,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-06 22:07:33,308 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:07:33,309 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:33,309 INFO L85 PathProgramCache]: Analyzing trace with hash 16738358, now seen corresponding path program 3 times [2023-11-06 22:07:33,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:07:33,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140139108] [2023-11-06 22:07:33,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:33,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:07:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:34,415 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:07:34,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:07:34,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140139108] [2023-11-06 22:07:34,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140139108] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:07:34,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:07:34,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:07:34,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560128511] [2023-11-06 22:07:34,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:07:34,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:07:34,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:07:34,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:07:34,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:07:34,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 203 [2023-11-06 22:07:34,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 69 transitions, 892 flow. Second operand has 8 states, 8 states have (on average 88.625) internal successors, (709), 8 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:34,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:07:34,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 203 [2023-11-06 22:07:34,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:07:34,896 INFO L124 PetriNetUnfolderBase]: 112/258 cut-off events. [2023-11-06 22:07:34,896 INFO L125 PetriNetUnfolderBase]: For 1969/1973 co-relation queries the response was YES. [2023-11-06 22:07:34,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1651 conditions, 258 events. 112/258 cut-off events. For 1969/1973 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 980 event pairs, 13 based on Foata normal form. 4/261 useless extension candidates. Maximal degree in co-relation 1619. Up to 124 conditions per place. [2023-11-06 22:07:34,899 INFO L140 encePairwiseOnDemand]: 193/203 looper letters, 40 selfloop transitions, 26 changer transitions 29/97 dead transitions. [2023-11-06 22:07:34,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 97 transitions, 1249 flow [2023-11-06 22:07:34,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:07:34,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-06 22:07:34,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 910 transitions. [2023-11-06 22:07:34,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4482758620689655 [2023-11-06 22:07:34,903 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 910 transitions. [2023-11-06 22:07:34,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 910 transitions. [2023-11-06 22:07:34,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:07:34,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 910 transitions. [2023-11-06 22:07:34,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 91.0) internal successors, (910), 10 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:34,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 203.0) internal successors, (2233), 11 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:34,911 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 203.0) internal successors, (2233), 11 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:34,911 INFO L175 Difference]: Start difference. First operand has 98 places, 69 transitions, 892 flow. Second operand 10 states and 910 transitions. [2023-11-06 22:07:34,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 97 transitions, 1249 flow [2023-11-06 22:07:34,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 97 transitions, 1166 flow, removed 7 selfloop flow, removed 14 redundant places. [2023-11-06 22:07:34,923 INFO L231 Difference]: Finished difference. Result has 93 places, 56 transitions, 674 flow [2023-11-06 22:07:34,923 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=674, PETRI_PLACES=93, PETRI_TRANSITIONS=56} [2023-11-06 22:07:34,930 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 58 predicate places. [2023-11-06 22:07:34,931 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 56 transitions, 674 flow [2023-11-06 22:07:34,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.625) internal successors, (709), 8 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:34,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:07:34,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:34,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-06 22:07:34,932 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:07:34,933 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:34,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1017809876, now seen corresponding path program 4 times [2023-11-06 22:07:34,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:07:34,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098979275] [2023-11-06 22:07:34,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:34,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:07:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:35,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:07:35,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:07:35,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098979275] [2023-11-06 22:07:35,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098979275] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:07:35,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:07:35,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:07:35,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774482633] [2023-11-06 22:07:35,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:07:35,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:07:35,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:07:35,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:07:35,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:07:35,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 203 [2023-11-06 22:07:35,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 56 transitions, 674 flow. Second operand has 8 states, 8 states have (on average 91.625) internal successors, (733), 8 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:35,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:07:35,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 203 [2023-11-06 22:07:35,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:07:35,816 INFO L124 PetriNetUnfolderBase]: 83/198 cut-off events. [2023-11-06 22:07:35,816 INFO L125 PetriNetUnfolderBase]: For 1664/1667 co-relation queries the response was YES. [2023-11-06 22:07:35,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1274 conditions, 198 events. 83/198 cut-off events. For 1664/1667 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 693 event pairs, 23 based on Foata normal form. 3/200 useless extension candidates. Maximal degree in co-relation 1246. Up to 135 conditions per place. [2023-11-06 22:07:35,817 INFO L140 encePairwiseOnDemand]: 197/203 looper letters, 44 selfloop transitions, 2 changer transitions 26/74 dead transitions. [2023-11-06 22:07:35,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 74 transitions, 924 flow [2023-11-06 22:07:35,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:07:35,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:07:35,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 661 transitions. [2023-11-06 22:07:35,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4651653764954258 [2023-11-06 22:07:35,820 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 661 transitions. [2023-11-06 22:07:35,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 661 transitions. [2023-11-06 22:07:35,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:07:35,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 661 transitions. [2023-11-06 22:07:35,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.42857142857143) internal successors, (661), 7 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:35,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 203.0) internal successors, (1624), 8 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:35,825 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 203.0) internal successors, (1624), 8 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:35,825 INFO L175 Difference]: Start difference. First operand has 93 places, 56 transitions, 674 flow. Second operand 7 states and 661 transitions. [2023-11-06 22:07:35,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 74 transitions, 924 flow [2023-11-06 22:07:35,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 74 transitions, 794 flow, removed 29 selfloop flow, removed 11 redundant places. [2023-11-06 22:07:35,835 INFO L231 Difference]: Finished difference. Result has 86 places, 48 transitions, 460 flow [2023-11-06 22:07:35,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=460, PETRI_PLACES=86, PETRI_TRANSITIONS=48} [2023-11-06 22:07:35,836 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 51 predicate places. [2023-11-06 22:07:35,837 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 48 transitions, 460 flow [2023-11-06 22:07:35,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.625) internal successors, (733), 8 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:35,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:07:35,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:35,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-06 22:07:35,838 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:07:35,838 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:35,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1550820644, now seen corresponding path program 5 times [2023-11-06 22:07:35,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:07:35,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171966026] [2023-11-06 22:07:35,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:35,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:07:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:37,922 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:07:37,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:07:37,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171966026] [2023-11-06 22:07:37,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171966026] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:07:37,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:07:37,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:07:37,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879255242] [2023-11-06 22:07:37,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:07:37,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 22:07:37,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:07:37,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 22:07:37,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:07:38,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 203 [2023-11-06 22:07:38,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 48 transitions, 460 flow. Second operand has 12 states, 12 states have (on average 85.75) internal successors, (1029), 12 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:38,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:07:38,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 203 [2023-11-06 22:07:38,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:07:38,603 INFO L124 PetriNetUnfolderBase]: 74/183 cut-off events. [2023-11-06 22:07:38,603 INFO L125 PetriNetUnfolderBase]: For 1037/1040 co-relation queries the response was YES. [2023-11-06 22:07:38,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 986 conditions, 183 events. 74/183 cut-off events. For 1037/1040 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 626 event pairs, 7 based on Foata normal form. 4/187 useless extension candidates. Maximal degree in co-relation 956. Up to 89 conditions per place. [2023-11-06 22:07:38,605 INFO L140 encePairwiseOnDemand]: 194/203 looper letters, 48 selfloop transitions, 12 changer transitions 23/84 dead transitions. [2023-11-06 22:07:38,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 84 transitions, 838 flow [2023-11-06 22:07:38,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:07:38,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-06 22:07:38,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 891 transitions. [2023-11-06 22:07:38,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43891625615763546 [2023-11-06 22:07:38,608 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 891 transitions. [2023-11-06 22:07:38,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 891 transitions. [2023-11-06 22:07:38,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:07:38,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 891 transitions. [2023-11-06 22:07:38,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 89.1) internal successors, (891), 10 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:38,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 203.0) internal successors, (2233), 11 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:38,612 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 203.0) internal successors, (2233), 11 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:38,612 INFO L175 Difference]: Start difference. First operand has 86 places, 48 transitions, 460 flow. Second operand 10 states and 891 transitions. [2023-11-06 22:07:38,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 84 transitions, 838 flow [2023-11-06 22:07:38,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 84 transitions, 788 flow, removed 15 selfloop flow, removed 9 redundant places. [2023-11-06 22:07:38,617 INFO L231 Difference]: Finished difference. Result has 79 places, 41 transitions, 360 flow [2023-11-06 22:07:38,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=360, PETRI_PLACES=79, PETRI_TRANSITIONS=41} [2023-11-06 22:07:38,618 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 44 predicate places. [2023-11-06 22:07:38,618 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 41 transitions, 360 flow [2023-11-06 22:07:38,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 85.75) internal successors, (1029), 12 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:38,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:07:38,618 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:38,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-06 22:07:38,619 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:07:38,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:38,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1682345092, now seen corresponding path program 6 times [2023-11-06 22:07:38,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:07:38,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745499698] [2023-11-06 22:07:38,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:38,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:07:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:39,200 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:07:39,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:07:39,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745499698] [2023-11-06 22:07:39,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745499698] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:07:39,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:07:39,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:07:39,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879107202] [2023-11-06 22:07:39,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:07:39,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:07:39,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:07:39,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:07:39,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:07:39,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 203 [2023-11-06 22:07:39,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 41 transitions, 360 flow. Second operand has 8 states, 8 states have (on average 90.625) internal successors, (725), 8 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:39,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:07:39,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 203 [2023-11-06 22:07:39,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:07:39,518 INFO L124 PetriNetUnfolderBase]: 42/112 cut-off events. [2023-11-06 22:07:39,518 INFO L125 PetriNetUnfolderBase]: For 512/513 co-relation queries the response was YES. [2023-11-06 22:07:39,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 112 events. 42/112 cut-off events. For 512/513 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 286 event pairs, 9 based on Foata normal form. 2/114 useless extension candidates. Maximal degree in co-relation 577. Up to 47 conditions per place. [2023-11-06 22:07:39,519 INFO L140 encePairwiseOnDemand]: 196/203 looper letters, 27 selfloop transitions, 4 changer transitions 27/59 dead transitions. [2023-11-06 22:07:39,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 59 transitions, 574 flow [2023-11-06 22:07:39,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:07:39,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:07:39,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 742 transitions. [2023-11-06 22:07:39,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45689655172413796 [2023-11-06 22:07:39,521 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 742 transitions. [2023-11-06 22:07:39,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 742 transitions. [2023-11-06 22:07:39,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:07:39,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 742 transitions. [2023-11-06 22:07:39,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 92.75) internal successors, (742), 8 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:39,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 203.0) internal successors, (1827), 9 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:39,526 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 203.0) internal successors, (1827), 9 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:39,526 INFO L175 Difference]: Start difference. First operand has 79 places, 41 transitions, 360 flow. Second operand 8 states and 742 transitions. [2023-11-06 22:07:39,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 59 transitions, 574 flow [2023-11-06 22:07:39,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 59 transitions, 454 flow, removed 19 selfloop flow, removed 20 redundant places. [2023-11-06 22:07:39,529 INFO L231 Difference]: Finished difference. Result has 66 places, 30 transitions, 166 flow [2023-11-06 22:07:39,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=166, PETRI_PLACES=66, PETRI_TRANSITIONS=30} [2023-11-06 22:07:39,529 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 31 predicate places. [2023-11-06 22:07:39,529 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 30 transitions, 166 flow [2023-11-06 22:07:39,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.625) internal successors, (725), 8 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:39,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:07:39,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:39,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-06 22:07:39,530 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:07:39,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:39,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1093371084, now seen corresponding path program 7 times [2023-11-06 22:07:39,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:07:39,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034353346] [2023-11-06 22:07:39,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:39,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:07:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:07:39,568 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:07:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:07:39,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:07:39,652 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:07:39,653 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-06 22:07:39,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-06 22:07:39,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-06 22:07:39,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-06 22:07:39,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-06 22:07:39,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-06 22:07:39,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-06 22:07:39,659 INFO L445 BasicCegarLoop]: Path program histogram: [7, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:39,665 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:07:39,665 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:07:39,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:07:39 BasicIcfg [2023-11-06 22:07:39,775 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:07:39,776 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:07:39,776 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:07:39,776 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:07:39,777 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:06:27" (3/4) ... [2023-11-06 22:07:39,778 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 22:07:39,904 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4240bfd8-1623-4faf-a36f-f45396075018/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:07:39,905 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:07:39,905 INFO L158 Benchmark]: Toolchain (without parser) took 74873.99ms. Allocated memory was 180.4MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 131.2MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2023-11-06 22:07:39,906 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 146.8MB. Free memory is still 92.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:07:39,906 INFO L158 Benchmark]: CACSL2BoogieTranslator took 829.86ms. Allocated memory is still 180.4MB. Free memory was 131.2MB in the beginning and 105.3MB in the end (delta: 25.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-11-06 22:07:39,906 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.97ms. Allocated memory is still 180.4MB. Free memory was 104.7MB in the beginning and 101.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:07:39,907 INFO L158 Benchmark]: Boogie Preprocessor took 81.54ms. Allocated memory is still 180.4MB. Free memory was 101.9MB in the beginning and 99.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:07:39,907 INFO L158 Benchmark]: RCFGBuilder took 1019.25ms. Allocated memory is still 180.4MB. Free memory was 99.8MB in the beginning and 137.3MB in the end (delta: -37.5MB). Peak memory consumption was 54.6MB. Max. memory is 16.1GB. [2023-11-06 22:07:39,907 INFO L158 Benchmark]: TraceAbstraction took 72712.96ms. Allocated memory was 180.4MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 137.3MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2023-11-06 22:07:39,913 INFO L158 Benchmark]: Witness Printer took 128.95ms. Allocated memory is still 4.8GB. Free memory was 2.9GB in the beginning and 2.9GB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:07:39,916 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 146.8MB. Free memory is still 92.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 829.86ms. Allocated memory is still 180.4MB. Free memory was 131.2MB in the beginning and 105.3MB in the end (delta: 25.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.97ms. Allocated memory is still 180.4MB. Free memory was 104.7MB in the beginning and 101.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.54ms. Allocated memory is still 180.4MB. Free memory was 101.9MB in the beginning and 99.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1019.25ms. Allocated memory is still 180.4MB. Free memory was 99.8MB in the beginning and 137.3MB in the end (delta: -37.5MB). Peak memory consumption was 54.6MB. Max. memory is 16.1GB. * TraceAbstraction took 72712.96ms. Allocated memory was 180.4MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 137.3MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. * Witness Printer took 128.95ms. Allocated memory is still 4.8GB. Free memory was 2.9GB in the beginning and 2.9GB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 115 PlacesBefore, 35 PlacesAfterwards, 107 TransitionsBefore, 26 TransitionsAfterwards, 2052 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 93 TotalNumberOfCompositions, 5199 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1966, independent: 1802, independent conditional: 0, independent unconditional: 1802, dependent: 164, dependent conditional: 0, dependent unconditional: 164, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1061, independent: 1031, independent conditional: 0, independent unconditional: 1031, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1966, independent: 771, independent conditional: 0, independent unconditional: 771, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 1061, unknown conditional: 0, unknown unconditional: 1061] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 66, Positive conditional cache size: 0, Positive unconditional cache size: 66, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2537; [L850] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2537, ((void *)0), P0, ((void *)0))=-1, t2537={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L851] 0 pthread_t t2538; [L852] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2538, ((void *)0), P1, ((void *)0))=0, t2537={5:0}, t2538={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L853] 0 pthread_t t2539; [L854] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2539, ((void *)0), P2, ((void *)0))=1, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L816] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L816] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L742] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L772] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 2 return 0; [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 [L882] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 137 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 72.5s, OverallIterations: 32, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 42.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2678 SdHoareTripleChecker+Valid, 9.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2259 mSDsluCounter, 2939 SdHoareTripleChecker+Invalid, 8.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2831 mSDsCounter, 956 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6710 IncrementalHoareTripleChecker+Invalid, 7666 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 956 mSolverCounterUnsat, 108 mSDtfsCounter, 6710 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 285 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9153occurred in iteration=15, InterpolantAutomatonStates: 258, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 23.5s InterpolantComputationTime, 535 NumberOfCodeBlocks, 535 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 482 ConstructedInterpolants, 0 QuantifiedInterpolants, 6094 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-06 22:07:39,954 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4240bfd8-1623-4faf-a36f-f45396075018/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE