./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix005.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed50be7-bf22-4c7a-829b-762dae944ed5/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed50be7-bf22-4c7a-829b-762dae944ed5/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed50be7-bf22-4c7a-829b-762dae944ed5/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed50be7-bf22-4c7a-829b-762dae944ed5/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix005.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed50be7-bf22-4c7a-829b-762dae944ed5/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed50be7-bf22-4c7a-829b-762dae944ed5/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --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 0c4e58b38f229da1b25a4c7b1c830f1f36e4dc5c1e18903f04a209f4b4cfa3c5 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:48:53,193 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:48:53,320 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed50be7-bf22-4c7a-829b-762dae944ed5/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:48:53,327 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:48:53,327 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:48:53,352 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:48:53,353 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:48:53,354 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:48:53,355 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:48:53,355 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:48:53,356 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:48:53,357 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:48:53,357 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:48:53,358 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:48:53,358 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:48:53,359 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:48:53,359 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:48:53,360 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:48:53,360 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:48:53,360 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:48:53,361 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:48:53,361 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:48:53,362 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:48:53,362 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:48:53,363 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:48:53,363 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:48:53,364 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:48:53,364 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:48:53,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:48:53,365 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:48:53,365 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:48:53,366 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:48:53,366 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:48:53,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:48:53,366 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:48:53,367 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:48:53,367 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:48:53,367 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:48:53,367 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:48:53,368 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_6ed50be7-bf22-4c7a-829b-762dae944ed5/bin/uautomizer-verify-uCwYo4JHxu/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_6ed50be7-bf22-4c7a-829b-762dae944ed5/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 0c4e58b38f229da1b25a4c7b1c830f1f36e4dc5c1e18903f04a209f4b4cfa3c5 [2023-11-19 07:48:53,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:48:53,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:48:53,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:48:53,765 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:48:53,766 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:48:53,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed50be7-bf22-4c7a-829b-762dae944ed5/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix005.opt.i [2023-11-19 07:48:56,932 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:48:57,239 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:48:57,244 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed50be7-bf22-4c7a-829b-762dae944ed5/sv-benchmarks/c/pthread-wmm/mix005.opt.i [2023-11-19 07:48:57,269 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed50be7-bf22-4c7a-829b-762dae944ed5/bin/uautomizer-verify-uCwYo4JHxu/data/00a3fb0d5/1dafa36a3cf243f8a04507eba6827cba/FLAGbde521ba1 [2023-11-19 07:48:57,290 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed50be7-bf22-4c7a-829b-762dae944ed5/bin/uautomizer-verify-uCwYo4JHxu/data/00a3fb0d5/1dafa36a3cf243f8a04507eba6827cba [2023-11-19 07:48:57,295 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:48:57,297 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:48:57,299 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:48:57,300 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:48:57,308 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:48:57,311 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:48:57" (1/1) ... [2023-11-19 07:48:57,312 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5150c88d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:57, skipping insertion in model container [2023-11-19 07:48:57,313 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:48:57" (1/1) ... [2023-11-19 07:48:57,390 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:48:57,593 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_6ed50be7-bf22-4c7a-829b-762dae944ed5/sv-benchmarks/c/pthread-wmm/mix005.opt.i[944,957] [2023-11-19 07:48:57,875 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:48:57,902 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:48:57,918 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_6ed50be7-bf22-4c7a-829b-762dae944ed5/sv-benchmarks/c/pthread-wmm/mix005.opt.i[944,957] [2023-11-19 07:48:58,025 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:48:58,073 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:48:58,074 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:48:58,083 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:48:58,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:58 WrapperNode [2023-11-19 07:48:58,084 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:48:58,086 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:48:58,086 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:48:58,086 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:48:58,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:58" (1/1) ... [2023-11-19 07:48:58,144 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:58" (1/1) ... [2023-11-19 07:48:58,217 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 165 [2023-11-19 07:48:58,218 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:48:58,219 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:48:58,219 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:48:58,220 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:48:58,233 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:58" (1/1) ... [2023-11-19 07:48:58,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:58" (1/1) ... [2023-11-19 07:48:58,253 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:58" (1/1) ... [2023-11-19 07:48:58,259 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:58" (1/1) ... [2023-11-19 07:48:58,272 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:58" (1/1) ... [2023-11-19 07:48:58,289 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:58" (1/1) ... [2023-11-19 07:48:58,293 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:58" (1/1) ... [2023-11-19 07:48:58,309 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:58" (1/1) ... [2023-11-19 07:48:58,314 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:48:58,316 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:48:58,316 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:48:58,316 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:48:58,317 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:58" (1/1) ... [2023-11-19 07:48:58,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:48:58,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed50be7-bf22-4c7a-829b-762dae944ed5/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:48:58,369 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed50be7-bf22-4c7a-829b-762dae944ed5/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:48:58,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed50be7-bf22-4c7a-829b-762dae944ed5/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:48:58,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:48:58,466 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:48:58,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:48:58,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:48:58,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:48:58,467 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:48:58,472 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:48:58,472 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:48:58,472 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:48:58,473 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 07:48:58,475 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 07:48:58,475 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-19 07:48:58,476 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-19 07:48:58,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:48:58,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:48:58,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:48:58,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:48:58,479 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 07:48:58,739 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:48:58,742 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:48:59,243 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:48:59,471 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:48:59,472 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:48:59,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:48:59 BoogieIcfgContainer [2023-11-19 07:48:59,479 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:48:59,483 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:48:59,484 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:48:59,487 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:48:59,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:48:57" (1/3) ... [2023-11-19 07:48:59,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@607ac363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:48:59, skipping insertion in model container [2023-11-19 07:48:59,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:58" (2/3) ... [2023-11-19 07:48:59,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@607ac363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:48:59, skipping insertion in model container [2023-11-19 07:48:59,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:48:59" (3/3) ... [2023-11-19 07:48:59,494 INFO L112 eAbstractionObserver]: Analyzing ICFG mix005.opt.i [2023-11-19 07:48:59,504 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 07:48:59,516 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:48:59,516 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-19 07:48:59,517 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:48:59,591 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:48:59,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 288 flow [2023-11-19 07:48:59,700 INFO L124 PetriNetUnfolderBase]: 2/132 cut-off events. [2023-11-19 07:48:59,701 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:48:59,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2023-11-19 07:48:59,709 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 136 transitions, 288 flow [2023-11-19 07:48:59,715 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 132 transitions, 276 flow [2023-11-19 07:48:59,719 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:48:59,729 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 132 transitions, 276 flow [2023-11-19 07:48:59,733 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 132 transitions, 276 flow [2023-11-19 07:48:59,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 276 flow [2023-11-19 07:48:59,853 INFO L124 PetriNetUnfolderBase]: 2/132 cut-off events. [2023-11-19 07:48:59,853 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:48:59,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2023-11-19 07:48:59,859 INFO L119 LiptonReduction]: Number of co-enabled transitions 3490 [2023-11-19 07:49:05,558 INFO L134 LiptonReduction]: Checked pairs total: 7758 [2023-11-19 07:49:05,558 INFO L136 LiptonReduction]: Total number of compositions: 117 [2023-11-19 07:49:05,574 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:49:05,581 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=LoopHeads, 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;@2329eb64, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:49:05,581 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-19 07:49:05,587 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:49:05,587 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2023-11-19 07:49:05,587 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:49:05,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:49:05,588 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:49:05,589 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:49:05,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:49:05,594 INFO L85 PathProgramCache]: Analyzing trace with hash -308982097, now seen corresponding path program 1 times [2023-11-19 07:49:05,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:49:05,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102552466] [2023-11-19 07:49:05,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:49:05,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:49:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:06,302 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-19 07:49:06,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:49:06,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102552466] [2023-11-19 07:49:06,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102552466] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:49:06,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:49:06,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:49:06,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840795787] [2023-11-19 07:49:06,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:49:06,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:49:06,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:49:06,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:49:06,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:49:06,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 253 [2023-11-19 07:49:06,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:06,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:49:06,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 253 [2023-11-19 07:49:06,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:49:07,185 INFO L124 PetriNetUnfolderBase]: 2594/3785 cut-off events. [2023-11-19 07:49:07,186 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-11-19 07:49:07,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7480 conditions, 3785 events. 2594/3785 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 19939 event pairs, 518 based on Foata normal form. 0/3592 useless extension candidates. Maximal degree in co-relation 7468. Up to 2797 conditions per place. [2023-11-19 07:49:07,226 INFO L140 encePairwiseOnDemand]: 249/253 looper letters, 30 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2023-11-19 07:49:07,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 156 flow [2023-11-19 07:49:07,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:49:07,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:49:07,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2023-11-19 07:49:07,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.530961791831357 [2023-11-19 07:49:07,246 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 403 transitions. [2023-11-19 07:49:07,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 403 transitions. [2023-11-19 07:49:07,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:49:07,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 403 transitions. [2023-11-19 07:49:07,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:07,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:07,262 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:07,264 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 403 transitions. [2023-11-19 07:49:07,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 156 flow [2023-11-19 07:49:07,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 152 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-19 07:49:07,272 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow [2023-11-19 07:49:07,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-11-19 07:49:07,278 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-11-19 07:49:07,278 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow [2023-11-19 07:49:07,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:07,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:49:07,279 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:49:07,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:49:07,280 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:49:07,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:49:07,280 INFO L85 PathProgramCache]: Analyzing trace with hash -578999884, now seen corresponding path program 1 times [2023-11-19 07:49:07,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:49:07,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817162666] [2023-11-19 07:49:07,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:49:07,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:49:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:07,560 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-19 07:49:07,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:49:07,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817162666] [2023-11-19 07:49:07,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817162666] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:49:07,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:49:07,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:49:07,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506770256] [2023-11-19 07:49:07,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:49:07,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:49:07,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:49:07,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:49:07,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:49:07,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 253 [2023-11-19 07:49:07,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:07,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:49:07,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 253 [2023-11-19 07:49:07,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:49:09,312 INFO L124 PetriNetUnfolderBase]: 8249/11366 cut-off events. [2023-11-19 07:49:09,312 INFO L125 PetriNetUnfolderBase]: For 412/412 co-relation queries the response was YES. [2023-11-19 07:49:09,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23478 conditions, 11366 events. 8249/11366 cut-off events. For 412/412 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 56506 event pairs, 2997 based on Foata normal form. 248/11614 useless extension candidates. Maximal degree in co-relation 23468. Up to 8501 conditions per place. [2023-11-19 07:49:09,404 INFO L140 encePairwiseOnDemand]: 244/253 looper letters, 39 selfloop transitions, 8 changer transitions 0/47 dead transitions. [2023-11-19 07:49:09,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 206 flow [2023-11-19 07:49:09,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:49:09,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:49:09,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2023-11-19 07:49:09,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5059288537549407 [2023-11-19 07:49:09,408 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2023-11-19 07:49:09,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2023-11-19 07:49:09,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:49:09,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2023-11-19 07:49:09,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:09,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:09,420 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:09,420 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 3 states and 384 transitions. [2023-11-19 07:49:09,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 47 transitions, 206 flow [2023-11-19 07:49:09,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:49:09,435 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 122 flow [2023-11-19 07:49:09,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2023-11-19 07:49:09,443 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2023-11-19 07:49:09,443 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 122 flow [2023-11-19 07:49:09,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:09,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:49:09,444 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:49:09,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:49:09,445 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:49:09,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:49:09,449 INFO L85 PathProgramCache]: Analyzing trace with hash -769128321, now seen corresponding path program 1 times [2023-11-19 07:49:09,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:49:09,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939775985] [2023-11-19 07:49:09,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:49:09,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:49:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:09,752 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-19 07:49:09,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:49:09,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939775985] [2023-11-19 07:49:09,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939775985] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:49:09,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:49:09,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:49:09,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863658717] [2023-11-19 07:49:09,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:49:09,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:49:09,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:49:09,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:49:09,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:49:09,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 253 [2023-11-19 07:49:09,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:09,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:49:09,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 253 [2023-11-19 07:49:09,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:49:11,438 INFO L124 PetriNetUnfolderBase]: 7489/10342 cut-off events. [2023-11-19 07:49:11,439 INFO L125 PetriNetUnfolderBase]: For 3909/3909 co-relation queries the response was YES. [2023-11-19 07:49:11,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26752 conditions, 10342 events. 7489/10342 cut-off events. For 3909/3909 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 50644 event pairs, 2285 based on Foata normal form. 176/10518 useless extension candidates. Maximal degree in co-relation 26740. Up to 5489 conditions per place. [2023-11-19 07:49:11,547 INFO L140 encePairwiseOnDemand]: 244/253 looper letters, 53 selfloop transitions, 9 changer transitions 0/62 dead transitions. [2023-11-19 07:49:11,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 62 transitions, 336 flow [2023-11-19 07:49:11,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:49:11,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:49:11,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 505 transitions. [2023-11-19 07:49:11,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4990118577075099 [2023-11-19 07:49:11,551 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 505 transitions. [2023-11-19 07:49:11,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 505 transitions. [2023-11-19 07:49:11,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:49:11,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 505 transitions. [2023-11-19 07:49:11,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:11,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:11,559 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:11,559 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 122 flow. Second operand 4 states and 505 transitions. [2023-11-19 07:49:11,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 62 transitions, 336 flow [2023-11-19 07:49:11,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 62 transitions, 310 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:49:11,599 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 174 flow [2023-11-19 07:49:11,600 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=174, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2023-11-19 07:49:11,600 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2023-11-19 07:49:11,601 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 174 flow [2023-11-19 07:49:11,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:11,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:49:11,602 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:49:11,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:49:11,602 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:49:11,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:49:11,603 INFO L85 PathProgramCache]: Analyzing trace with hash -469228139, now seen corresponding path program 1 times [2023-11-19 07:49:11,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:49:11,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008175532] [2023-11-19 07:49:11,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:49:11,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:49:11,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:11,877 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-19 07:49:11,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:49:11,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008175532] [2023-11-19 07:49:11,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008175532] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:49:11,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:49:11,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:49:11,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22150125] [2023-11-19 07:49:11,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:49:11,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:49:11,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:49:11,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:49:11,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:49:11,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 253 [2023-11-19 07:49:11,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 115.25) internal successors, (461), 4 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:11,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:49:11,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 253 [2023-11-19 07:49:11,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:49:13,232 INFO L124 PetriNetUnfolderBase]: 7093/9802 cut-off events. [2023-11-19 07:49:13,232 INFO L125 PetriNetUnfolderBase]: For 8021/8021 co-relation queries the response was YES. [2023-11-19 07:49:13,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27155 conditions, 9802 events. 7093/9802 cut-off events. For 8021/8021 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 45873 event pairs, 2037 based on Foata normal form. 96/9898 useless extension candidates. Maximal degree in co-relation 27140. Up to 5037 conditions per place. [2023-11-19 07:49:13,308 INFO L140 encePairwiseOnDemand]: 244/253 looper letters, 51 selfloop transitions, 14 changer transitions 0/65 dead transitions. [2023-11-19 07:49:13,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 65 transitions, 412 flow [2023-11-19 07:49:13,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:49:13,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:49:13,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 500 transitions. [2023-11-19 07:49:13,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49407114624505927 [2023-11-19 07:49:13,311 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 500 transitions. [2023-11-19 07:49:13,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 500 transitions. [2023-11-19 07:49:13,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:49:13,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 500 transitions. [2023-11-19 07:49:13,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:13,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:13,317 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:13,317 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 174 flow. Second operand 4 states and 500 transitions. [2023-11-19 07:49:13,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 65 transitions, 412 flow [2023-11-19 07:49:13,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 65 transitions, 407 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:49:13,332 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 302 flow [2023-11-19 07:49:13,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=302, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2023-11-19 07:49:13,333 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2023-11-19 07:49:13,333 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 302 flow [2023-11-19 07:49:13,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.25) internal successors, (461), 4 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:13,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:49:13,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:49:13,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:49:13,335 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:49:13,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:49:13,335 INFO L85 PathProgramCache]: Analyzing trace with hash -561932236, now seen corresponding path program 1 times [2023-11-19 07:49:13,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:49:13,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381571890] [2023-11-19 07:49:13,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:49:13,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:49:13,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:13,587 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-19 07:49:13,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:49:13,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381571890] [2023-11-19 07:49:13,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381571890] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:49:13,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:49:13,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:49:13,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947681874] [2023-11-19 07:49:13,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:49:13,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:49:13,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:49:13,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:49:13,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:49:13,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 253 [2023-11-19 07:49:13,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 302 flow. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:13,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:49:13,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 253 [2023-11-19 07:49:13,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:49:14,858 INFO L124 PetriNetUnfolderBase]: 6965/9626 cut-off events. [2023-11-19 07:49:14,858 INFO L125 PetriNetUnfolderBase]: For 13109/13109 co-relation queries the response was YES. [2023-11-19 07:49:14,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29721 conditions, 9626 events. 6965/9626 cut-off events. For 13109/13109 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 46352 event pairs, 1823 based on Foata normal form. 24/9650 useless extension candidates. Maximal degree in co-relation 29702. Up to 6623 conditions per place. [2023-11-19 07:49:14,938 INFO L140 encePairwiseOnDemand]: 244/253 looper letters, 57 selfloop transitions, 27 changer transitions 0/84 dead transitions. [2023-11-19 07:49:14,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 84 transitions, 620 flow [2023-11-19 07:49:14,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:49:14,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:49:14,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 514 transitions. [2023-11-19 07:49:14,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079051383399209 [2023-11-19 07:49:14,942 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 514 transitions. [2023-11-19 07:49:14,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 514 transitions. [2023-11-19 07:49:14,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:49:14,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 514 transitions. [2023-11-19 07:49:14,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:14,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:14,949 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:14,950 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 302 flow. Second operand 4 states and 514 transitions. [2023-11-19 07:49:14,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 84 transitions, 620 flow [2023-11-19 07:49:14,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 84 transitions, 614 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:49:14,986 INFO L231 Difference]: Finished difference. Result has 52 places, 53 transitions, 453 flow [2023-11-19 07:49:14,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=453, PETRI_PLACES=52, PETRI_TRANSITIONS=53} [2023-11-19 07:49:14,987 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2023-11-19 07:49:14,987 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 53 transitions, 453 flow [2023-11-19 07:49:14,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:14,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:49:14,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:49:14,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:49:14,989 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:49:14,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:49:14,989 INFO L85 PathProgramCache]: Analyzing trace with hash 108074013, now seen corresponding path program 1 times [2023-11-19 07:49:14,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:49:14,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283551664] [2023-11-19 07:49:14,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:49:14,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:49:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:15,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:49:15,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:49:15,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283551664] [2023-11-19 07:49:15,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283551664] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:49:15,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:49:15,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:49:15,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097540453] [2023-11-19 07:49:15,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:49:15,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:49:15,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:49:15,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:49:15,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:49:15,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 253 [2023-11-19 07:49:15,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 53 transitions, 453 flow. Second operand has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:15,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:49:15,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 253 [2023-11-19 07:49:15,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:49:16,433 INFO L124 PetriNetUnfolderBase]: 4715/7024 cut-off events. [2023-11-19 07:49:16,433 INFO L125 PetriNetUnfolderBase]: For 13767/14910 co-relation queries the response was YES. [2023-11-19 07:49:16,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21766 conditions, 7024 events. 4715/7024 cut-off events. For 13767/14910 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 41730 event pairs, 852 based on Foata normal form. 815/7472 useless extension candidates. Maximal degree in co-relation 21744. Up to 4494 conditions per place. [2023-11-19 07:49:16,492 INFO L140 encePairwiseOnDemand]: 246/253 looper letters, 92 selfloop transitions, 10 changer transitions 0/122 dead transitions. [2023-11-19 07:49:16,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 122 transitions, 1137 flow [2023-11-19 07:49:16,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:49:16,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:49:16,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 629 transitions. [2023-11-19 07:49:16,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4972332015810277 [2023-11-19 07:49:16,495 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 629 transitions. [2023-11-19 07:49:16,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 629 transitions. [2023-11-19 07:49:16,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:49:16,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 629 transitions. [2023-11-19 07:49:16,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.8) internal successors, (629), 5 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:16,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:16,502 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:16,502 INFO L175 Difference]: Start difference. First operand has 52 places, 53 transitions, 453 flow. Second operand 5 states and 629 transitions. [2023-11-19 07:49:16,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 122 transitions, 1137 flow [2023-11-19 07:49:16,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 122 transitions, 1137 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:49:16,520 INFO L231 Difference]: Finished difference. Result has 59 places, 62 transitions, 528 flow [2023-11-19 07:49:16,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=528, PETRI_PLACES=59, PETRI_TRANSITIONS=62} [2023-11-19 07:49:16,521 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2023-11-19 07:49:16,521 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 62 transitions, 528 flow [2023-11-19 07:49:16,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:16,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:49:16,522 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:49:16,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:49:16,522 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:49:16,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:49:16,523 INFO L85 PathProgramCache]: Analyzing trace with hash 295248851, now seen corresponding path program 1 times [2023-11-19 07:49:16,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:49:16,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249983326] [2023-11-19 07:49:16,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:49:16,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:49:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:16,795 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-19 07:49:16,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:49:16,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249983326] [2023-11-19 07:49:16,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249983326] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:49:16,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:49:16,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:49:16,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853643726] [2023-11-19 07:49:16,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:49:16,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:49:16,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:49:16,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:49:16,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:49:16,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 253 [2023-11-19 07:49:16,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 62 transitions, 528 flow. Second operand has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:16,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:49:16,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 253 [2023-11-19 07:49:16,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:49:18,292 INFO L124 PetriNetUnfolderBase]: 6857/10422 cut-off events. [2023-11-19 07:49:18,292 INFO L125 PetriNetUnfolderBase]: For 28860/29893 co-relation queries the response was YES. [2023-11-19 07:49:18,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42422 conditions, 10422 events. 6857/10422 cut-off events. For 28860/29893 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 66777 event pairs, 1099 based on Foata normal form. 425/10627 useless extension candidates. Maximal degree in co-relation 42395. Up to 5063 conditions per place. [2023-11-19 07:49:18,376 INFO L140 encePairwiseOnDemand]: 250/253 looper letters, 70 selfloop transitions, 3 changer transitions 28/116 dead transitions. [2023-11-19 07:49:18,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 116 transitions, 1076 flow [2023-11-19 07:49:18,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:49:18,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:49:18,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 526 transitions. [2023-11-19 07:49:18,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5197628458498024 [2023-11-19 07:49:18,380 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 526 transitions. [2023-11-19 07:49:18,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 526 transitions. [2023-11-19 07:49:18,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:49:18,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 526 transitions. [2023-11-19 07:49:18,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:18,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:18,387 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:18,387 INFO L175 Difference]: Start difference. First operand has 59 places, 62 transitions, 528 flow. Second operand 4 states and 526 transitions. [2023-11-19 07:49:18,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 116 transitions, 1076 flow [2023-11-19 07:49:18,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 116 transitions, 1064 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:49:18,482 INFO L231 Difference]: Finished difference. Result has 63 places, 58 transitions, 509 flow [2023-11-19 07:49:18,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=509, PETRI_PLACES=63, PETRI_TRANSITIONS=58} [2023-11-19 07:49:18,483 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2023-11-19 07:49:18,483 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 58 transitions, 509 flow [2023-11-19 07:49:18,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:18,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:49:18,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:49:18,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:49:18,484 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:49:18,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:49:18,485 INFO L85 PathProgramCache]: Analyzing trace with hash 698173158, now seen corresponding path program 1 times [2023-11-19 07:49:18,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:49:18,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256533055] [2023-11-19 07:49:18,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:49:18,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:49:18,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:18,726 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-19 07:49:18,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:49:18,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256533055] [2023-11-19 07:49:18,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256533055] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:49:18,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:49:18,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:49:18,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013448530] [2023-11-19 07:49:18,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:49:18,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:49:18,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:49:18,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:49:18,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:49:18,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 253 [2023-11-19 07:49:18,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 58 transitions, 509 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:18,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:49:18,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 253 [2023-11-19 07:49:18,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:49:20,723 INFO L124 PetriNetUnfolderBase]: 7238/11137 cut-off events. [2023-11-19 07:49:20,723 INFO L125 PetriNetUnfolderBase]: For 32204/32455 co-relation queries the response was YES. [2023-11-19 07:49:20,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43985 conditions, 11137 events. 7238/11137 cut-off events. For 32204/32455 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 71038 event pairs, 3353 based on Foata normal form. 106/10835 useless extension candidates. Maximal degree in co-relation 43956. Up to 5410 conditions per place. [2023-11-19 07:49:20,805 INFO L140 encePairwiseOnDemand]: 250/253 looper letters, 54 selfloop transitions, 10 changer transitions 6/80 dead transitions. [2023-11-19 07:49:20,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 80 transitions, 739 flow [2023-11-19 07:49:20,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:49:20,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:49:20,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2023-11-19 07:49:20,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5296442687747036 [2023-11-19 07:49:20,809 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 402 transitions. [2023-11-19 07:49:20,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 402 transitions. [2023-11-19 07:49:20,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:49:20,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 402 transitions. [2023-11-19 07:49:20,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:20,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:20,814 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:20,815 INFO L175 Difference]: Start difference. First operand has 63 places, 58 transitions, 509 flow. Second operand 3 states and 402 transitions. [2023-11-19 07:49:20,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 80 transitions, 739 flow [2023-11-19 07:49:21,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 80 transitions, 733 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-19 07:49:21,231 INFO L231 Difference]: Finished difference. Result has 63 places, 53 transitions, 473 flow [2023-11-19 07:49:21,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=473, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2023-11-19 07:49:21,234 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2023-11-19 07:49:21,234 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 53 transitions, 473 flow [2023-11-19 07:49:21,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:21,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:49:21,235 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:49:21,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:49:21,235 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:49:21,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:49:21,236 INFO L85 PathProgramCache]: Analyzing trace with hash 375564061, now seen corresponding path program 2 times [2023-11-19 07:49:21,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:49:21,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770573677] [2023-11-19 07:49:21,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:49:21,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:49:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:21,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-19 07:49:21,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:49:21,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770573677] [2023-11-19 07:49:21,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770573677] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:49:21,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:49:21,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:49:21,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535068392] [2023-11-19 07:49:21,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:49:21,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:49:21,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:49:21,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:49:21,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:49:21,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 253 [2023-11-19 07:49:21,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 53 transitions, 473 flow. Second operand has 5 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:21,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:49:21,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 253 [2023-11-19 07:49:21,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:49:23,032 INFO L124 PetriNetUnfolderBase]: 4110/6542 cut-off events. [2023-11-19 07:49:23,033 INFO L125 PetriNetUnfolderBase]: For 13962/14796 co-relation queries the response was YES. [2023-11-19 07:49:23,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24595 conditions, 6542 events. 4110/6542 cut-off events. For 13962/14796 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 42118 event pairs, 475 based on Foata normal form. 839/7108 useless extension candidates. Maximal degree in co-relation 24566. Up to 2810 conditions per place. [2023-11-19 07:49:23,079 INFO L140 encePairwiseOnDemand]: 246/253 looper letters, 107 selfloop transitions, 15 changer transitions 15/152 dead transitions. [2023-11-19 07:49:23,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 152 transitions, 1572 flow [2023-11-19 07:49:23,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:49:23,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:49:23,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 878 transitions. [2023-11-19 07:49:23,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4957651044607566 [2023-11-19 07:49:23,085 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 878 transitions. [2023-11-19 07:49:23,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 878 transitions. [2023-11-19 07:49:23,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:49:23,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 878 transitions. [2023-11-19 07:49:23,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.42857142857143) internal successors, (878), 7 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:23,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 253.0) internal successors, (2024), 8 states have internal predecessors, (2024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:23,098 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 253.0) internal successors, (2024), 8 states have internal predecessors, (2024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:23,099 INFO L175 Difference]: Start difference. First operand has 63 places, 53 transitions, 473 flow. Second operand 7 states and 878 transitions. [2023-11-19 07:49:23,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 152 transitions, 1572 flow [2023-11-19 07:49:23,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 152 transitions, 1527 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-11-19 07:49:23,127 INFO L231 Difference]: Finished difference. Result has 71 places, 62 transitions, 583 flow [2023-11-19 07:49:23,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=583, PETRI_PLACES=71, PETRI_TRANSITIONS=62} [2023-11-19 07:49:23,128 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 30 predicate places. [2023-11-19 07:49:23,129 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 62 transitions, 583 flow [2023-11-19 07:49:23,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:23,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:49:23,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:49:23,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:49:23,130 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:49:23,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:49:23,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1502367869, now seen corresponding path program 1 times [2023-11-19 07:49:23,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:49:23,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656579109] [2023-11-19 07:49:23,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:49:23,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:49:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:23,393 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-19 07:49:23,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:49:23,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656579109] [2023-11-19 07:49:23,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656579109] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:49:23,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:49:23,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:49:23,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368305888] [2023-11-19 07:49:23,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:49:23,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:49:23,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:49:23,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:49:23,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:49:23,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 253 [2023-11-19 07:49:23,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 583 flow. Second operand has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:23,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:49:23,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 253 [2023-11-19 07:49:23,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:49:24,528 INFO L124 PetriNetUnfolderBase]: 3656/5872 cut-off events. [2023-11-19 07:49:24,528 INFO L125 PetriNetUnfolderBase]: For 16985/18394 co-relation queries the response was YES. [2023-11-19 07:49:24,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26115 conditions, 5872 events. 3656/5872 cut-off events. For 16985/18394 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 37828 event pairs, 314 based on Foata normal form. 655/6273 useless extension candidates. Maximal degree in co-relation 26082. Up to 2604 conditions per place. [2023-11-19 07:49:24,551 INFO L140 encePairwiseOnDemand]: 246/253 looper letters, 113 selfloop transitions, 24 changer transitions 30/181 dead transitions. [2023-11-19 07:49:24,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 181 transitions, 1881 flow [2023-11-19 07:49:24,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:49:24,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-19 07:49:24,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1129 transitions. [2023-11-19 07:49:24,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4958278436539306 [2023-11-19 07:49:24,557 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1129 transitions. [2023-11-19 07:49:24,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1129 transitions. [2023-11-19 07:49:24,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:49:24,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1129 transitions. [2023-11-19 07:49:24,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 125.44444444444444) internal successors, (1129), 9 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:24,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 253.0) internal successors, (2530), 10 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:24,567 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 253.0) internal successors, (2530), 10 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:24,567 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 583 flow. Second operand 9 states and 1129 transitions. [2023-11-19 07:49:24,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 181 transitions, 1881 flow [2023-11-19 07:49:24,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 181 transitions, 1821 flow, removed 18 selfloop flow, removed 3 redundant places. [2023-11-19 07:49:24,883 INFO L231 Difference]: Finished difference. Result has 79 places, 70 transitions, 680 flow [2023-11-19 07:49:24,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=680, PETRI_PLACES=79, PETRI_TRANSITIONS=70} [2023-11-19 07:49:24,884 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 38 predicate places. [2023-11-19 07:49:24,884 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 70 transitions, 680 flow [2023-11-19 07:49:24,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:24,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:49:24,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:49:24,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:49:24,885 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:49:24,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:49:24,886 INFO L85 PathProgramCache]: Analyzing trace with hash -2125257921, now seen corresponding path program 1 times [2023-11-19 07:49:24,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:49:24,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443597442] [2023-11-19 07:49:24,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:49:24,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:49:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:25,117 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-19 07:49:25,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:49:25,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443597442] [2023-11-19 07:49:25,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443597442] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:49:25,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:49:25,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:49:25,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760394035] [2023-11-19 07:49:25,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:49:25,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:49:25,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:49:25,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:49:25,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:49:25,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 253 [2023-11-19 07:49:25,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 70 transitions, 680 flow. Second operand has 7 states, 7 states have (on average 115.85714285714286) internal successors, (811), 7 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:25,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:49:25,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 253 [2023-11-19 07:49:25,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:49:26,141 INFO L124 PetriNetUnfolderBase]: 3535/5664 cut-off events. [2023-11-19 07:49:26,141 INFO L125 PetriNetUnfolderBase]: For 19644/20445 co-relation queries the response was YES. [2023-11-19 07:49:26,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25581 conditions, 5664 events. 3535/5664 cut-off events. For 19644/20445 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 36455 event pairs, 300 based on Foata normal form. 372/5784 useless extension candidates. Maximal degree in co-relation 25546. Up to 1602 conditions per place. [2023-11-19 07:49:26,183 INFO L140 encePairwiseOnDemand]: 246/253 looper letters, 81 selfloop transitions, 27 changer transitions 67/181 dead transitions. [2023-11-19 07:49:26,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 181 transitions, 1904 flow [2023-11-19 07:49:26,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-19 07:49:26,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-19 07:49:26,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1356 transitions. [2023-11-19 07:49:26,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4872439813151276 [2023-11-19 07:49:26,190 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1356 transitions. [2023-11-19 07:49:26,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1356 transitions. [2023-11-19 07:49:26,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:49:26,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1356 transitions. [2023-11-19 07:49:26,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 123.27272727272727) internal successors, (1356), 11 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:26,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 253.0) internal successors, (3036), 12 states have internal predecessors, (3036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:26,202 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 253.0) internal successors, (3036), 12 states have internal predecessors, (3036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:26,202 INFO L175 Difference]: Start difference. First operand has 79 places, 70 transitions, 680 flow. Second operand 11 states and 1356 transitions. [2023-11-19 07:49:26,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 181 transitions, 1904 flow [2023-11-19 07:49:26,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 181 transitions, 1786 flow, removed 36 selfloop flow, removed 5 redundant places. [2023-11-19 07:49:26,814 INFO L231 Difference]: Finished difference. Result has 87 places, 54 transitions, 450 flow [2023-11-19 07:49:26,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=450, PETRI_PLACES=87, PETRI_TRANSITIONS=54} [2023-11-19 07:49:26,815 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 46 predicate places. [2023-11-19 07:49:26,815 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 54 transitions, 450 flow [2023-11-19 07:49:26,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.85714285714286) internal successors, (811), 7 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:26,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:49:26,816 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:49:26,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:49:26,817 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:49:26,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:49:26,817 INFO L85 PathProgramCache]: Analyzing trace with hash 66593429, now seen corresponding path program 1 times [2023-11-19 07:49:26,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:49:26,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581015894] [2023-11-19 07:49:26,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:49:26,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:49:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:27,071 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-19 07:49:27,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:49:27,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581015894] [2023-11-19 07:49:27,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581015894] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:49:27,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:49:27,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:49:27,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113497475] [2023-11-19 07:49:27,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:49:27,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:49:27,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:49:27,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:49:27,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:49:27,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 253 [2023-11-19 07:49:27,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 54 transitions, 450 flow. Second operand has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:27,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:49:27,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 253 [2023-11-19 07:49:27,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:49:27,537 INFO L124 PetriNetUnfolderBase]: 1317/2314 cut-off events. [2023-11-19 07:49:27,537 INFO L125 PetriNetUnfolderBase]: For 7188/7250 co-relation queries the response was YES. [2023-11-19 07:49:27,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9977 conditions, 2314 events. 1317/2314 cut-off events. For 7188/7250 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 13259 event pairs, 296 based on Foata normal form. 17/2302 useless extension candidates. Maximal degree in co-relation 9947. Up to 1222 conditions per place. [2023-11-19 07:49:27,552 INFO L140 encePairwiseOnDemand]: 250/253 looper letters, 36 selfloop transitions, 1 changer transitions 67/107 dead transitions. [2023-11-19 07:49:27,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 107 transitions, 1076 flow [2023-11-19 07:49:27,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:49:27,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:49:27,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 525 transitions. [2023-11-19 07:49:27,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5187747035573123 [2023-11-19 07:49:27,556 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 525 transitions. [2023-11-19 07:49:27,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 525 transitions. [2023-11-19 07:49:27,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:49:27,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 525 transitions. [2023-11-19 07:49:27,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:27,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:27,561 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:27,561 INFO L175 Difference]: Start difference. First operand has 87 places, 54 transitions, 450 flow. Second operand 4 states and 525 transitions. [2023-11-19 07:49:27,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 107 transitions, 1076 flow [2023-11-19 07:49:27,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 107 transitions, 821 flow, removed 60 selfloop flow, removed 16 redundant places. [2023-11-19 07:49:27,627 INFO L231 Difference]: Finished difference. Result has 73 places, 38 transitions, 207 flow [2023-11-19 07:49:27,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=207, PETRI_PLACES=73, PETRI_TRANSITIONS=38} [2023-11-19 07:49:27,628 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 32 predicate places. [2023-11-19 07:49:27,629 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 38 transitions, 207 flow [2023-11-19 07:49:27,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:27,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:49:27,629 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:49:27,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:49:27,629 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:49:27,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:49:27,630 INFO L85 PathProgramCache]: Analyzing trace with hash -855981869, now seen corresponding path program 2 times [2023-11-19 07:49:27,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:49:27,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172229161] [2023-11-19 07:49:27,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:49:27,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:49:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:28,791 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-19 07:49:28,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:49:28,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172229161] [2023-11-19 07:49:28,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172229161] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:49:28,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:49:28,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:49:28,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592556114] [2023-11-19 07:49:28,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:49:28,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:49:28,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:49:28,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:49:28,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:49:28,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 253 [2023-11-19 07:49:28,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 38 transitions, 207 flow. Second operand has 7 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:28,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:49:28,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 253 [2023-11-19 07:49:28,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:49:29,047 INFO L124 PetriNetUnfolderBase]: 200/403 cut-off events. [2023-11-19 07:49:29,047 INFO L125 PetriNetUnfolderBase]: For 688/717 co-relation queries the response was YES. [2023-11-19 07:49:29,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1462 conditions, 403 events. 200/403 cut-off events. For 688/717 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1587 event pairs, 33 based on Foata normal form. 2/399 useless extension candidates. Maximal degree in co-relation 1440. Up to 132 conditions per place. [2023-11-19 07:49:29,049 INFO L140 encePairwiseOnDemand]: 246/253 looper letters, 34 selfloop transitions, 4 changer transitions 38/80 dead transitions. [2023-11-19 07:49:29,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 80 transitions, 600 flow [2023-11-19 07:49:29,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:49:29,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-19 07:49:29,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 989 transitions. [2023-11-19 07:49:29,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48863636363636365 [2023-11-19 07:49:29,054 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 989 transitions. [2023-11-19 07:49:29,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 989 transitions. [2023-11-19 07:49:29,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:49:29,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 989 transitions. [2023-11-19 07:49:29,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 123.625) internal successors, (989), 8 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:29,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 253.0) internal successors, (2277), 9 states have internal predecessors, (2277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:29,064 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 253.0) internal successors, (2277), 9 states have internal predecessors, (2277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:29,064 INFO L175 Difference]: Start difference. First operand has 73 places, 38 transitions, 207 flow. Second operand 8 states and 989 transitions. [2023-11-19 07:49:29,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 80 transitions, 600 flow [2023-11-19 07:49:29,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 80 transitions, 545 flow, removed 12 selfloop flow, removed 14 redundant places. [2023-11-19 07:49:29,070 INFO L231 Difference]: Finished difference. Result has 59 places, 38 transitions, 190 flow [2023-11-19 07:49:29,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=190, PETRI_PLACES=59, PETRI_TRANSITIONS=38} [2023-11-19 07:49:29,071 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2023-11-19 07:49:29,071 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 38 transitions, 190 flow [2023-11-19 07:49:29,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:49:29,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:49:29,072 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:49:29,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 07:49:29,072 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:49:29,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:49:29,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1297907241, now seen corresponding path program 3 times [2023-11-19 07:49:29,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:49:29,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024482832] [2023-11-19 07:49:29,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:49:29,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:49:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:49:29,117 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:49:29,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:49:29,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:49:29,189 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:49:29,190 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-19 07:49:29,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-19 07:49:29,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-19 07:49:29,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-19 07:49:29,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-19 07:49:29,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-19 07:49:29,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-19 07:49:29,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 07:49:29,194 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:49:29,200 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 07:49:29,200 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:49:29,253 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 07:49:29,256 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 07:49:29,257 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-19 07:49:29,258 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre13 could not be translated [2023-11-19 07:49:29,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:49:29 BasicIcfg [2023-11-19 07:49:29,293 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:49:29,293 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:49:29,294 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:49:29,294 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:49:29,295 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:48:59" (3/4) ... [2023-11-19 07:49:29,296 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-19 07:49:29,334 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 07:49:29,339 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 07:49:29,340 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-19 07:49:29,341 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre13 could not be translated [2023-11-19 07:49:29,428 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed50be7-bf22-4c7a-829b-762dae944ed5/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 07:49:29,428 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:49:29,429 INFO L158 Benchmark]: Toolchain (without parser) took 32131.27ms. Allocated memory was 163.6MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 125.2MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 353.4MB. Max. memory is 16.1GB. [2023-11-19 07:49:29,429 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 119.5MB. Free memory is still 87.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:49:29,429 INFO L158 Benchmark]: CACSL2BoogieTranslator took 785.32ms. Allocated memory is still 163.6MB. Free memory was 125.2MB in the beginning and 115.4MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-19 07:49:29,430 INFO L158 Benchmark]: Boogie Procedure Inliner took 132.47ms. Allocated memory is still 163.6MB. Free memory was 115.4MB in the beginning and 112.1MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:49:29,430 INFO L158 Benchmark]: Boogie Preprocessor took 95.76ms. Allocated memory is still 163.6MB. Free memory was 112.1MB in the beginning and 110.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:49:29,430 INFO L158 Benchmark]: RCFGBuilder took 1163.19ms. Allocated memory is still 163.6MB. Free memory was 110.1MB in the beginning and 70.2MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2023-11-19 07:49:29,433 INFO L158 Benchmark]: TraceAbstraction took 29809.50ms. Allocated memory was 163.6MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 69.4MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 283.4MB. Max. memory is 16.1GB. [2023-11-19 07:49:29,434 INFO L158 Benchmark]: Witness Printer took 134.52ms. Allocated memory is still 1.9GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-19 07:49:29,436 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.32ms. Allocated memory is still 119.5MB. Free memory is still 87.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 785.32ms. Allocated memory is still 163.6MB. Free memory was 125.2MB in the beginning and 115.4MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 132.47ms. Allocated memory is still 163.6MB. Free memory was 115.4MB in the beginning and 112.1MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.76ms. Allocated memory is still 163.6MB. Free memory was 112.1MB in the beginning and 110.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1163.19ms. Allocated memory is still 163.6MB. Free memory was 110.1MB in the beginning and 70.2MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 29809.50ms. Allocated memory was 163.6MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 69.4MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 283.4MB. Max. memory is 16.1GB. * Witness Printer took 134.52ms. Allocated memory is still 1.9GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre13 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre13 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.8s, 143 PlacesBefore, 41 PlacesAfterwards, 132 TransitionsBefore, 29 TransitionsAfterwards, 3490 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 117 TotalNumberOfCompositions, 7758 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3761, independent: 3549, independent conditional: 0, independent unconditional: 3549, dependent: 212, dependent conditional: 0, dependent unconditional: 212, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1891, independent: 1841, independent conditional: 0, independent unconditional: 1841, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3761, independent: 1708, independent conditional: 0, independent unconditional: 1708, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 1891, unknown conditional: 0, unknown unconditional: 1891] , Statistics on independence cache: Total cache size (in pairs): 131, Positive cache size: 111, Positive conditional cache size: 0, Positive unconditional cache size: 111, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L869] 0 pthread_t t125; [L870] FCALL, FORK 0 pthread_create(&t125, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t125={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L871] 0 pthread_t t126; [L872] FCALL, FORK 0 pthread_create(&t126, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t125={5:0}, t126={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L873] 0 pthread_t t127; [L874] FCALL, FORK 0 pthread_create(&t127, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t125={5:0}, t126={6:0}, t127={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L875] 0 pthread_t t128; [L876] FCALL, FORK 0 pthread_create(&t128, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t125={5:0}, t126={6:0}, t127={7:0}, t128={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L815] 4 z$w_buff1 = z$w_buff0 [L816] 4 z$w_buff0 = 1 [L817] 4 z$w_buff1_used = z$w_buff0_used [L818] 4 z$w_buff0_used = (_Bool)1 [L819] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L819] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L820] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L821] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L822] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L823] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L824] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 z$flush_delayed = weak$$choice2 [L831] 4 z$mem_tmp = z [L832] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L833] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L834] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L835] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L836] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L838] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EAX = z [L840] 4 z = z$flush_delayed ? z$mem_tmp : z [L841] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L844] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L769] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L784] 3 y = 1 [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L787] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 z$flush_delayed = weak$$choice2 [L793] 3 z$mem_tmp = z [L794] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L795] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L796] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L797] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L798] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L800] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EBX = z [L802] 3 z = z$flush_delayed ? z$mem_tmp : z [L803] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L847] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L848] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L849] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L850] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L851] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L883] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L884] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L885] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L886] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t125={5:0}, t126={6:0}, t127={7:0}, t128={3:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - 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: 874]: 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: 876]: 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: 872]: 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: 870]: 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 9 procedures, 174 locations, 7 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: 29.6s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 18.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 629 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 499 mSDsluCounter, 170 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 107 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1339 IncrementalHoareTripleChecker+Invalid, 1412 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 63 mSDtfsCounter, 1339 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=680occurred in iteration=10, InterpolantAutomatonStates: 69, 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.4s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 213 ConstructedInterpolants, 0 QuantifiedInterpolants, 1110 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-19 07:49:29,494 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed50be7-bf22-4c7a-829b-762dae944ed5/bin/uautomizer-verify-uCwYo4JHxu/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