./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe031_power.opt_pso.opt_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_47f8f7b2-f1fc-4de8-abf3-4a13e916eb72/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47f8f7b2-f1fc-4de8-abf3-4a13e916eb72/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_47f8f7b2-f1fc-4de8-abf3-4a13e916eb72/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47f8f7b2-f1fc-4de8-abf3-4a13e916eb72/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47f8f7b2-f1fc-4de8-abf3-4a13e916eb72/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_47f8f7b2-f1fc-4de8-abf3-4a13e916eb72/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 740668a6bdee7f1177df0d0d81e76f2a2521fb58ce5f63a4942f3d36e11f9dad --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:07:14,201 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:07:14,325 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47f8f7b2-f1fc-4de8-abf3-4a13e916eb72/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 23:07:14,337 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:07:14,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:07:14,364 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:07:14,365 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:07:14,366 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:07:14,367 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:07:14,367 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:07:14,368 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:07:14,369 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:07:14,370 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:07:14,370 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:07:14,371 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 23:07:14,371 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:07:14,372 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:07:14,373 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:07:14,373 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:07:14,374 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 23:07:14,374 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:07:14,375 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 23:07:14,376 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:07:14,376 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 23:07:14,377 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:07:14,378 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:07:14,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:07:14,379 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:07:14,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:07:14,380 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:07:14,380 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:07:14,381 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 23:07:14,381 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:07:14,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:07:14,382 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:07:14,383 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 23:07:14,383 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:07:14,384 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:07:14,384 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:07:14,384 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_47f8f7b2-f1fc-4de8-abf3-4a13e916eb72/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_47f8f7b2-f1fc-4de8-abf3-4a13e916eb72/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 -> 740668a6bdee7f1177df0d0d81e76f2a2521fb58ce5f63a4942f3d36e11f9dad [2023-11-06 23:07:14,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:07:14,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:07:14,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:07:14,708 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:07:14,708 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:07:14,710 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47f8f7b2-f1fc-4de8-abf3-4a13e916eb72/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i [2023-11-06 23:07:17,736 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:07:18,115 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:07:18,116 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47f8f7b2-f1fc-4de8-abf3-4a13e916eb72/sv-benchmarks/c/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i [2023-11-06 23:07:18,135 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47f8f7b2-f1fc-4de8-abf3-4a13e916eb72/bin/uautomizer-verify-WvqO1wxjHP/data/865fdf394/cf8e5dff09914ea8b3a5011c259d8e86/FLAG9218fed33 [2023-11-06 23:07:18,151 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47f8f7b2-f1fc-4de8-abf3-4a13e916eb72/bin/uautomizer-verify-WvqO1wxjHP/data/865fdf394/cf8e5dff09914ea8b3a5011c259d8e86 [2023-11-06 23:07:18,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:07:18,156 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:07:18,157 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:07:18,157 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:07:18,164 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:07:18,165 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:07:18" (1/1) ... [2023-11-06 23:07:18,166 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67da23f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:18, skipping insertion in model container [2023-11-06 23:07:18,166 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:07:18" (1/1) ... [2023-11-06 23:07:18,225 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:07:18,446 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_47f8f7b2-f1fc-4de8-abf3-4a13e916eb72/sv-benchmarks/c/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i[967,980] [2023-11-06 23:07:18,752 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:07:18,767 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:07:18,783 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_47f8f7b2-f1fc-4de8-abf3-4a13e916eb72/sv-benchmarks/c/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i[967,980] [2023-11-06 23:07:18,834 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:07:18,876 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:07:18,876 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:07:18,885 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:07:18,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:18 WrapperNode [2023-11-06 23:07:18,886 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:07:18,887 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:07:18,887 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:07:18,887 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:07:18,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:18" (1/1) ... [2023-11-06 23:07:18,915 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:18" (1/1) ... [2023-11-06 23:07:18,954 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2023-11-06 23:07:18,955 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:07:18,956 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:07:18,956 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:07:18,956 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:07:18,968 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:18" (1/1) ... [2023-11-06 23:07:18,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:18" (1/1) ... [2023-11-06 23:07:18,973 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:18" (1/1) ... [2023-11-06 23:07:18,974 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:18" (1/1) ... [2023-11-06 23:07:19,002 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:18" (1/1) ... [2023-11-06 23:07:19,005 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:18" (1/1) ... [2023-11-06 23:07:19,008 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:18" (1/1) ... [2023-11-06 23:07:19,010 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:18" (1/1) ... [2023-11-06 23:07:19,039 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:07:19,040 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:07:19,040 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:07:19,040 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:07:19,041 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:18" (1/1) ... [2023-11-06 23:07:19,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:07:19,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47f8f7b2-f1fc-4de8-abf3-4a13e916eb72/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:07:19,086 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47f8f7b2-f1fc-4de8-abf3-4a13e916eb72/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:07:19,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47f8f7b2-f1fc-4de8-abf3-4a13e916eb72/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:07:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 23:07:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 23:07:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:07:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 23:07:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 23:07:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 23:07:19,130 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 23:07:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 23:07:19,130 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 23:07:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 23:07:19,130 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 23:07:19,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:07:19,131 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 23:07:19,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:07:19,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:07:19,133 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 23:07:19,286 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:07:19,288 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:07:19,631 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:07:19,794 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:07:19,794 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 23:07:19,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:07:19 BoogieIcfgContainer [2023-11-06 23:07:19,797 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:07:19,799 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:07:19,799 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:07:19,803 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:07:19,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:07:18" (1/3) ... [2023-11-06 23:07:19,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a6199b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:07:19, skipping insertion in model container [2023-11-06 23:07:19,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:18" (2/3) ... [2023-11-06 23:07:19,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a6199b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:07:19, skipping insertion in model container [2023-11-06 23:07:19,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:07:19" (3/3) ... [2023-11-06 23:07:19,806 INFO L112 eAbstractionObserver]: Analyzing ICFG safe031_power.opt_pso.opt_rmo.opt.i [2023-11-06 23:07:19,816 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 23:07:19,829 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:07:19,829 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-06 23:07:19,829 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 23:07:19,891 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 23:07:19,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 230 flow [2023-11-06 23:07:20,032 INFO L124 PetriNetUnfolderBase]: 2/106 cut-off events. [2023-11-06 23:07:20,032 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:07:20,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2023-11-06 23:07:20,039 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 109 transitions, 230 flow [2023-11-06 23:07:20,047 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 106 transitions, 221 flow [2023-11-06 23:07:20,051 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 23:07:20,068 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 106 transitions, 221 flow [2023-11-06 23:07:20,072 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 106 transitions, 221 flow [2023-11-06 23:07:20,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 221 flow [2023-11-06 23:07:20,124 INFO L124 PetriNetUnfolderBase]: 2/106 cut-off events. [2023-11-06 23:07:20,124 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:07:20,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2023-11-06 23:07:20,128 INFO L119 LiptonReduction]: Number of co-enabled transitions 1944 [2023-11-06 23:07:25,745 INFO L134 LiptonReduction]: Checked pairs total: 4487 [2023-11-06 23:07:25,745 INFO L136 LiptonReduction]: Total number of compositions: 95 [2023-11-06 23:07:25,773 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:07:25,785 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;@5f2118de, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:07:25,786 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-06 23:07:25,791 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 23:07:25,791 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-11-06 23:07:25,791 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:07:25,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:25,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:07:25,793 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 23:07:25,798 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:25,799 INFO L85 PathProgramCache]: Analyzing trace with hash -914664420, now seen corresponding path program 1 times [2023-11-06 23:07:25,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:25,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377798276] [2023-11-06 23:07:25,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:25,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:26,451 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 23:07:26,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:26,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377798276] [2023-11-06 23:07:26,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377798276] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:26,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:26,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:07:26,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392801610] [2023-11-06 23:07:26,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:26,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:07:26,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:26,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:07:26,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:07:26,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 204 [2023-11-06 23:07:26,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 53 flow. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:26,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:26,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 204 [2023-11-06 23:07:26,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:07:26,892 INFO L124 PetriNetUnfolderBase]: 511/850 cut-off events. [2023-11-06 23:07:26,893 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-11-06 23:07:26,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1669 conditions, 850 events. 511/850 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4018 event pairs, 112 based on Foata normal form. 0/798 useless extension candidates. Maximal degree in co-relation 1658. Up to 580 conditions per place. [2023-11-06 23:07:26,914 INFO L140 encePairwiseOnDemand]: 201/204 looper letters, 23 selfloop transitions, 2 changer transitions 2/30 dead transitions. [2023-11-06 23:07:26,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 123 flow [2023-11-06 23:07:26,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:07:26,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:07:26,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 316 transitions. [2023-11-06 23:07:26,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5163398692810458 [2023-11-06 23:07:26,944 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 316 transitions. [2023-11-06 23:07:26,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 316 transitions. [2023-11-06 23:07:26,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:07:26,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 316 transitions. [2023-11-06 23:07:26,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:26,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 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 23:07:26,964 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 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 23:07:26,966 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 53 flow. Second operand 3 states and 316 transitions. [2023-11-06 23:07:26,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 123 flow [2023-11-06 23:07:26,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 23:07:26,972 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 50 flow [2023-11-06 23:07:26,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-11-06 23:07:26,979 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-11-06 23:07:26,979 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 50 flow [2023-11-06 23:07:26,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:26,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:26,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:07:26,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:07:26,981 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 23:07:26,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:26,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1475844203, now seen corresponding path program 1 times [2023-11-06 23:07:26,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:26,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705716147] [2023-11-06 23:07:26,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:26,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:27,426 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 23:07:27,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:27,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705716147] [2023-11-06 23:07:27,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705716147] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:27,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:27,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:07:27,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096050522] [2023-11-06 23:07:27,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:27,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:07:27,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:27,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:07:27,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:07:27,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 204 [2023-11-06 23:07:27,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:27,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:27,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 204 [2023-11-06 23:07:27,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:07:27,635 INFO L124 PetriNetUnfolderBase]: 489/772 cut-off events. [2023-11-06 23:07:27,635 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2023-11-06 23:07:27,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1604 conditions, 772 events. 489/772 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3244 event pairs, 207 based on Foata normal form. 8/779 useless extension candidates. Maximal degree in co-relation 1594. Up to 689 conditions per place. [2023-11-06 23:07:27,643 INFO L140 encePairwiseOnDemand]: 200/204 looper letters, 27 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2023-11-06 23:07:27,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 32 transitions, 140 flow [2023-11-06 23:07:27,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:07:27,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:07:27,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 313 transitions. [2023-11-06 23:07:27,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.511437908496732 [2023-11-06 23:07:27,648 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 313 transitions. [2023-11-06 23:07:27,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 313 transitions. [2023-11-06 23:07:27,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:07:27,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 313 transitions. [2023-11-06 23:07:27,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:27,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 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 23:07:27,660 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 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 23:07:27,660 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 50 flow. Second operand 3 states and 313 transitions. [2023-11-06 23:07:27,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 32 transitions, 140 flow [2023-11-06 23:07:27,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 32 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:07:27,664 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 65 flow [2023-11-06 23:07:27,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2023-11-06 23:07:27,666 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-11-06 23:07:27,672 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 65 flow [2023-11-06 23:07:27,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:27,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:27,673 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:07:27,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:07:27,674 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 23:07:27,674 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:27,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1493471387, now seen corresponding path program 1 times [2023-11-06 23:07:27,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:27,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581259089] [2023-11-06 23:07:27,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:27,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:27,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:28,295 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 23:07:28,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:28,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581259089] [2023-11-06 23:07:28,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581259089] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:28,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:28,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:07:28,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724507486] [2023-11-06 23:07:28,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:28,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:07:28,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:28,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:07:28,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:07:28,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 204 [2023-11-06 23:07:28,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 65 flow. Second operand has 4 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:28,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:28,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 204 [2023-11-06 23:07:28,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:07:28,559 INFO L124 PetriNetUnfolderBase]: 535/859 cut-off events. [2023-11-06 23:07:28,560 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-06 23:07:28,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1980 conditions, 859 events. 535/859 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3683 event pairs, 160 based on Foata normal form. 4/862 useless extension candidates. Maximal degree in co-relation 1969. Up to 733 conditions per place. [2023-11-06 23:07:28,570 INFO L140 encePairwiseOnDemand]: 200/204 looper letters, 25 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2023-11-06 23:07:28,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 31 transitions, 144 flow [2023-11-06 23:07:28,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:07:28,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:07:28,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 313 transitions. [2023-11-06 23:07:28,573 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.511437908496732 [2023-11-06 23:07:28,573 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 313 transitions. [2023-11-06 23:07:28,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 313 transitions. [2023-11-06 23:07:28,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:07:28,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 313 transitions. [2023-11-06 23:07:28,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:28,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 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 23:07:28,578 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 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 23:07:28,579 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 65 flow. Second operand 3 states and 313 transitions. [2023-11-06 23:07:28,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 31 transitions, 144 flow [2023-11-06 23:07:28,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 31 transitions, 140 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:07:28,581 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 81 flow [2023-11-06 23:07:28,581 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2023-11-06 23:07:28,582 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 0 predicate places. [2023-11-06 23:07:28,582 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 81 flow [2023-11-06 23:07:28,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:28,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:28,583 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:07:28,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 23:07:28,584 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 23:07:28,584 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:28,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1392863063, now seen corresponding path program 1 times [2023-11-06 23:07:28,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:28,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273862842] [2023-11-06 23:07:28,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:28,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:29,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:07:29,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:29,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273862842] [2023-11-06 23:07:29,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273862842] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:29,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:29,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:07:29,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886037446] [2023-11-06 23:07:29,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:29,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:07:29,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:29,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:07:29,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:07:29,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 204 [2023-11-06 23:07:29,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 81 flow. Second operand has 5 states, 5 states have (on average 96.2) internal successors, (481), 5 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:29,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:29,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 204 [2023-11-06 23:07:29,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:07:29,524 INFO L124 PetriNetUnfolderBase]: 509/823 cut-off events. [2023-11-06 23:07:29,524 INFO L125 PetriNetUnfolderBase]: For 302/302 co-relation queries the response was YES. [2023-11-06 23:07:29,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2024 conditions, 823 events. 509/823 cut-off events. For 302/302 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3504 event pairs, 150 based on Foata normal form. 10/832 useless extension candidates. Maximal degree in co-relation 2011. Up to 644 conditions per place. [2023-11-06 23:07:29,534 INFO L140 encePairwiseOnDemand]: 199/204 looper letters, 31 selfloop transitions, 5 changer transitions 0/39 dead transitions. [2023-11-06 23:07:29,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 39 transitions, 193 flow [2023-11-06 23:07:29,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:07:29,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:07:29,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 411 transitions. [2023-11-06 23:07:29,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5036764705882353 [2023-11-06 23:07:29,538 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 411 transitions. [2023-11-06 23:07:29,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 411 transitions. [2023-11-06 23:07:29,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:07:29,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 411 transitions. [2023-11-06 23:07:29,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:29,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:29,545 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:29,546 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 81 flow. Second operand 4 states and 411 transitions. [2023-11-06 23:07:29,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 39 transitions, 193 flow [2023-11-06 23:07:29,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 39 transitions, 190 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:07:29,548 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 103 flow [2023-11-06 23:07:29,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=103, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2023-11-06 23:07:29,550 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2023-11-06 23:07:29,550 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 103 flow [2023-11-06 23:07:29,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.2) internal successors, (481), 5 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:29,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:29,551 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:07:29,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 23:07:29,552 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 23:07:29,552 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:29,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1192006971, now seen corresponding path program 1 times [2023-11-06 23:07:29,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:29,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748806607] [2023-11-06 23:07:29,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:29,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:29,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:07:29,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:29,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748806607] [2023-11-06 23:07:29,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748806607] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:29,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:29,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:07:29,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522048017] [2023-11-06 23:07:29,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:29,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:07:29,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:29,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:07:29,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:07:29,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 204 [2023-11-06 23:07:29,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 103 flow. Second operand has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:29,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:29,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 204 [2023-11-06 23:07:29,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:07:30,079 INFO L124 PetriNetUnfolderBase]: 510/827 cut-off events. [2023-11-06 23:07:30,079 INFO L125 PetriNetUnfolderBase]: For 553/553 co-relation queries the response was YES. [2023-11-06 23:07:30,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2203 conditions, 827 events. 510/827 cut-off events. For 553/553 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3580 event pairs, 103 based on Foata normal form. 2/828 useless extension candidates. Maximal degree in co-relation 2188. Up to 576 conditions per place. [2023-11-06 23:07:30,089 INFO L140 encePairwiseOnDemand]: 198/204 looper letters, 32 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2023-11-06 23:07:30,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 227 flow [2023-11-06 23:07:30,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:07:30,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:07:30,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 416 transitions. [2023-11-06 23:07:30,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5098039215686274 [2023-11-06 23:07:30,092 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 416 transitions. [2023-11-06 23:07:30,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 416 transitions. [2023-11-06 23:07:30,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:07:30,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 416 transitions. [2023-11-06 23:07:30,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:30,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:30,099 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:30,099 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 103 flow. Second operand 4 states and 416 transitions. [2023-11-06 23:07:30,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 227 flow [2023-11-06 23:07:30,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 42 transitions, 218 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 23:07:30,104 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 126 flow [2023-11-06 23:07:30,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2023-11-06 23:07:30,107 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2023-11-06 23:07:30,108 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 126 flow [2023-11-06 23:07:30,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:30,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:30,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:07:30,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 23:07:30,109 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 23:07:30,110 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:30,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1191913041, now seen corresponding path program 2 times [2023-11-06 23:07:30,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:30,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299742616] [2023-11-06 23:07:30,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:30,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:30,594 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 23:07:30,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:30,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299742616] [2023-11-06 23:07:30,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299742616] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:30,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:30,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:07:30,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950808289] [2023-11-06 23:07:30,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:30,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:07:30,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:30,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:07:30,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:07:30,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 204 [2023-11-06 23:07:30,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 96.4) internal successors, (482), 5 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:30,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:30,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 204 [2023-11-06 23:07:30,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:07:30,859 INFO L124 PetriNetUnfolderBase]: 501/812 cut-off events. [2023-11-06 23:07:30,859 INFO L125 PetriNetUnfolderBase]: For 827/827 co-relation queries the response was YES. [2023-11-06 23:07:30,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2350 conditions, 812 events. 501/812 cut-off events. For 827/827 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3459 event pairs, 110 based on Foata normal form. 6/817 useless extension candidates. Maximal degree in co-relation 2334. Up to 574 conditions per place. [2023-11-06 23:07:30,868 INFO L140 encePairwiseOnDemand]: 198/204 looper letters, 31 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2023-11-06 23:07:30,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 41 transitions, 236 flow [2023-11-06 23:07:30,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:07:30,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:07:30,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 411 transitions. [2023-11-06 23:07:30,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5036764705882353 [2023-11-06 23:07:30,872 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 411 transitions. [2023-11-06 23:07:30,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 411 transitions. [2023-11-06 23:07:30,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:07:30,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 411 transitions. [2023-11-06 23:07:30,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:30,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:30,877 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:30,877 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 126 flow. Second operand 4 states and 411 transitions. [2023-11-06 23:07:30,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 41 transitions, 236 flow [2023-11-06 23:07:30,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 41 transitions, 230 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-06 23:07:30,881 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 142 flow [2023-11-06 23:07:30,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2023-11-06 23:07:30,882 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 8 predicate places. [2023-11-06 23:07:30,882 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 142 flow [2023-11-06 23:07:30,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.4) internal successors, (482), 5 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:30,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:30,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:07:30,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 23:07:30,883 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 23:07:30,883 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:30,884 INFO L85 PathProgramCache]: Analyzing trace with hash -706947710, now seen corresponding path program 1 times [2023-11-06 23:07:30,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:30,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684934090] [2023-11-06 23:07:30,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:30,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:31,846 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 23:07:31,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:31,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684934090] [2023-11-06 23:07:31,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684934090] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:31,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:31,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:07:31,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766711943] [2023-11-06 23:07:31,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:31,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:07:31,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:31,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:07:31,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:07:31,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 204 [2023-11-06 23:07:31,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:31,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:31,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 204 [2023-11-06 23:07:31,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:07:32,247 INFO L124 PetriNetUnfolderBase]: 970/1519 cut-off events. [2023-11-06 23:07:32,247 INFO L125 PetriNetUnfolderBase]: For 1867/1887 co-relation queries the response was YES. [2023-11-06 23:07:32,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4160 conditions, 1519 events. 970/1519 cut-off events. For 1867/1887 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6884 event pairs, 211 based on Foata normal form. 71/1589 useless extension candidates. Maximal degree in co-relation 4142. Up to 913 conditions per place. [2023-11-06 23:07:32,262 INFO L140 encePairwiseOnDemand]: 197/204 looper letters, 38 selfloop transitions, 10 changer transitions 0/51 dead transitions. [2023-11-06 23:07:32,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 51 transitions, 322 flow [2023-11-06 23:07:32,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:07:32,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:07:32,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 392 transitions. [2023-11-06 23:07:32,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4803921568627451 [2023-11-06 23:07:32,265 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 392 transitions. [2023-11-06 23:07:32,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 392 transitions. [2023-11-06 23:07:32,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:07:32,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 392 transitions. [2023-11-06 23:07:32,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:32,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:32,270 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:32,270 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 142 flow. Second operand 4 states and 392 transitions. [2023-11-06 23:07:32,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 51 transitions, 322 flow [2023-11-06 23:07:32,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 51 transitions, 300 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 23:07:32,275 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 204 flow [2023-11-06 23:07:32,275 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=204, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2023-11-06 23:07:32,276 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2023-11-06 23:07:32,276 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 204 flow [2023-11-06 23:07:32,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:32,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:32,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:07:32,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 23:07:32,277 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 23:07:32,278 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:32,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1465191811, now seen corresponding path program 1 times [2023-11-06 23:07:32,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:32,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709333312] [2023-11-06 23:07:32,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:32,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:32,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:33,268 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 23:07:33,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:33,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709333312] [2023-11-06 23:07:33,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709333312] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:33,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:33,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:07:33,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749384242] [2023-11-06 23:07:33,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:33,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:07:33,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:33,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:07:33,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:07:33,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 204 [2023-11-06 23:07:33,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 204 flow. Second operand has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:33,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:33,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 204 [2023-11-06 23:07:33,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:07:33,903 INFO L124 PetriNetUnfolderBase]: 1306/1998 cut-off events. [2023-11-06 23:07:33,904 INFO L125 PetriNetUnfolderBase]: For 2565/2565 co-relation queries the response was YES. [2023-11-06 23:07:33,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6051 conditions, 1998 events. 1306/1998 cut-off events. For 2565/2565 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9025 event pairs, 474 based on Foata normal form. 3/2001 useless extension candidates. Maximal degree in co-relation 6031. Up to 1562 conditions per place. [2023-11-06 23:07:33,920 INFO L140 encePairwiseOnDemand]: 194/204 looper letters, 44 selfloop transitions, 34 changer transitions 2/80 dead transitions. [2023-11-06 23:07:33,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 80 transitions, 565 flow [2023-11-06 23:07:33,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:07:33,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:07:33,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 571 transitions. [2023-11-06 23:07:33,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4665032679738562 [2023-11-06 23:07:33,924 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 571 transitions. [2023-11-06 23:07:33,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 571 transitions. [2023-11-06 23:07:33,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:07:33,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 571 transitions. [2023-11-06 23:07:33,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:33,931 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 204.0) internal successors, (1428), 7 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:33,931 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 204.0) internal successors, (1428), 7 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:33,932 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 204 flow. Second operand 6 states and 571 transitions. [2023-11-06 23:07:33,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 80 transitions, 565 flow [2023-11-06 23:07:33,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 80 transitions, 538 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-11-06 23:07:33,940 INFO L231 Difference]: Finished difference. Result has 50 places, 57 transitions, 469 flow [2023-11-06 23:07:33,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=469, PETRI_PLACES=50, PETRI_TRANSITIONS=57} [2023-11-06 23:07:33,941 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 18 predicate places. [2023-11-06 23:07:33,941 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 57 transitions, 469 flow [2023-11-06 23:07:33,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:33,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:33,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:07:33,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 23:07:33,943 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 23:07:33,943 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:33,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1463648941, now seen corresponding path program 2 times [2023-11-06 23:07:33,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:33,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791023572] [2023-11-06 23:07:33,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:33,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:33,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:34,382 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 23:07:34,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:34,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791023572] [2023-11-06 23:07:34,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791023572] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:34,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:34,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:07:34,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77022312] [2023-11-06 23:07:34,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:34,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:07:34,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:34,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:07:34,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:07:34,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 204 [2023-11-06 23:07:34,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 57 transitions, 469 flow. Second operand has 5 states, 5 states have (on average 95.6) internal successors, (478), 5 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:34,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:34,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 204 [2023-11-06 23:07:34,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:07:34,805 INFO L124 PetriNetUnfolderBase]: 964/1587 cut-off events. [2023-11-06 23:07:34,806 INFO L125 PetriNetUnfolderBase]: For 4690/4690 co-relation queries the response was YES. [2023-11-06 23:07:34,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6191 conditions, 1587 events. 964/1587 cut-off events. For 4690/4690 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8058 event pairs, 186 based on Foata normal form. 11/1575 useless extension candidates. Maximal degree in co-relation 6166. Up to 1070 conditions per place. [2023-11-06 23:07:34,822 INFO L140 encePairwiseOnDemand]: 197/204 looper letters, 45 selfloop transitions, 21 changer transitions 0/73 dead transitions. [2023-11-06 23:07:34,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 73 transitions, 659 flow [2023-11-06 23:07:34,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:07:34,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:07:34,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 600 transitions. [2023-11-06 23:07:34,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49019607843137253 [2023-11-06 23:07:34,827 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 600 transitions. [2023-11-06 23:07:34,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 600 transitions. [2023-11-06 23:07:34,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:07:34,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 600 transitions. [2023-11-06 23:07:34,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.0) internal successors, (600), 6 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:34,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 204.0) internal successors, (1428), 7 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:34,834 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 204.0) internal successors, (1428), 7 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:34,835 INFO L175 Difference]: Start difference. First operand has 50 places, 57 transitions, 469 flow. Second operand 6 states and 600 transitions. [2023-11-06 23:07:34,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 73 transitions, 659 flow [2023-11-06 23:07:34,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 73 transitions, 648 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-11-06 23:07:34,850 INFO L231 Difference]: Finished difference. Result has 54 places, 56 transitions, 482 flow [2023-11-06 23:07:34,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=482, PETRI_PLACES=54, PETRI_TRANSITIONS=56} [2023-11-06 23:07:34,852 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 22 predicate places. [2023-11-06 23:07:34,852 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 56 transitions, 482 flow [2023-11-06 23:07:34,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.6) internal successors, (478), 5 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:34,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:34,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:07:34,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 23:07:34,853 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 23:07:34,854 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:34,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1723405835, now seen corresponding path program 3 times [2023-11-06 23:07:34,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:34,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110781739] [2023-11-06 23:07:34,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:34,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:35,577 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 23:07:35,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:35,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110781739] [2023-11-06 23:07:35,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110781739] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:35,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:35,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:07:35,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553085917] [2023-11-06 23:07:35,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:35,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:07:35,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:35,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:07:35,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:07:35,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 204 [2023-11-06 23:07:35,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 56 transitions, 482 flow. Second operand has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:35,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:35,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 204 [2023-11-06 23:07:35,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:07:36,276 INFO L124 PetriNetUnfolderBase]: 1347/2076 cut-off events. [2023-11-06 23:07:36,277 INFO L125 PetriNetUnfolderBase]: For 5966/5966 co-relation queries the response was YES. [2023-11-06 23:07:36,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8439 conditions, 2076 events. 1347/2076 cut-off events. For 5966/5966 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 9544 event pairs, 188 based on Foata normal form. 6/2082 useless extension candidates. Maximal degree in co-relation 8413. Up to 1720 conditions per place. [2023-11-06 23:07:36,294 INFO L140 encePairwiseOnDemand]: 196/204 looper letters, 76 selfloop transitions, 32 changer transitions 4/112 dead transitions. [2023-11-06 23:07:36,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 112 transitions, 1052 flow [2023-11-06 23:07:36,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 23:07:36,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 23:07:36,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 752 transitions. [2023-11-06 23:07:36,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46078431372549017 [2023-11-06 23:07:36,299 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 752 transitions. [2023-11-06 23:07:36,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 752 transitions. [2023-11-06 23:07:36,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:07:36,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 752 transitions. [2023-11-06 23:07:36,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 94.0) internal successors, (752), 8 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:36,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 204.0) internal successors, (1836), 9 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:36,308 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 204.0) internal successors, (1836), 9 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:36,308 INFO L175 Difference]: Start difference. First operand has 54 places, 56 transitions, 482 flow. Second operand 8 states and 752 transitions. [2023-11-06 23:07:36,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 112 transitions, 1052 flow [2023-11-06 23:07:36,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 112 transitions, 1013 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-11-06 23:07:36,326 INFO L231 Difference]: Finished difference. Result has 60 places, 72 transitions, 695 flow [2023-11-06 23:07:36,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=695, PETRI_PLACES=60, PETRI_TRANSITIONS=72} [2023-11-06 23:07:36,328 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 28 predicate places. [2023-11-06 23:07:36,329 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 72 transitions, 695 flow [2023-11-06 23:07:36,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:36,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:36,331 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:07:36,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 23:07:36,331 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 23:07:36,331 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:36,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1462279981, now seen corresponding path program 4 times [2023-11-06 23:07:36,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:36,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197945437] [2023-11-06 23:07:36,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:36,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:36,926 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 23:07:36,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:36,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197945437] [2023-11-06 23:07:36,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197945437] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:36,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:36,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:07:36,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668369001] [2023-11-06 23:07:36,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:36,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:07:36,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:36,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:07:36,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:07:36,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 204 [2023-11-06 23:07:36,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 72 transitions, 695 flow. Second operand has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:36,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:36,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 204 [2023-11-06 23:07:36,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:07:37,429 INFO L124 PetriNetUnfolderBase]: 1187/1962 cut-off events. [2023-11-06 23:07:37,429 INFO L125 PetriNetUnfolderBase]: For 7751/7765 co-relation queries the response was YES. [2023-11-06 23:07:37,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8571 conditions, 1962 events. 1187/1962 cut-off events. For 7751/7765 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 10601 event pairs, 173 based on Foata normal form. 23/1949 useless extension candidates. Maximal degree in co-relation 8543. Up to 1299 conditions per place. [2023-11-06 23:07:37,455 INFO L140 encePairwiseOnDemand]: 197/204 looper letters, 64 selfloop transitions, 35 changer transitions 0/106 dead transitions. [2023-11-06 23:07:37,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 106 transitions, 1123 flow [2023-11-06 23:07:37,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:07:37,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:07:37,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 509 transitions. [2023-11-06 23:07:37,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49901960784313726 [2023-11-06 23:07:37,459 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 509 transitions. [2023-11-06 23:07:37,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 509 transitions. [2023-11-06 23:07:37,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:07:37,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 509 transitions. [2023-11-06 23:07:37,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:37,465 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:37,466 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:37,466 INFO L175 Difference]: Start difference. First operand has 60 places, 72 transitions, 695 flow. Second operand 5 states and 509 transitions. [2023-11-06 23:07:37,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 106 transitions, 1123 flow [2023-11-06 23:07:37,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 106 transitions, 1083 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-11-06 23:07:37,493 INFO L231 Difference]: Finished difference. Result has 62 places, 85 transitions, 899 flow [2023-11-06 23:07:37,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=899, PETRI_PLACES=62, PETRI_TRANSITIONS=85} [2023-11-06 23:07:37,494 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 30 predicate places. [2023-11-06 23:07:37,494 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 85 transitions, 899 flow [2023-11-06 23:07:37,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:37,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:37,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:07:37,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 23:07:37,495 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 23:07:37,495 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:37,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1722079655, now seen corresponding path program 5 times [2023-11-06 23:07:37,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:37,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317274763] [2023-11-06 23:07:37,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:37,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:37,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:37,945 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 23:07:37,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:37,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317274763] [2023-11-06 23:07:37,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317274763] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:37,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:37,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:07:37,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565612129] [2023-11-06 23:07:37,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:37,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:07:37,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:37,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:07:37,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:07:37,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 204 [2023-11-06 23:07:37,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 85 transitions, 899 flow. Second operand has 6 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:37,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:37,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 204 [2023-11-06 23:07:37,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:07:38,518 INFO L124 PetriNetUnfolderBase]: 1576/2442 cut-off events. [2023-11-06 23:07:38,519 INFO L125 PetriNetUnfolderBase]: For 9952/9952 co-relation queries the response was YES. [2023-11-06 23:07:38,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11576 conditions, 2442 events. 1576/2442 cut-off events. For 9952/9952 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 11991 event pairs, 467 based on Foata normal form. 12/2454 useless extension candidates. Maximal degree in co-relation 11547. Up to 1764 conditions per place. [2023-11-06 23:07:38,543 INFO L140 encePairwiseOnDemand]: 196/204 looper letters, 66 selfloop transitions, 52 changer transitions 3/121 dead transitions. [2023-11-06 23:07:38,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 121 transitions, 1401 flow [2023-11-06 23:07:38,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:07:38,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:07:38,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 488 transitions. [2023-11-06 23:07:38,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47843137254901963 [2023-11-06 23:07:38,547 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 488 transitions. [2023-11-06 23:07:38,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 488 transitions. [2023-11-06 23:07:38,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:07:38,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 488 transitions. [2023-11-06 23:07:38,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.6) internal successors, (488), 5 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:38,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:38,554 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:38,554 INFO L175 Difference]: Start difference. First operand has 62 places, 85 transitions, 899 flow. Second operand 5 states and 488 transitions. [2023-11-06 23:07:38,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 121 transitions, 1401 flow [2023-11-06 23:07:38,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 121 transitions, 1349 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-06 23:07:38,586 INFO L231 Difference]: Finished difference. Result has 66 places, 98 transitions, 1212 flow [2023-11-06 23:07:38,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=853, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1212, PETRI_PLACES=66, PETRI_TRANSITIONS=98} [2023-11-06 23:07:38,589 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 34 predicate places. [2023-11-06 23:07:38,589 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 98 transitions, 1212 flow [2023-11-06 23:07:38,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:38,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:38,590 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:07:38,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 23:07:38,590 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 23:07:38,591 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:38,591 INFO L85 PathProgramCache]: Analyzing trace with hash -2049166814, now seen corresponding path program 1 times [2023-11-06 23:07:38,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:38,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328800797] [2023-11-06 23:07:38,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:38,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:38,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:38,767 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 23:07:38,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:38,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328800797] [2023-11-06 23:07:38,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328800797] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:38,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:38,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:07:38,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872403691] [2023-11-06 23:07:38,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:38,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:07:38,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:38,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:07:38,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:07:38,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 204 [2023-11-06 23:07:38,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 98 transitions, 1212 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 23:07:38,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:38,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 204 [2023-11-06 23:07:38,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:07:39,179 INFO L124 PetriNetUnfolderBase]: 822/1424 cut-off events. [2023-11-06 23:07:39,180 INFO L125 PetriNetUnfolderBase]: For 12988/13260 co-relation queries the response was YES. [2023-11-06 23:07:39,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7419 conditions, 1424 events. 822/1424 cut-off events. For 12988/13260 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 8179 event pairs, 112 based on Foata normal form. 356/1745 useless extension candidates. Maximal degree in co-relation 7387. Up to 818 conditions per place. [2023-11-06 23:07:39,192 INFO L140 encePairwiseOnDemand]: 198/204 looper letters, 99 selfloop transitions, 7 changer transitions 63/180 dead transitions. [2023-11-06 23:07:39,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 180 transitions, 2527 flow [2023-11-06 23:07:39,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:07:39,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:07:39,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 503 transitions. [2023-11-06 23:07:39,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4931372549019608 [2023-11-06 23:07:39,196 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 503 transitions. [2023-11-06 23:07:39,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 503 transitions. [2023-11-06 23:07:39,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:07:39,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 503 transitions. [2023-11-06 23:07:39,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:39,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:39,203 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:39,203 INFO L175 Difference]: Start difference. First operand has 66 places, 98 transitions, 1212 flow. Second operand 5 states and 503 transitions. [2023-11-06 23:07:39,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 180 transitions, 2527 flow [2023-11-06 23:07:39,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 180 transitions, 2394 flow, removed 23 selfloop flow, removed 2 redundant places. [2023-11-06 23:07:39,240 INFO L231 Difference]: Finished difference. Result has 71 places, 80 transitions, 905 flow [2023-11-06 23:07:39,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=942, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=905, PETRI_PLACES=71, PETRI_TRANSITIONS=80} [2023-11-06 23:07:39,241 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 39 predicate places. [2023-11-06 23:07:39,241 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 80 transitions, 905 flow [2023-11-06 23:07:39,242 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 23:07:39,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:39,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:07:39,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 23:07:39,243 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 23:07:39,243 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:39,243 INFO L85 PathProgramCache]: Analyzing trace with hash 608877123, now seen corresponding path program 1 times [2023-11-06 23:07:39,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:39,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593099056] [2023-11-06 23:07:39,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:39,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:39,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:39,462 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 23:07:39,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:39,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593099056] [2023-11-06 23:07:39,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593099056] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:39,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:39,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:07:39,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254803215] [2023-11-06 23:07:39,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:39,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:07:39,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:39,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:07:39,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:07:39,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 204 [2023-11-06 23:07:39,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 80 transitions, 905 flow. Second operand has 5 states, 5 states have (on average 93.6) internal successors, (468), 5 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:39,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:39,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 204 [2023-11-06 23:07:39,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:07:39,875 INFO L124 PetriNetUnfolderBase]: 526/978 cut-off events. [2023-11-06 23:07:39,875 INFO L125 PetriNetUnfolderBase]: For 8556/8790 co-relation queries the response was YES. [2023-11-06 23:07:39,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5419 conditions, 978 events. 526/978 cut-off events. For 8556/8790 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5518 event pairs, 32 based on Foata normal form. 285/1242 useless extension candidates. Maximal degree in co-relation 5384. Up to 305 conditions per place. [2023-11-06 23:07:39,884 INFO L140 encePairwiseOnDemand]: 198/204 looper letters, 96 selfloop transitions, 11 changer transitions 61/179 dead transitions. [2023-11-06 23:07:39,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 179 transitions, 2330 flow [2023-11-06 23:07:39,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:07:39,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:07:39,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 703 transitions. [2023-11-06 23:07:39,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49229691876750703 [2023-11-06 23:07:39,890 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 703 transitions. [2023-11-06 23:07:39,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 703 transitions. [2023-11-06 23:07:39,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:07:39,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 703 transitions. [2023-11-06 23:07:39,894 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 23:07:39,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 204.0) internal successors, (1632), 8 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:39,899 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 204.0) internal successors, (1632), 8 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:39,900 INFO L175 Difference]: Start difference. First operand has 71 places, 80 transitions, 905 flow. Second operand 7 states and 703 transitions. [2023-11-06 23:07:39,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 179 transitions, 2330 flow [2023-11-06 23:07:39,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 179 transitions, 2204 flow, removed 21 selfloop flow, removed 2 redundant places. [2023-11-06 23:07:39,924 INFO L231 Difference]: Finished difference. Result has 78 places, 71 transitions, 773 flow [2023-11-06 23:07:39,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=773, PETRI_PLACES=78, PETRI_TRANSITIONS=71} [2023-11-06 23:07:39,926 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 46 predicate places. [2023-11-06 23:07:39,926 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 71 transitions, 773 flow [2023-11-06 23:07:39,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.6) internal successors, (468), 5 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:39,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:39,927 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:07:39,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 23:07:39,927 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 23:07:39,928 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:39,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1374564524, now seen corresponding path program 1 times [2023-11-06 23:07:39,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:39,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929660482] [2023-11-06 23:07:39,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:39,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:39,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:40,115 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 23:07:40,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:40,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929660482] [2023-11-06 23:07:40,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929660482] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:40,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:40,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:07:40,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051775330] [2023-11-06 23:07:40,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:40,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:07:40,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:40,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:07:40,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:07:40,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 204 [2023-11-06 23:07:40,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 71 transitions, 773 flow. Second operand has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:40,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:40,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 204 [2023-11-06 23:07:40,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:07:40,455 INFO L124 PetriNetUnfolderBase]: 439/823 cut-off events. [2023-11-06 23:07:40,456 INFO L125 PetriNetUnfolderBase]: For 6341/6507 co-relation queries the response was YES. [2023-11-06 23:07:40,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4709 conditions, 823 events. 439/823 cut-off events. For 6341/6507 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4587 event pairs, 29 based on Foata normal form. 147/952 useless extension candidates. Maximal degree in co-relation 4671. Up to 248 conditions per place. [2023-11-06 23:07:40,462 INFO L140 encePairwiseOnDemand]: 198/204 looper letters, 60 selfloop transitions, 12 changer transitions 92/171 dead transitions. [2023-11-06 23:07:40,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 171 transitions, 2163 flow [2023-11-06 23:07:40,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 23:07:40,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 23:07:40,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 883 transitions. [2023-11-06 23:07:40,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4809368191721133 [2023-11-06 23:07:40,467 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 883 transitions. [2023-11-06 23:07:40,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 883 transitions. [2023-11-06 23:07:40,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:07:40,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 883 transitions. [2023-11-06 23:07:40,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.11111111111111) internal successors, (883), 9 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 23:07:40,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 204.0) internal successors, (2040), 10 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:40,476 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 204.0) internal successors, (2040), 10 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:40,477 INFO L175 Difference]: Start difference. First operand has 78 places, 71 transitions, 773 flow. Second operand 9 states and 883 transitions. [2023-11-06 23:07:40,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 171 transitions, 2163 flow [2023-11-06 23:07:40,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 171 transitions, 1881 flow, removed 38 selfloop flow, removed 10 redundant places. [2023-11-06 23:07:40,499 INFO L231 Difference]: Finished difference. Result has 78 places, 53 transitions, 497 flow [2023-11-06 23:07:40,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=497, PETRI_PLACES=78, PETRI_TRANSITIONS=53} [2023-11-06 23:07:40,500 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 46 predicate places. [2023-11-06 23:07:40,500 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 53 transitions, 497 flow [2023-11-06 23:07:40,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:40,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:40,501 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 23:07:40,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 23:07:40,502 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 23:07:40,502 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:40,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1513478849, now seen corresponding path program 1 times [2023-11-06 23:07:40,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:40,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363569487] [2023-11-06 23:07:40,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:40,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:40,706 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 23:07:40,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:40,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363569487] [2023-11-06 23:07:40,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363569487] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:40,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:40,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:07:40,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289496350] [2023-11-06 23:07:40,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:40,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:07:40,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:40,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:07:40,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:07:40,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 204 [2023-11-06 23:07:40,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 53 transitions, 497 flow. Second operand has 4 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:40,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:40,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 204 [2023-11-06 23:07:40,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:07:40,893 INFO L124 PetriNetUnfolderBase]: 251/476 cut-off events. [2023-11-06 23:07:40,894 INFO L125 PetriNetUnfolderBase]: For 2381/2389 co-relation queries the response was YES. [2023-11-06 23:07:40,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2527 conditions, 476 events. 251/476 cut-off events. For 2381/2389 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2199 event pairs, 29 based on Foata normal form. 7/471 useless extension candidates. Maximal degree in co-relation 2491. Up to 266 conditions per place. [2023-11-06 23:07:40,897 INFO L140 encePairwiseOnDemand]: 201/204 looper letters, 34 selfloop transitions, 1 changer transitions 51/89 dead transitions. [2023-11-06 23:07:40,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 89 transitions, 993 flow [2023-11-06 23:07:40,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:07:40,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:07:40,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 407 transitions. [2023-11-06 23:07:40,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4987745098039216 [2023-11-06 23:07:40,901 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 407 transitions. [2023-11-06 23:07:40,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 407 transitions. [2023-11-06 23:07:40,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:07:40,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 407 transitions. [2023-11-06 23:07:40,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 101.75) internal successors, (407), 4 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:40,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:40,908 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:40,908 INFO L175 Difference]: Start difference. First operand has 78 places, 53 transitions, 497 flow. Second operand 4 states and 407 transitions. [2023-11-06 23:07:40,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 89 transitions, 993 flow [2023-11-06 23:07:40,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 89 transitions, 810 flow, removed 39 selfloop flow, removed 15 redundant places. [2023-11-06 23:07:40,919 INFO L231 Difference]: Finished difference. Result has 64 places, 33 transitions, 215 flow [2023-11-06 23:07:40,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=215, PETRI_PLACES=64, PETRI_TRANSITIONS=33} [2023-11-06 23:07:40,920 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 32 predicate places. [2023-11-06 23:07:40,920 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 33 transitions, 215 flow [2023-11-06 23:07:40,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:40,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:40,921 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 23:07:40,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 23:07:40,921 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 23:07:40,922 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:40,922 INFO L85 PathProgramCache]: Analyzing trace with hash -464590971, now seen corresponding path program 2 times [2023-11-06 23:07:40,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:40,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316403009] [2023-11-06 23:07:40,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:40,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:40,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:41,711 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 23:07:41,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:41,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316403009] [2023-11-06 23:07:41,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316403009] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:41,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:41,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:07:41,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427799306] [2023-11-06 23:07:41,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:41,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:07:41,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:41,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:07:41,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:07:41,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 204 [2023-11-06 23:07:41,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 33 transitions, 215 flow. Second operand has 7 states, 7 states have (on average 95.57142857142857) internal successors, (669), 7 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:41,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:41,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 204 [2023-11-06 23:07:41,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:07:41,910 INFO L124 PetriNetUnfolderBase]: 67/157 cut-off events. [2023-11-06 23:07:41,911 INFO L125 PetriNetUnfolderBase]: For 358/358 co-relation queries the response was YES. [2023-11-06 23:07:41,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 685 conditions, 157 events. 67/157 cut-off events. For 358/358 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 511 event pairs, 12 based on Foata normal form. 1/157 useless extension candidates. Maximal degree in co-relation 665. Up to 80 conditions per place. [2023-11-06 23:07:41,912 INFO L140 encePairwiseOnDemand]: 198/204 looper letters, 25 selfloop transitions, 5 changer transitions 14/46 dead transitions. [2023-11-06 23:07:41,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 46 transitions, 380 flow [2023-11-06 23:07:41,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:07:41,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:07:41,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 586 transitions. [2023-11-06 23:07:41,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47875816993464054 [2023-11-06 23:07:41,916 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 586 transitions. [2023-11-06 23:07:41,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 586 transitions. [2023-11-06 23:07:41,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:07:41,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 586 transitions. [2023-11-06 23:07:41,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 97.66666666666667) internal successors, (586), 6 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:41,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 204.0) internal successors, (1428), 7 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:41,924 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 204.0) internal successors, (1428), 7 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:41,924 INFO L175 Difference]: Start difference. First operand has 64 places, 33 transitions, 215 flow. Second operand 6 states and 586 transitions. [2023-11-06 23:07:41,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 46 transitions, 380 flow [2023-11-06 23:07:41,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 46 transitions, 331 flow, removed 14 selfloop flow, removed 11 redundant places. [2023-11-06 23:07:41,927 INFO L231 Difference]: Finished difference. Result has 51 places, 28 transitions, 158 flow [2023-11-06 23:07:41,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=158, PETRI_PLACES=51, PETRI_TRANSITIONS=28} [2023-11-06 23:07:41,928 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 19 predicate places. [2023-11-06 23:07:41,928 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 28 transitions, 158 flow [2023-11-06 23:07:41,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.57142857142857) internal successors, (669), 7 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:41,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:41,929 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 23:07:41,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 23:07:41,930 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 23:07:41,930 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:41,930 INFO L85 PathProgramCache]: Analyzing trace with hash -548455899, now seen corresponding path program 3 times [2023-11-06 23:07:41,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:41,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260478175] [2023-11-06 23:07:41,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:41,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:41,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:07:41,979 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:07:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:07:42,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 23:07:42,055 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 23:07:42,056 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-06 23:07:42,058 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-06 23:07:42,058 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-06 23:07:42,059 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-06 23:07:42,059 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-06 23:07:42,059 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-06 23:07:42,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 23:07:42,060 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:07:42,066 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 23:07:42,067 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:07:42,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:07:42 BasicIcfg [2023-11-06 23:07:42,188 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:07:42,188 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:07:42,188 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:07:42,189 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:07:42,189 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:07:19" (3/4) ... [2023-11-06 23:07:42,190 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 23:07:42,317 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47f8f7b2-f1fc-4de8-abf3-4a13e916eb72/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 23:07:42,318 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:07:42,321 INFO L158 Benchmark]: Toolchain (without parser) took 24162.90ms. Allocated memory was 161.5MB in the beginning and 532.7MB in the end (delta: 371.2MB). Free memory was 130.0MB in the beginning and 487.1MB in the end (delta: -357.1MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2023-11-06 23:07:42,321 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 104.9MB. Free memory is still 55.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:07:42,322 INFO L158 Benchmark]: CACSL2BoogieTranslator took 729.09ms. Allocated memory is still 161.5MB. Free memory was 130.0MB in the beginning and 106.5MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 23:07:42,322 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.03ms. Allocated memory is still 161.5MB. Free memory was 106.5MB in the beginning and 103.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:07:42,322 INFO L158 Benchmark]: Boogie Preprocessor took 83.62ms. Allocated memory is still 161.5MB. Free memory was 103.9MB in the beginning and 102.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:07:42,323 INFO L158 Benchmark]: RCFGBuilder took 756.87ms. Allocated memory is still 161.5MB. Free memory was 101.7MB in the beginning and 112.4MB in the end (delta: -10.7MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2023-11-06 23:07:42,323 INFO L158 Benchmark]: TraceAbstraction took 22388.49ms. Allocated memory was 161.5MB in the beginning and 532.7MB in the end (delta: 371.2MB). Free memory was 111.1MB in the beginning and 496.5MB in the end (delta: -385.3MB). Peak memory consumption was 300.2MB. Max. memory is 16.1GB. [2023-11-06 23:07:42,324 INFO L158 Benchmark]: Witness Printer took 129.59ms. Allocated memory is still 532.7MB. Free memory was 496.5MB in the beginning and 487.1MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-06 23:07:42,326 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.28ms. Allocated memory is still 104.9MB. Free memory is still 55.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 729.09ms. Allocated memory is still 161.5MB. Free memory was 130.0MB in the beginning and 106.5MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.03ms. Allocated memory is still 161.5MB. Free memory was 106.5MB in the beginning and 103.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.62ms. Allocated memory is still 161.5MB. Free memory was 103.9MB in the beginning and 102.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 756.87ms. Allocated memory is still 161.5MB. Free memory was 101.7MB in the beginning and 112.4MB in the end (delta: -10.7MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. * TraceAbstraction took 22388.49ms. Allocated memory was 161.5MB in the beginning and 532.7MB in the end (delta: 371.2MB). Free memory was 111.1MB in the beginning and 496.5MB in the end (delta: -385.3MB). Peak memory consumption was 300.2MB. Max. memory is 16.1GB. * Witness Printer took 129.59ms. Allocated memory is still 532.7MB. Free memory was 496.5MB in the beginning and 487.1MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 114 PlacesBefore, 32 PlacesAfterwards, 106 TransitionsBefore, 22 TransitionsAfterwards, 1944 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 95 TotalNumberOfCompositions, 4487 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2068, independent: 1922, independent conditional: 0, independent unconditional: 1922, dependent: 146, dependent conditional: 0, dependent unconditional: 146, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1067, independent: 1018, independent conditional: 0, independent unconditional: 1018, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2068, independent: 904, independent conditional: 0, independent unconditional: 904, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 1067, unknown conditional: 0, unknown unconditional: 1067] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 49, Positive conditional cache size: 0, Positive unconditional cache size: 49, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L815] 0 pthread_t t2516; [L816] FCALL, FORK 0 pthread_create(&t2516, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2516, ((void *)0), P0, ((void *)0))=-3, t2516={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L817] 0 pthread_t t2517; [L818] FCALL, FORK 0 pthread_create(&t2517, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2517, ((void *)0), P1, ((void *)0))=-2, t2516={5:0}, t2517={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L819] 0 pthread_t t2518; [L820] FCALL, FORK 0 pthread_create(&t2518, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2518, ((void *)0), P2, ((void *)0))=-1, t2516={5:0}, t2517={6:0}, t2518={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L782] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L782] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L758] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L764] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L793] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L794] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L795] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L796] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L797] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L800] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 3 return 0; [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L824] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L824] RET 0 assume_abort_if_not(main$tmp_guard0) [L826] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L830] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2516={5:0}, t2517={6:0}, t2518={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L833] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 0 y$flush_delayed = weak$$choice2 [L836] 0 y$mem_tmp = y [L837] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L838] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L839] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L840] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L841] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L843] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L845] 0 y = y$flush_delayed ? y$mem_tmp : y [L846] 0 y$flush_delayed = (_Bool)0 [L848] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 820]: 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: 818]: 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, 135 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: 22.1s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 569 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 467 mSDsluCounter, 202 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 120 mSDsCounter, 169 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1299 IncrementalHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 169 mSolverCounterUnsat, 82 mSDtfsCounter, 1299 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1212occurred in iteration=12, InterpolantAutomatonStates: 86, 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.5s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 241 NumberOfCodeBlocks, 241 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 1621 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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 23:07:42,368 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47f8f7b2-f1fc-4de8-abf3-4a13e916eb72/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE