./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ad1df1c-1f26-49e1-ae3e-a3f447c6c42c/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ad1df1c-1f26-49e1-ae3e-a3f447c6c42c/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_6ad1df1c-1f26-49e1-ae3e-a3f447c6c42c/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ad1df1c-1f26-49e1-ae3e-a3f447c6c42c/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ad1df1c-1f26-49e1-ae3e-a3f447c6c42c/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_6ad1df1c-1f26-49e1-ae3e-a3f447c6c42c/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 bdec055c4bfc04b6b0c3fc918f7b96def91dcb331178222835136af29a7feef5 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:46:04,298 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:46:04,400 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ad1df1c-1f26-49e1-ae3e-a3f447c6c42c/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:46:04,410 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:46:04,411 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:46:04,451 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:46:04,452 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:46:04,453 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:46:04,454 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:46:04,459 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:46:04,461 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:46:04,461 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:46:04,462 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:46:04,464 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:46:04,464 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:46:04,465 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:46:04,465 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:46:04,466 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:46:04,466 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:46:04,466 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:46:04,467 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:46:04,467 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:46:04,468 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:46:04,468 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:46:04,468 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:46:04,469 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:46:04,469 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:46:04,470 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:46:04,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:46:04,470 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:46:04,471 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:46:04,471 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:46:04,471 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:46:04,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:46:04,472 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:46:04,472 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:46:04,472 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:46:04,472 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:46:04,472 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:46:04,472 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_6ad1df1c-1f26-49e1-ae3e-a3f447c6c42c/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_6ad1df1c-1f26-49e1-ae3e-a3f447c6c42c/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 -> bdec055c4bfc04b6b0c3fc918f7b96def91dcb331178222835136af29a7feef5 [2023-11-19 07:46:04,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:46:04,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:46:04,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:46:04,828 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:46:04,829 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:46:04,830 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ad1df1c-1f26-49e1-ae3e-a3f447c6c42c/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i [2023-11-19 07:46:07,925 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:46:08,229 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:46:08,230 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ad1df1c-1f26-49e1-ae3e-a3f447c6c42c/sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i [2023-11-19 07:46:08,271 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ad1df1c-1f26-49e1-ae3e-a3f447c6c42c/bin/uautomizer-verify-uCwYo4JHxu/data/10be9c492/477f964030a746af88d3b9c6041f8175/FLAGeb0bd2cda [2023-11-19 07:46:08,293 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ad1df1c-1f26-49e1-ae3e-a3f447c6c42c/bin/uautomizer-verify-uCwYo4JHxu/data/10be9c492/477f964030a746af88d3b9c6041f8175 [2023-11-19 07:46:08,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:46:08,301 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:46:08,305 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:46:08,305 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:46:08,311 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:46:08,311 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:46:08" (1/1) ... [2023-11-19 07:46:08,313 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@292cb430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:46:08, skipping insertion in model container [2023-11-19 07:46:08,313 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:46:08" (1/1) ... [2023-11-19 07:46:08,394 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:46:08,626 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_6ad1df1c-1f26-49e1-ae3e-a3f447c6c42c/sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i[959,972] [2023-11-19 07:46:08,956 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:46:08,968 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:46:08,981 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_6ad1df1c-1f26-49e1-ae3e-a3f447c6c42c/sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i[959,972] [2023-11-19 07:46:09,035 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:46:09,070 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:46:09,070 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:46:09,079 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:46:09,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:46:09 WrapperNode [2023-11-19 07:46:09,080 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:46:09,081 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:46:09,081 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:46:09,081 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:46:09,090 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:46:09" (1/1) ... [2023-11-19 07:46:09,107 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:46:09" (1/1) ... [2023-11-19 07:46:09,140 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2023-11-19 07:46:09,140 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:46:09,141 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:46:09,141 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:46:09,141 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:46:09,152 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:46:09" (1/1) ... [2023-11-19 07:46:09,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:46:09" (1/1) ... [2023-11-19 07:46:09,157 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:46:09" (1/1) ... [2023-11-19 07:46:09,157 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:46:09" (1/1) ... [2023-11-19 07:46:09,168 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:46:09" (1/1) ... [2023-11-19 07:46:09,170 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:46:09" (1/1) ... [2023-11-19 07:46:09,172 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:46:09" (1/1) ... [2023-11-19 07:46:09,175 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:46:09" (1/1) ... [2023-11-19 07:46:09,183 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:46:09,184 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:46:09,184 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:46:09,184 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:46:09,185 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:46:09" (1/1) ... [2023-11-19 07:46:09,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:46:09,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ad1df1c-1f26-49e1-ae3e-a3f447c6c42c/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:46:09,237 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ad1df1c-1f26-49e1-ae3e-a3f447c6c42c/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:46:09,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ad1df1c-1f26-49e1-ae3e-a3f447c6c42c/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:46:09,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:46:09,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:46:09,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:46:09,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:46:09,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:46:09,327 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:46:09,327 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:46:09,327 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:46:09,327 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:46:09,327 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 07:46:09,328 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 07:46:09,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:46:09,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:46:09,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:46:09,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:46:09,330 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:46:09,509 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:46:09,513 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:46:09,888 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:46:10,046 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:46:10,046 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:46:10,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:46:10 BoogieIcfgContainer [2023-11-19 07:46:10,050 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:46:10,053 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:46:10,053 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:46:10,056 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:46:10,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:46:08" (1/3) ... [2023-11-19 07:46:10,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13e31190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:46:10, skipping insertion in model container [2023-11-19 07:46:10,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:46:09" (2/3) ... [2023-11-19 07:46:10,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13e31190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:46:10, skipping insertion in model container [2023-11-19 07:46:10,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:46:10" (3/3) ... [2023-11-19 07:46:10,060 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_power.opt_pso.opt.i [2023-11-19 07:46:10,069 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 07:46:10,080 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:46:10,081 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-19 07:46:10,081 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:46:10,138 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:46:10,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 111 transitions, 234 flow [2023-11-19 07:46:10,239 INFO L124 PetriNetUnfolderBase]: 3/108 cut-off events. [2023-11-19 07:46:10,239 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:46:10,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 3/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2023-11-19 07:46:10,246 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 111 transitions, 234 flow [2023-11-19 07:46:10,251 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 108 transitions, 225 flow [2023-11-19 07:46:10,255 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:46:10,266 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 108 transitions, 225 flow [2023-11-19 07:46:10,269 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 108 transitions, 225 flow [2023-11-19 07:46:10,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 108 transitions, 225 flow [2023-11-19 07:46:10,332 INFO L124 PetriNetUnfolderBase]: 3/108 cut-off events. [2023-11-19 07:46:10,340 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:46:10,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 3/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2023-11-19 07:46:10,344 INFO L119 LiptonReduction]: Number of co-enabled transitions 2190 [2023-11-19 07:46:15,576 INFO L134 LiptonReduction]: Checked pairs total: 4924 [2023-11-19 07:46:15,576 INFO L136 LiptonReduction]: Total number of compositions: 99 [2023-11-19 07:46:15,594 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:46:15,601 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;@161c1776, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:46:15,602 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-19 07:46:15,606 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:46:15,607 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-11-19 07:46:15,607 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:46:15,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:46:15,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 07:46:15,609 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:46:15,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:15,615 INFO L85 PathProgramCache]: Analyzing trace with hash 466546275, now seen corresponding path program 1 times [2023-11-19 07:46:15,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:15,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630796795] [2023-11-19 07:46:15,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:15,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:16,207 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:46:16,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:16,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630796795] [2023-11-19 07:46:16,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630796795] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:16,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:16,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:46:16,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916068915] [2023-11-19 07:46:16,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:16,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:46:16,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:16,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:46:16,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:46:16,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 210 [2023-11-19 07:46:16,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states 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:46:16,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:46:16,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 210 [2023-11-19 07:46:16,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:46:16,669 INFO L124 PetriNetUnfolderBase]: 711/1170 cut-off events. [2023-11-19 07:46:16,669 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-19 07:46:16,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2289 conditions, 1170 events. 711/1170 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5967 event pairs, 117 based on Foata normal form. 0/1101 useless extension candidates. Maximal degree in co-relation 2278. Up to 859 conditions per place. [2023-11-19 07:46:16,686 INFO L140 encePairwiseOnDemand]: 207/210 looper letters, 27 selfloop transitions, 2 changer transitions 2/34 dead transitions. [2023-11-19 07:46:16,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 34 transitions, 142 flow [2023-11-19 07:46:16,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:46:16,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:46:16,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 320 transitions. [2023-11-19 07:46:16,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2023-11-19 07:46:16,707 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 320 transitions. [2023-11-19 07:46:16,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 320 transitions. [2023-11-19 07:46:16,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:46:16,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 320 transitions. [2023-11-19 07:46:16,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states 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:46:16,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states 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:46:16,726 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states 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:46:16,728 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 55 flow. Second operand 3 states and 320 transitions. [2023-11-19 07:46:16,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 34 transitions, 142 flow [2023-11-19 07:46:16,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 34 transitions, 138 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-19 07:46:16,735 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2023-11-19 07:46:16,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-11-19 07:46:16,743 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2023-11-19 07:46:16,743 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2023-11-19 07:46:16,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states 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:46:16,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:46:16,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:16,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:46:16,745 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:46:16,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:16,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1491758342, now seen corresponding path program 1 times [2023-11-19 07:46:16,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:16,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345567846] [2023-11-19 07:46:16,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:16,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:17,592 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:46:17,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:17,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345567846] [2023-11-19 07:46:17,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345567846] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:17,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:17,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:46:17,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065956415] [2023-11-19 07:46:17,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:17,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:46:17,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:17,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:46:17,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:46:17,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-11-19 07:46:17,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 90.25) internal successors, (361), 4 states have internal predecessors, (361), 0 states have call successors, (0), 0 states 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:46:17,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:46:17,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-11-19 07:46:17,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:46:18,010 INFO L124 PetriNetUnfolderBase]: 793/1214 cut-off events. [2023-11-19 07:46:18,010 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-11-19 07:46:18,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2558 conditions, 1214 events. 793/1214 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5308 event pairs, 143 based on Foata normal form. 32/1242 useless extension candidates. Maximal degree in co-relation 2548. Up to 889 conditions per place. [2023-11-19 07:46:18,024 INFO L140 encePairwiseOnDemand]: 200/210 looper letters, 27 selfloop transitions, 9 changer transitions 0/38 dead transitions. [2023-11-19 07:46:18,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 38 transitions, 162 flow [2023-11-19 07:46:18,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:46:18,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:46:18,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 390 transitions. [2023-11-19 07:46:18,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2023-11-19 07:46:18,033 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 390 transitions. [2023-11-19 07:46:18,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 390 transitions. [2023-11-19 07:46:18,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:46:18,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 390 transitions. [2023-11-19 07:46:18,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:18,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:18,048 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:18,048 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 4 states and 390 transitions. [2023-11-19 07:46:18,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 38 transitions, 162 flow [2023-11-19 07:46:18,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 38 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:46:18,054 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 103 flow [2023-11-19 07:46:18,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=103, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2023-11-19 07:46:18,056 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 0 predicate places. [2023-11-19 07:46:18,063 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 103 flow [2023-11-19 07:46:18,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.25) internal successors, (361), 4 states have internal predecessors, (361), 0 states have call successors, (0), 0 states 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:46:18,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:46:18,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:18,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:46:18,065 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:46:18,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:18,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1000130183, now seen corresponding path program 1 times [2023-11-19 07:46:18,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:18,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564842753] [2023-11-19 07:46:18,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:18,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:18,653 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:46:18,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:18,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564842753] [2023-11-19 07:46:18,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564842753] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:18,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:18,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:46:18,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390387072] [2023-11-19 07:46:18,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:18,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:46:18,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:18,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:46:18,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:46:18,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-11-19 07:46:18,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 103 flow. Second operand has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states 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:46:18,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:46:18,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-11-19 07:46:18,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:46:19,017 INFO L124 PetriNetUnfolderBase]: 775/1200 cut-off events. [2023-11-19 07:46:19,018 INFO L125 PetriNetUnfolderBase]: For 450/455 co-relation queries the response was YES. [2023-11-19 07:46:19,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3437 conditions, 1200 events. 775/1200 cut-off events. For 450/455 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5277 event pairs, 263 based on Foata normal form. 4/1203 useless extension candidates. Maximal degree in co-relation 3425. Up to 1004 conditions per place. [2023-11-19 07:46:19,033 INFO L140 encePairwiseOnDemand]: 201/210 looper letters, 30 selfloop transitions, 10 changer transitions 0/42 dead transitions. [2023-11-19 07:46:19,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 231 flow [2023-11-19 07:46:19,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:46:19,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:46:19,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 393 transitions. [2023-11-19 07:46:19,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46785714285714286 [2023-11-19 07:46:19,036 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 393 transitions. [2023-11-19 07:46:19,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 393 transitions. [2023-11-19 07:46:19,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:46:19,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 393 transitions. [2023-11-19 07:46:19,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 states 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:46:19,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:19,042 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:19,043 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 103 flow. Second operand 4 states and 393 transitions. [2023-11-19 07:46:19,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 231 flow [2023-11-19 07:46:19,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 42 transitions, 217 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:46:19,047 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 127 flow [2023-11-19 07:46:19,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=127, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2023-11-19 07:46:19,049 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places. [2023-11-19 07:46:19,053 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 127 flow [2023-11-19 07:46:19,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states 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:46:19,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:46:19,054 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:19,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:46:19,055 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:46:19,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:19,056 INFO L85 PathProgramCache]: Analyzing trace with hash 937562129, now seen corresponding path program 1 times [2023-11-19 07:46:19,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:19,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102323581] [2023-11-19 07:46:19,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:19,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:19,573 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:46:19,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:19,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102323581] [2023-11-19 07:46:19,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102323581] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:19,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:19,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:46:19,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398013060] [2023-11-19 07:46:19,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:19,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:46:19,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:19,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:46:19,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:46:19,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 210 [2023-11-19 07:46:19,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 127 flow. Second operand has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 0 states have call successors, (0), 0 states 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:46:19,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:46:19,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 210 [2023-11-19 07:46:19,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:46:20,169 INFO L124 PetriNetUnfolderBase]: 1242/1887 cut-off events. [2023-11-19 07:46:20,169 INFO L125 PetriNetUnfolderBase]: For 1212/1212 co-relation queries the response was YES. [2023-11-19 07:46:20,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5595 conditions, 1887 events. 1242/1887 cut-off events. For 1212/1212 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 8895 event pairs, 241 based on Foata normal form. 75/1961 useless extension candidates. Maximal degree in co-relation 5582. Up to 981 conditions per place. [2023-11-19 07:46:20,184 INFO L140 encePairwiseOnDemand]: 200/210 looper letters, 34 selfloop transitions, 10 changer transitions 21/66 dead transitions. [2023-11-19 07:46:20,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 66 transitions, 420 flow [2023-11-19 07:46:20,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:46:20,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:46:20,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 481 transitions. [2023-11-19 07:46:20,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4580952380952381 [2023-11-19 07:46:20,188 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 481 transitions. [2023-11-19 07:46:20,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 481 transitions. [2023-11-19 07:46:20,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:46:20,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 481 transitions. [2023-11-19 07:46:20,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.2) internal successors, (481), 5 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:20,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states 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:46:20,195 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states 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:46:20,195 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 127 flow. Second operand 5 states and 481 transitions. [2023-11-19 07:46:20,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 66 transitions, 420 flow [2023-11-19 07:46:20,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 66 transitions, 399 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:46:20,205 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 142 flow [2023-11-19 07:46:20,205 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-11-19 07:46:20,207 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places. [2023-11-19 07:46:20,207 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 142 flow [2023-11-19 07:46:20,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 0 states have call successors, (0), 0 states 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:46:20,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:46:20,208 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:20,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:46:20,209 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:46:20,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:20,209 INFO L85 PathProgramCache]: Analyzing trace with hash 150921026, now seen corresponding path program 1 times [2023-11-19 07:46:20,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:20,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580682553] [2023-11-19 07:46:20,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:20,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:20,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:21,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:46:21,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:21,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580682553] [2023-11-19 07:46:21,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580682553] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:21,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:21,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:46:21,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378686576] [2023-11-19 07:46:21,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:21,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:46:21,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:21,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:46:21,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:46:21,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 210 [2023-11-19 07:46:21,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 96.4) internal successors, (482), 5 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:21,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:46:21,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 210 [2023-11-19 07:46:21,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:46:21,449 INFO L124 PetriNetUnfolderBase]: 692/1074 cut-off events. [2023-11-19 07:46:21,450 INFO L125 PetriNetUnfolderBase]: For 1213/1219 co-relation queries the response was YES. [2023-11-19 07:46:21,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3479 conditions, 1074 events. 692/1074 cut-off events. For 1213/1219 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4453 event pairs, 236 based on Foata normal form. 7/1046 useless extension candidates. Maximal degree in co-relation 3462. Up to 971 conditions per place. [2023-11-19 07:46:21,464 INFO L140 encePairwiseOnDemand]: 205/210 looper letters, 36 selfloop transitions, 6 changer transitions 0/45 dead transitions. [2023-11-19 07:46:21,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 305 flow [2023-11-19 07:46:21,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:46:21,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:46:21,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2023-11-19 07:46:21,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4984126984126984 [2023-11-19 07:46:21,467 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2023-11-19 07:46:21,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2023-11-19 07:46:21,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:46:21,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2023-11-19 07:46:21,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states 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:46:21,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states 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:46:21,473 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states 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:46:21,473 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 142 flow. Second operand 3 states and 314 transitions. [2023-11-19 07:46:21,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 305 flow [2023-11-19 07:46:21,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 45 transitions, 269 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-11-19 07:46:21,478 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 166 flow [2023-11-19 07:46:21,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2023-11-19 07:46:21,481 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 5 predicate places. [2023-11-19 07:46:21,482 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 166 flow [2023-11-19 07:46:21,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.4) internal successors, (482), 5 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:21,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:46:21,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:21,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:46:21,483 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:46:21,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:21,484 INFO L85 PathProgramCache]: Analyzing trace with hash 2121670161, now seen corresponding path program 1 times [2023-11-19 07:46:21,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:21,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445989324] [2023-11-19 07:46:21,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:21,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:22,135 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:46:22,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:22,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445989324] [2023-11-19 07:46:22,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445989324] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:22,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:22,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:46:22,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152076564] [2023-11-19 07:46:22,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:22,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:46:22,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:22,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:46:22,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:46:22,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 210 [2023-11-19 07:46:22,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 166 flow. Second operand has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states 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:46:22,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:46:22,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 210 [2023-11-19 07:46:22,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:46:22,559 INFO L124 PetriNetUnfolderBase]: 828/1323 cut-off events. [2023-11-19 07:46:22,559 INFO L125 PetriNetUnfolderBase]: For 1257/1281 co-relation queries the response was YES. [2023-11-19 07:46:22,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4255 conditions, 1323 events. 828/1323 cut-off events. For 1257/1281 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5794 event pairs, 109 based on Foata normal form. 24/1347 useless extension candidates. Maximal degree in co-relation 4239. Up to 991 conditions per place. [2023-11-19 07:46:22,574 INFO L140 encePairwiseOnDemand]: 203/210 looper letters, 48 selfloop transitions, 12 changer transitions 0/63 dead transitions. [2023-11-19 07:46:22,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 63 transitions, 400 flow [2023-11-19 07:46:22,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:46:22,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:46:22,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 598 transitions. [2023-11-19 07:46:22,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4746031746031746 [2023-11-19 07:46:22,578 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 598 transitions. [2023-11-19 07:46:22,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 598 transitions. [2023-11-19 07:46:22,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:46:22,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 598 transitions. [2023-11-19 07:46:22,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 99.66666666666667) internal successors, (598), 6 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:46:22,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states 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:46:22,585 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states 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:46:22,585 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 166 flow. Second operand 6 states and 598 transitions. [2023-11-19 07:46:22,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 63 transitions, 400 flow [2023-11-19 07:46:22,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 63 transitions, 393 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:46:22,590 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 250 flow [2023-11-19 07:46:22,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=160, 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=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=250, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2023-11-19 07:46:22,591 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 10 predicate places. [2023-11-19 07:46:22,592 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 250 flow [2023-11-19 07:46:22,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states 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:46:22,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:46:22,593 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:22,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:46:22,593 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:46:22,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:22,594 INFO L85 PathProgramCache]: Analyzing trace with hash -80050181, now seen corresponding path program 1 times [2023-11-19 07:46:22,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:22,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978376705] [2023-11-19 07:46:22,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:22,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:22,823 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:46:22,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:22,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978376705] [2023-11-19 07:46:22,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978376705] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:22,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:22,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:46:22,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002389552] [2023-11-19 07:46:22,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:22,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:46:22,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:22,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:46:22,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:46:22,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 210 [2023-11-19 07:46:22,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 250 flow. Second operand has 4 states, 4 states have (on average 94.25) internal successors, (377), 4 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:46:22,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:46:22,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 210 [2023-11-19 07:46:22,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:46:23,204 INFO L124 PetriNetUnfolderBase]: 600/985 cut-off events. [2023-11-19 07:46:23,204 INFO L125 PetriNetUnfolderBase]: For 2165/2285 co-relation queries the response was YES. [2023-11-19 07:46:23,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3743 conditions, 985 events. 600/985 cut-off events. For 2165/2285 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4516 event pairs, 83 based on Foata normal form. 174/1152 useless extension candidates. Maximal degree in co-relation 3725. Up to 553 conditions per place. [2023-11-19 07:46:23,215 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 58 selfloop transitions, 5 changer transitions 42/111 dead transitions. [2023-11-19 07:46:23,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 111 transitions, 911 flow [2023-11-19 07:46:23,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:46:23,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:46:23,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 507 transitions. [2023-11-19 07:46:23,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4828571428571429 [2023-11-19 07:46:23,219 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 507 transitions. [2023-11-19 07:46:23,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 507 transitions. [2023-11-19 07:46:23,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:46:23,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 507 transitions. [2023-11-19 07:46:23,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 states 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:46:23,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states 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:46:23,225 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states 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:46:23,225 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 250 flow. Second operand 5 states and 507 transitions. [2023-11-19 07:46:23,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 111 transitions, 911 flow [2023-11-19 07:46:23,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 111 transitions, 878 flow, removed 16 selfloop flow, removed 1 redundant places. [2023-11-19 07:46:23,232 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 287 flow [2023-11-19 07:46:23,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=287, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2023-11-19 07:46:23,233 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 16 predicate places. [2023-11-19 07:46:23,233 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 287 flow [2023-11-19 07:46:23,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.25) internal successors, (377), 4 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:46:23,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:46:23,234 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:23,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:46:23,235 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:46:23,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:23,235 INFO L85 PathProgramCache]: Analyzing trace with hash -311823389, now seen corresponding path program 1 times [2023-11-19 07:46:23,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:23,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264989208] [2023-11-19 07:46:23,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:23,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:23,446 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:46:23,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:23,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264989208] [2023-11-19 07:46:23,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264989208] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:23,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:23,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:46:23,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123908327] [2023-11-19 07:46:23,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:23,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:46:23,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:23,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:46:23,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:46:23,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 210 [2023-11-19 07:46:23,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 287 flow. Second operand has 5 states, 5 states have (on average 93.8) internal successors, (469), 5 states have internal predecessors, (469), 0 states have call successors, (0), 0 states 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:46:23,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:46:23,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 210 [2023-11-19 07:46:23,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:46:23,788 INFO L124 PetriNetUnfolderBase]: 382/660 cut-off events. [2023-11-19 07:46:23,788 INFO L125 PetriNetUnfolderBase]: For 1556/1628 co-relation queries the response was YES. [2023-11-19 07:46:23,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2790 conditions, 660 events. 382/660 cut-off events. For 1556/1628 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2900 event pairs, 49 based on Foata normal form. 111/764 useless extension candidates. Maximal degree in co-relation 2768. Up to 345 conditions per place. [2023-11-19 07:46:23,794 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 67 selfloop transitions, 8 changer transitions 50/131 dead transitions. [2023-11-19 07:46:23,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 131 transitions, 1104 flow [2023-11-19 07:46:23,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:46:23,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:46:23,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 705 transitions. [2023-11-19 07:46:23,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47959183673469385 [2023-11-19 07:46:23,798 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 705 transitions. [2023-11-19 07:46:23,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 705 transitions. [2023-11-19 07:46:23,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:46:23,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 705 transitions. [2023-11-19 07:46:23,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.71428571428571) internal successors, (705), 7 states have internal predecessors, (705), 0 states have call successors, (0), 0 states 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:46:23,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states 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:46:23,805 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states 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:46:23,805 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 287 flow. Second operand 7 states and 705 transitions. [2023-11-19 07:46:23,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 131 transitions, 1104 flow [2023-11-19 07:46:23,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 131 transitions, 1096 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-19 07:46:23,812 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 341 flow [2023-11-19 07:46:23,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=341, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2023-11-19 07:46:23,813 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 22 predicate places. [2023-11-19 07:46:23,813 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 341 flow [2023-11-19 07:46:23,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.8) internal successors, (469), 5 states have internal predecessors, (469), 0 states have call successors, (0), 0 states 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:46:23,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:46:23,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:23,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:46:23,814 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:46:23,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:23,815 INFO L85 PathProgramCache]: Analyzing trace with hash -2129878244, now seen corresponding path program 1 times [2023-11-19 07:46:23,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:23,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171385299] [2023-11-19 07:46:23,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:23,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:24,034 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:46:24,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:24,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171385299] [2023-11-19 07:46:24,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171385299] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:24,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:24,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:46:24,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216741218] [2023-11-19 07:46:24,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:24,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:46:24,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:24,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:46:24,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:46:24,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 210 [2023-11-19 07:46:24,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 341 flow. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states 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:46:24,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:46:24,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 210 [2023-11-19 07:46:24,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:46:24,238 INFO L124 PetriNetUnfolderBase]: 392/712 cut-off events. [2023-11-19 07:46:24,238 INFO L125 PetriNetUnfolderBase]: For 1964/1994 co-relation queries the response was YES. [2023-11-19 07:46:24,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3242 conditions, 712 events. 392/712 cut-off events. For 1964/1994 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3172 event pairs, 154 based on Foata normal form. 27/731 useless extension candidates. Maximal degree in co-relation 3217. Up to 432 conditions per place. [2023-11-19 07:46:24,245 INFO L140 encePairwiseOnDemand]: 207/210 looper letters, 44 selfloop transitions, 4 changer transitions 14/66 dead transitions. [2023-11-19 07:46:24,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 66 transitions, 610 flow [2023-11-19 07:46:24,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:46:24,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:46:24,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2023-11-19 07:46:24,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4936507936507937 [2023-11-19 07:46:24,248 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 311 transitions. [2023-11-19 07:46:24,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions. [2023-11-19 07:46:24,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:46:24,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions. [2023-11-19 07:46:24,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states 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:46:24,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states 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:46:24,252 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states 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:46:24,252 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 341 flow. Second operand 3 states and 311 transitions. [2023-11-19 07:46:24,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 66 transitions, 610 flow [2023-11-19 07:46:24,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 66 transitions, 546 flow, removed 24 selfloop flow, removed 4 redundant places. [2023-11-19 07:46:24,265 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 273 flow [2023-11-19 07:46:24,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=273, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2023-11-19 07:46:24,266 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 19 predicate places. [2023-11-19 07:46:24,267 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 273 flow [2023-11-19 07:46:24,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states 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:46:24,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:46:24,268 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:46:24,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:46:24,268 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:46:24,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:24,269 INFO L85 PathProgramCache]: Analyzing trace with hash 2125304783, now seen corresponding path program 1 times [2023-11-19 07:46:24,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:24,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091947140] [2023-11-19 07:46:24,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:24,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:24,547 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:46:24,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:24,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091947140] [2023-11-19 07:46:24,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091947140] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:24,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:24,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:46:24,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306192814] [2023-11-19 07:46:24,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:24,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:46:24,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:24,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:46:24,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:46:24,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 210 [2023-11-19 07:46:24,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 273 flow. Second operand has 6 states, 6 states have (on average 93.66666666666667) internal successors, (562), 6 states have internal predecessors, (562), 0 states have call successors, (0), 0 states 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:46:24,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:46:24,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 210 [2023-11-19 07:46:24,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:46:24,820 INFO L124 PetriNetUnfolderBase]: 307/562 cut-off events. [2023-11-19 07:46:24,820 INFO L125 PetriNetUnfolderBase]: For 1315/1343 co-relation queries the response was YES. [2023-11-19 07:46:24,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2407 conditions, 562 events. 307/562 cut-off events. For 1315/1343 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2555 event pairs, 46 based on Foata normal form. 37/592 useless extension candidates. Maximal degree in co-relation 2384. Up to 276 conditions per place. [2023-11-19 07:46:24,825 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 40 selfloop transitions, 10 changer transitions 41/95 dead transitions. [2023-11-19 07:46:24,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 95 transitions, 807 flow [2023-11-19 07:46:24,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:46:24,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-19 07:46:24,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 787 transitions. [2023-11-19 07:46:24,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46845238095238095 [2023-11-19 07:46:24,829 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 787 transitions. [2023-11-19 07:46:24,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 787 transitions. [2023-11-19 07:46:24,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:46:24,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 787 transitions. [2023-11-19 07:46:24,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 98.375) internal successors, (787), 8 states have internal predecessors, (787), 0 states have call successors, (0), 0 states 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:46:24,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states 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:46:24,838 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states 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:46:24,838 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 273 flow. Second operand 8 states and 787 transitions. [2023-11-19 07:46:24,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 95 transitions, 807 flow [2023-11-19 07:46:24,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 95 transitions, 766 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-11-19 07:46:24,844 INFO L231 Difference]: Finished difference. Result has 59 places, 37 transitions, 251 flow [2023-11-19 07:46:24,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=251, PETRI_PLACES=59, PETRI_TRANSITIONS=37} [2023-11-19 07:46:24,845 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 26 predicate places. [2023-11-19 07:46:24,845 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 37 transitions, 251 flow [2023-11-19 07:46:24,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.66666666666667) internal successors, (562), 6 states have internal predecessors, (562), 0 states have call successors, (0), 0 states 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:46:24,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:46:24,846 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:46:24,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:46:24,846 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:46:24,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:24,847 INFO L85 PathProgramCache]: Analyzing trace with hash -438670364, now seen corresponding path program 1 times [2023-11-19 07:46:24,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:24,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091866559] [2023-11-19 07:46:24,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:24,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:46:24,914 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:46:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:46:25,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:46:25,026 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:46:25,027 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-19 07:46:25,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-19 07:46:25,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-19 07:46:25,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-19 07:46:25,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-19 07:46:25,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-19 07:46:25,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:46:25,031 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:25,038 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 07:46:25,038 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:46:25,110 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-19 07:46:25,112 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 07:46:25,126 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 07:46:25,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:46:25 BasicIcfg [2023-11-19 07:46:25,159 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:46:25,160 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:46:25,160 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:46:25,160 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:46:25,160 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:46:10" (3/4) ... [2023-11-19 07:46:25,161 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-19 07:46:25,195 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-19 07:46:25,196 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 07:46:25,198 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 07:46:25,275 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ad1df1c-1f26-49e1-ae3e-a3f447c6c42c/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 07:46:25,275 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:46:25,276 INFO L158 Benchmark]: Toolchain (without parser) took 16974.65ms. Allocated memory was 155.2MB in the beginning and 339.7MB in the end (delta: 184.5MB). Free memory was 110.3MB in the beginning and 196.4MB in the end (delta: -86.2MB). Peak memory consumption was 100.1MB. Max. memory is 16.1GB. [2023-11-19 07:46:25,276 INFO L158 Benchmark]: CDTParser took 0.61ms. Allocated memory is still 113.2MB. Free memory is still 63.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:46:25,277 INFO L158 Benchmark]: CACSL2BoogieTranslator took 775.29ms. Allocated memory is still 155.2MB. Free memory was 110.0MB in the beginning and 86.4MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-19 07:46:25,277 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.51ms. Allocated memory is still 155.2MB. Free memory was 86.4MB in the beginning and 83.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:46:25,277 INFO L158 Benchmark]: Boogie Preprocessor took 41.76ms. Allocated memory is still 155.2MB. Free memory was 83.8MB in the beginning and 82.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:46:25,278 INFO L158 Benchmark]: RCFGBuilder took 866.89ms. Allocated memory is still 155.2MB. Free memory was 81.7MB in the beginning and 90.6MB in the end (delta: -8.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-19 07:46:25,278 INFO L158 Benchmark]: TraceAbstraction took 15106.28ms. Allocated memory was 155.2MB in the beginning and 339.7MB in the end (delta: 184.5MB). Free memory was 90.0MB in the beginning and 205.9MB in the end (delta: -115.8MB). Peak memory consumption was 71.5MB. Max. memory is 16.1GB. [2023-11-19 07:46:25,279 INFO L158 Benchmark]: Witness Printer took 115.89ms. Allocated memory is still 339.7MB. Free memory was 205.9MB in the beginning and 196.4MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-19 07:46:25,281 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.61ms. Allocated memory is still 113.2MB. Free memory is still 63.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 775.29ms. Allocated memory is still 155.2MB. Free memory was 110.0MB in the beginning and 86.4MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.51ms. Allocated memory is still 155.2MB. Free memory was 86.4MB in the beginning and 83.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.76ms. Allocated memory is still 155.2MB. Free memory was 83.8MB in the beginning and 82.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 866.89ms. Allocated memory is still 155.2MB. Free memory was 81.7MB in the beginning and 90.6MB in the end (delta: -8.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 15106.28ms. Allocated memory was 155.2MB in the beginning and 339.7MB in the end (delta: 184.5MB). Free memory was 90.0MB in the beginning and 205.9MB in the end (delta: -115.8MB). Peak memory consumption was 71.5MB. Max. memory is 16.1GB. * Witness Printer took 115.89ms. Allocated memory is still 339.7MB. Free memory was 205.9MB in the beginning and 196.4MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 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.3s, 115 PlacesBefore, 33 PlacesAfterwards, 108 TransitionsBefore, 23 TransitionsAfterwards, 2190 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 3 ChoiceCompositions, 99 TotalNumberOfCompositions, 4924 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2439, independent: 2284, independent conditional: 0, independent unconditional: 2284, dependent: 155, dependent conditional: 0, dependent unconditional: 155, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1132, independent: 1091, independent conditional: 0, independent unconditional: 1091, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2439, independent: 1193, independent conditional: 0, independent unconditional: 1193, dependent: 114, dependent conditional: 0, dependent unconditional: 114, unknown: 1132, unknown conditional: 0, unknown unconditional: 1132] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 61, Positive conditional cache size: 0, Positive unconditional cache size: 61, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L716] 0 _Bool x$flush_delayed; [L717] 0 int x$mem_tmp; [L718] 0 _Bool x$r_buff0_thd0; [L719] 0 _Bool x$r_buff0_thd1; [L720] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff0_thd3; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$r_buff1_thd3; [L726] 0 _Bool x$read_delayed; [L727] 0 int *x$read_delayed_var; [L728] 0 int x$w_buff0; [L729] 0 _Bool x$w_buff0_used; [L730] 0 int x$w_buff1; [L731] 0 _Bool x$w_buff1_used; [L733] 0 int y = 0; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2028; [L819] FCALL, FORK 0 pthread_create(&t2028, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2028={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L820] 0 pthread_t t2029; [L821] FCALL, FORK 0 pthread_create(&t2029, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2028={5:0}, t2029={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L822] 0 pthread_t t2030; [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L823] FCALL, FORK 0 pthread_create(&t2030, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2028={5:0}, t2029={6:0}, t2030={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2028={5:0}, t2029={6:0}, t2030={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 823]: 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: 819]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 137 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 388 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 300 mSDsluCounter, 120 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 62 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 724 IncrementalHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 58 mSDtfsCounter, 724 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=341occurred in iteration=8, InterpolantAutomatonStates: 48, 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.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 821 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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:46:25,323 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ad1df1c-1f26-49e1-ae3e-a3f447c6c42c/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