./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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_f29df63a-ff4f-4bee-a66c-d34d18bce9a7/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29df63a-ff4f-4bee-a66c-d34d18bce9a7/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_f29df63a-ff4f-4bee-a66c-d34d18bce9a7/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29df63a-ff4f-4bee-a66c-d34d18bce9a7/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29df63a-ff4f-4bee-a66c-d34d18bce9a7/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_f29df63a-ff4f-4bee-a66c-d34d18bce9a7/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 40c6d23f476fb49e658cd83073483dddc1740bbd5f458e601d84fe47899d7237 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:38:37,766 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:38:37,890 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29df63a-ff4f-4bee-a66c-d34d18bce9a7/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:38:37,900 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:38:37,904 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:38:37,952 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:38:37,957 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:38:37,958 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:38:37,960 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:38:37,965 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:38:37,966 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:38:37,967 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:38:37,968 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:38:37,970 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:38:37,970 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:38:37,971 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:38:37,971 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:38:37,972 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:38:37,972 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:38:37,972 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:38:37,972 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:38:37,978 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:38:37,978 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:38:37,979 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:38:37,979 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:38:37,980 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:38:37,981 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:38:37,981 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:38:37,982 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:38:37,982 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:38:37,984 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:38:37,984 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:38:37,984 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:38:37,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:38:37,985 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:38:38,016 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:38:38,016 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:38:38,017 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:38:38,017 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:38:38,017 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_f29df63a-ff4f-4bee-a66c-d34d18bce9a7/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_f29df63a-ff4f-4bee-a66c-d34d18bce9a7/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 -> 40c6d23f476fb49e658cd83073483dddc1740bbd5f458e601d84fe47899d7237 [2023-11-19 07:38:38,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:38:38,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:38:38,394 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:38:38,396 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:38:38,396 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:38:38,398 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29df63a-ff4f-4bee-a66c-d34d18bce9a7/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-19 07:38:41,754 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:38:42,145 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:38:42,146 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29df63a-ff4f-4bee-a66c-d34d18bce9a7/sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-19 07:38:42,176 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29df63a-ff4f-4bee-a66c-d34d18bce9a7/bin/uautomizer-verify-uCwYo4JHxu/data/90e1130e3/ca60bead407f43f7b70f71652e9895a5/FLAGd15d18a90 [2023-11-19 07:38:42,195 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29df63a-ff4f-4bee-a66c-d34d18bce9a7/bin/uautomizer-verify-uCwYo4JHxu/data/90e1130e3/ca60bead407f43f7b70f71652e9895a5 [2023-11-19 07:38:42,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:38:42,205 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:38:42,219 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:38:42,219 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:38:42,227 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:38:42,228 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:38:42" (1/1) ... [2023-11-19 07:38:42,229 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e1a27a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:42, skipping insertion in model container [2023-11-19 07:38:42,230 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:38:42" (1/1) ... [2023-11-19 07:38:42,294 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:38:42,552 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_f29df63a-ff4f-4bee-a66c-d34d18bce9a7/sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-11-19 07:38:42,932 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:38:42,946 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:38:42,961 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_f29df63a-ff4f-4bee-a66c-d34d18bce9a7/sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-11-19 07:38:43,038 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:38:43,091 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:38:43,091 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:38:43,100 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:38:43,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:43 WrapperNode [2023-11-19 07:38:43,101 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:38:43,102 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:38:43,103 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:38:43,103 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:38:43,111 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:38:43" (1/1) ... [2023-11-19 07:38:43,151 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:38:43" (1/1) ... [2023-11-19 07:38:43,197 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2023-11-19 07:38:43,198 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:38:43,198 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:38:43,199 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:38:43,199 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:38:43,209 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:43" (1/1) ... [2023-11-19 07:38:43,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:43" (1/1) ... [2023-11-19 07:38:43,231 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:43" (1/1) ... [2023-11-19 07:38:43,231 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:43" (1/1) ... [2023-11-19 07:38:43,240 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:43" (1/1) ... [2023-11-19 07:38:43,242 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:43" (1/1) ... [2023-11-19 07:38:43,245 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:43" (1/1) ... [2023-11-19 07:38:43,247 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:43" (1/1) ... [2023-11-19 07:38:43,263 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:38:43,272 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:38:43,272 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:38:43,272 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:38:43,273 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:43" (1/1) ... [2023-11-19 07:38:43,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:38:43,293 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29df63a-ff4f-4bee-a66c-d34d18bce9a7/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:38:43,319 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29df63a-ff4f-4bee-a66c-d34d18bce9a7/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:38:43,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29df63a-ff4f-4bee-a66c-d34d18bce9a7/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:38:43,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:38:43,377 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:38:43,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:38:43,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:38:43,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:38:43,378 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:38:43,378 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:38:43,378 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:38:43,378 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:38:43,378 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 07:38:43,379 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 07:38:43,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:38:43,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:38:43,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:38:43,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:38:43,381 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:38:43,526 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:38:43,528 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:38:43,892 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:38:44,047 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:38:44,047 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:38:44,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:38:44 BoogieIcfgContainer [2023-11-19 07:38:44,055 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:38:44,060 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:38:44,061 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:38:44,065 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:38:44,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:38:42" (1/3) ... [2023-11-19 07:38:44,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec06867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:38:44, skipping insertion in model container [2023-11-19 07:38:44,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:43" (2/3) ... [2023-11-19 07:38:44,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec06867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:38:44, skipping insertion in model container [2023-11-19 07:38:44,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:38:44" (3/3) ... [2023-11-19 07:38:44,071 INFO L112 eAbstractionObserver]: Analyzing ICFG safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-19 07:38:44,082 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 07:38:44,092 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:38:44,092 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-19 07:38:44,092 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:38:44,155 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:38:44,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 236 flow [2023-11-19 07:38:44,257 INFO L124 PetriNetUnfolderBase]: 2/109 cut-off events. [2023-11-19 07:38:44,257 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:38:44,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2023-11-19 07:38:44,263 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 236 flow [2023-11-19 07:38:44,269 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2023-11-19 07:38:44,274 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:38:44,286 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 109 transitions, 227 flow [2023-11-19 07:38:44,289 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 109 transitions, 227 flow [2023-11-19 07:38:44,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 227 flow [2023-11-19 07:38:44,344 INFO L124 PetriNetUnfolderBase]: 2/109 cut-off events. [2023-11-19 07:38:44,345 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:38:44,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2023-11-19 07:38:44,350 INFO L119 LiptonReduction]: Number of co-enabled transitions 2206 [2023-11-19 07:38:48,917 INFO L134 LiptonReduction]: Checked pairs total: 4906 [2023-11-19 07:38:48,918 INFO L136 LiptonReduction]: Total number of compositions: 101 [2023-11-19 07:38:48,944 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:38:48,953 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;@5cf91814, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:38:48,953 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-19 07:38:48,961 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:38:48,961 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-11-19 07:38:48,961 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:38:48,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:38:48,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 07:38:48,963 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:38:48,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:48,968 INFO L85 PathProgramCache]: Analyzing trace with hash 463624678, now seen corresponding path program 1 times [2023-11-19 07:38:48,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:48,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309170177] [2023-11-19 07:38:48,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:48,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:49,555 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:38:49,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:38:49,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309170177] [2023-11-19 07:38:49,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309170177] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:49,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:49,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:38:49,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124087198] [2023-11-19 07:38:49,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:49,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:38:49,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:38:49,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:38:49,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:38:49,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 213 [2023-11-19 07:38:49,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 53 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states 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:38:49,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:38:49,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 213 [2023-11-19 07:38:49,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:38:50,001 INFO L124 PetriNetUnfolderBase]: 711/1124 cut-off events. [2023-11-19 07:38:50,001 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-19 07:38:50,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2243 conditions, 1124 events. 711/1124 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5029 event pairs, 197 based on Foata normal form. 0/1056 useless extension candidates. Maximal degree in co-relation 2232. Up to 859 conditions per place. [2023-11-19 07:38:50,020 INFO L140 encePairwiseOnDemand]: 210/213 looper letters, 27 selfloop transitions, 2 changer transitions 2/33 dead transitions. [2023-11-19 07:38:50,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 33 transitions, 140 flow [2023-11-19 07:38:50,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:38:50,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:38:50,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 329 transitions. [2023-11-19 07:38:50,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.514866979655712 [2023-11-19 07:38:50,040 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 329 transitions. [2023-11-19 07:38:50,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 329 transitions. [2023-11-19 07:38:50,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:38:50,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 329 transitions. [2023-11-19 07:38:50,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states 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:38:50,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states 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:38:50,064 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states 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:38:50,066 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 53 flow. Second operand 3 states and 329 transitions. [2023-11-19 07:38:50,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 33 transitions, 140 flow [2023-11-19 07:38:50,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 136 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-19 07:38:50,072 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 50 flow [2023-11-19 07:38:50,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-11-19 07:38:50,079 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-11-19 07:38:50,079 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 50 flow [2023-11-19 07:38:50,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states 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:38:50,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:38:50,080 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:38:50,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:38:50,081 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:38:50,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:50,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1881693280, now seen corresponding path program 1 times [2023-11-19 07:38:50,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:50,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916749253] [2023-11-19 07:38:50,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:50,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:38:50,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:38:50,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916749253] [2023-11-19 07:38:50,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916749253] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:50,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:50,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:38:50,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97006445] [2023-11-19 07:38:50,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:50,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:38:50,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:38:50,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:38:50,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:38:50,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 213 [2023-11-19 07:38:50,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states 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:38:50,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:38:50,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 213 [2023-11-19 07:38:50,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:38:50,627 INFO L124 PetriNetUnfolderBase]: 703/1066 cut-off events. [2023-11-19 07:38:50,628 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2023-11-19 07:38:50,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2252 conditions, 1066 events. 703/1066 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4633 event pairs, 193 based on Foata normal form. 8/1071 useless extension candidates. Maximal degree in co-relation 2242. Up to 1009 conditions per place. [2023-11-19 07:38:50,640 INFO L140 encePairwiseOnDemand]: 209/213 looper letters, 28 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2023-11-19 07:38:50,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 32 transitions, 142 flow [2023-11-19 07:38:50,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:38:50,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:38:50,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2023-11-19 07:38:50,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5054773082942097 [2023-11-19 07:38:50,645 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 323 transitions. [2023-11-19 07:38:50,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions. [2023-11-19 07:38:50,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:38:50,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions. [2023-11-19 07:38:50,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states 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:38:50,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states 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:38:50,654 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states 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:38:50,654 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 50 flow. Second operand 3 states and 323 transitions. [2023-11-19 07:38:50,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 32 transitions, 142 flow [2023-11-19 07:38:50,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 32 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:38:50,657 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 65 flow [2023-11-19 07:38:50,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2023-11-19 07:38:50,658 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-11-19 07:38:50,659 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 65 flow [2023-11-19 07:38:50,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states 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:38:50,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:38:50,660 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:38:50,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:38:50,661 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:38:50,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:50,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1797051256, now seen corresponding path program 1 times [2023-11-19 07:38:50,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:50,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459566039] [2023-11-19 07:38:50,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:50,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,908 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:38:50,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:38:50,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459566039] [2023-11-19 07:38:50,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459566039] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:50,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:50,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:38:50,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626514972] [2023-11-19 07:38:50,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:50,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:38:50,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:38:50,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:38:50,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:38:50,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 213 [2023-11-19 07:38:50,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 65 flow. Second operand has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 0 states 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:38:50,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:38:50,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 213 [2023-11-19 07:38:50,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:38:51,365 INFO L124 PetriNetUnfolderBase]: 1040/1596 cut-off events. [2023-11-19 07:38:51,366 INFO L125 PetriNetUnfolderBase]: For 250/250 co-relation queries the response was YES. [2023-11-19 07:38:51,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3536 conditions, 1596 events. 1040/1596 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6698 event pairs, 290 based on Foata normal form. 90/1686 useless extension candidates. Maximal degree in co-relation 3525. Up to 583 conditions per place. [2023-11-19 07:38:51,380 INFO L140 encePairwiseOnDemand]: 207/213 looper letters, 35 selfloop transitions, 6 changer transitions 2/43 dead transitions. [2023-11-19 07:38:51,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 43 transitions, 205 flow [2023-11-19 07:38:51,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:38:51,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:38:51,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 409 transitions. [2023-11-19 07:38:51,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4800469483568075 [2023-11-19 07:38:51,384 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 409 transitions. [2023-11-19 07:38:51,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 409 transitions. [2023-11-19 07:38:51,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:38:51,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 409 transitions. [2023-11-19 07:38:51,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 102.25) internal successors, (409), 4 states have internal predecessors, (409), 0 states have call successors, (0), 0 states 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:38:51,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:38:51,395 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:38:51,395 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 65 flow. Second operand 4 states and 409 transitions. [2023-11-19 07:38:51,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 43 transitions, 205 flow [2023-11-19 07:38:51,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 43 transitions, 200 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:38:51,399 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 112 flow [2023-11-19 07:38:51,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=62, 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=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2023-11-19 07:38:51,401 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2023-11-19 07:38:51,405 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 112 flow [2023-11-19 07:38:51,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 0 states 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:38:51,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:38:51,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:38:51,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:38:51,408 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:38:51,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:51,408 INFO L85 PathProgramCache]: Analyzing trace with hash -739322741, now seen corresponding path program 1 times [2023-11-19 07:38:51,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:51,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400475721] [2023-11-19 07:38:51,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:51,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,815 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:38:51,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:38:51,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400475721] [2023-11-19 07:38:51,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400475721] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:51,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:51,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:38:51,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224844799] [2023-11-19 07:38:51,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:51,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:38:51,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:38:51,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:38:51,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:38:51,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 213 [2023-11-19 07:38:51,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 94.4) internal successors, (472), 5 states have internal predecessors, (472), 0 states have call successors, (0), 0 states 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:38:51,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:38:51,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 213 [2023-11-19 07:38:51,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:38:52,458 INFO L124 PetriNetUnfolderBase]: 1402/2168 cut-off events. [2023-11-19 07:38:52,459 INFO L125 PetriNetUnfolderBase]: For 1406/1406 co-relation queries the response was YES. [2023-11-19 07:38:52,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5471 conditions, 2168 events. 1402/2168 cut-off events. For 1406/1406 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 10614 event pairs, 194 based on Foata normal form. 45/2213 useless extension candidates. Maximal degree in co-relation 5456. Up to 1116 conditions per place. [2023-11-19 07:38:52,475 INFO L140 encePairwiseOnDemand]: 207/213 looper letters, 40 selfloop transitions, 7 changer transitions 11/58 dead transitions. [2023-11-19 07:38:52,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 58 transitions, 322 flow [2023-11-19 07:38:52,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:38:52,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:38:52,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 515 transitions. [2023-11-19 07:38:52,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4835680751173709 [2023-11-19 07:38:52,479 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 515 transitions. [2023-11-19 07:38:52,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 515 transitions. [2023-11-19 07:38:52,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:38:52,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 515 transitions. [2023-11-19 07:38:52,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states 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:38:52,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states 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:38:52,488 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states 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:38:52,488 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 112 flow. Second operand 5 states and 515 transitions. [2023-11-19 07:38:52,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 58 transitions, 322 flow [2023-11-19 07:38:52,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 58 transitions, 319 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:38:52,493 INFO L231 Difference]: Finished difference. Result has 39 places, 25 transitions, 121 flow [2023-11-19 07:38:52,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2023-11-19 07:38:52,495 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2023-11-19 07:38:52,495 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 25 transitions, 121 flow [2023-11-19 07:38:52,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.4) internal successors, (472), 5 states have internal predecessors, (472), 0 states have call successors, (0), 0 states 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:38:52,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:38:52,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:38:52,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:38:52,497 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:38:52,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:52,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1442441808, now seen corresponding path program 1 times [2023-11-19 07:38:52,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:52,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134309538] [2023-11-19 07:38:52,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:52,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:52,746 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:38:52,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:38:52,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134309538] [2023-11-19 07:38:52,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134309538] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:52,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:52,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:38:52,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796197117] [2023-11-19 07:38:52,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:52,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:38:52,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:38:52,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:38:52,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:38:52,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 213 [2023-11-19 07:38:52,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 25 transitions, 121 flow. Second operand has 5 states, 5 states have (on average 94.6) internal successors, (473), 5 states have internal predecessors, (473), 0 states have call successors, (0), 0 states 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:38:52,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:38:52,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 213 [2023-11-19 07:38:52,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:38:53,623 INFO L124 PetriNetUnfolderBase]: 1720/2684 cut-off events. [2023-11-19 07:38:53,624 INFO L125 PetriNetUnfolderBase]: For 2257/2257 co-relation queries the response was YES. [2023-11-19 07:38:53,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7047 conditions, 2684 events. 1720/2684 cut-off events. For 2257/2257 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 13678 event pairs, 359 based on Foata normal form. 48/2732 useless extension candidates. Maximal degree in co-relation 7030. Up to 660 conditions per place. [2023-11-19 07:38:53,648 INFO L140 encePairwiseOnDemand]: 206/213 looper letters, 39 selfloop transitions, 8 changer transitions 32/79 dead transitions. [2023-11-19 07:38:53,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 79 transitions, 443 flow [2023-11-19 07:38:53,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:38:53,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:38:53,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 721 transitions. [2023-11-19 07:38:53,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4835680751173709 [2023-11-19 07:38:53,653 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 721 transitions. [2023-11-19 07:38:53,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 721 transitions. [2023-11-19 07:38:53,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:38:53,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 721 transitions. [2023-11-19 07:38:53,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:38:53,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states 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:38:53,667 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states 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:38:53,667 INFO L175 Difference]: Start difference. First operand has 39 places, 25 transitions, 121 flow. Second operand 7 states and 721 transitions. [2023-11-19 07:38:53,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 79 transitions, 443 flow [2023-11-19 07:38:53,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 79 transitions, 413 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-11-19 07:38:53,678 INFO L231 Difference]: Finished difference. Result has 47 places, 26 transitions, 157 flow [2023-11-19 07:38:53,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=157, PETRI_PLACES=47, PETRI_TRANSITIONS=26} [2023-11-19 07:38:53,680 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 15 predicate places. [2023-11-19 07:38:53,680 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 26 transitions, 157 flow [2023-11-19 07:38:53,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.6) internal successors, (473), 5 states have internal predecessors, (473), 0 states have call successors, (0), 0 states 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:38:53,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:38:53,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:38:53,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:38:53,682 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:38:53,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:53,683 INFO L85 PathProgramCache]: Analyzing trace with hash -413718392, now seen corresponding path program 1 times [2023-11-19 07:38:53,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:53,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519680582] [2023-11-19 07:38:53,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:53,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:53,975 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:38:53,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:38:53,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519680582] [2023-11-19 07:38:53,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519680582] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:53,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:53,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:38:53,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122791572] [2023-11-19 07:38:53,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:53,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:38:53,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:38:53,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:38:53,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:38:54,003 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 213 [2023-11-19 07:38:54,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 26 transitions, 157 flow. Second operand has 4 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 states 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:38:54,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:38:54,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 213 [2023-11-19 07:38:54,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:38:54,337 INFO L124 PetriNetUnfolderBase]: 559/984 cut-off events. [2023-11-19 07:38:54,338 INFO L125 PetriNetUnfolderBase]: For 1596/1608 co-relation queries the response was YES. [2023-11-19 07:38:54,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2816 conditions, 984 events. 559/984 cut-off events. For 1596/1608 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4976 event pairs, 123 based on Foata normal form. 116/1086 useless extension candidates. Maximal degree in co-relation 2794. Up to 408 conditions per place. [2023-11-19 07:38:54,348 INFO L140 encePairwiseOnDemand]: 207/213 looper letters, 38 selfloop transitions, 5 changer transitions 6/53 dead transitions. [2023-11-19 07:38:54,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 377 flow [2023-11-19 07:38:54,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:38:54,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:38:54,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 419 transitions. [2023-11-19 07:38:54,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49178403755868544 [2023-11-19 07:38:54,353 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 419 transitions. [2023-11-19 07:38:54,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 419 transitions. [2023-11-19 07:38:54,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:38:54,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 419 transitions. [2023-11-19 07:38:54,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 0 states 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:38:54,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:38:54,360 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:38:54,360 INFO L175 Difference]: Start difference. First operand has 47 places, 26 transitions, 157 flow. Second operand 4 states and 419 transitions. [2023-11-19 07:38:54,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 377 flow [2023-11-19 07:38:54,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 323 flow, removed 15 selfloop flow, removed 5 redundant places. [2023-11-19 07:38:54,371 INFO L231 Difference]: Finished difference. Result has 45 places, 30 transitions, 161 flow [2023-11-19 07:38:54,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=45, PETRI_TRANSITIONS=30} [2023-11-19 07:38:54,375 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2023-11-19 07:38:54,375 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 30 transitions, 161 flow [2023-11-19 07:38:54,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 states 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:38:54,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:38:54,377 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:38:54,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:38:54,377 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:38:54,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:54,378 INFO L85 PathProgramCache]: Analyzing trace with hash -995078208, now seen corresponding path program 1 times [2023-11-19 07:38:54,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:54,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812622466] [2023-11-19 07:38:54,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:54,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:54,712 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:38:54,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:38:54,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812622466] [2023-11-19 07:38:54,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812622466] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:54,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:54,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:38:54,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371217793] [2023-11-19 07:38:54,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:54,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:38:54,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:38:54,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:38:54,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:38:54,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 213 [2023-11-19 07:38:54,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 30 transitions, 161 flow. Second operand has 5 states, 5 states have (on average 95.2) internal successors, (476), 5 states have internal predecessors, (476), 0 states have call successors, (0), 0 states 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:38:54,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:38:54,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 213 [2023-11-19 07:38:54,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:38:55,255 INFO L124 PetriNetUnfolderBase]: 1047/1831 cut-off events. [2023-11-19 07:38:55,255 INFO L125 PetriNetUnfolderBase]: For 2227/2227 co-relation queries the response was YES. [2023-11-19 07:38:55,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6313 conditions, 1831 events. 1047/1831 cut-off events. For 2227/2227 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 10177 event pairs, 330 based on Foata normal form. 33/1864 useless extension candidates. Maximal degree in co-relation 6292. Up to 942 conditions per place. [2023-11-19 07:38:55,273 INFO L140 encePairwiseOnDemand]: 207/213 looper letters, 40 selfloop transitions, 7 changer transitions 17/64 dead transitions. [2023-11-19 07:38:55,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 64 transitions, 443 flow [2023-11-19 07:38:55,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:38:55,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:38:55,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 510 transitions. [2023-11-19 07:38:55,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4788732394366197 [2023-11-19 07:38:55,278 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 510 transitions. [2023-11-19 07:38:55,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 510 transitions. [2023-11-19 07:38:55,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:38:55,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 510 transitions. [2023-11-19 07:38:55,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:38:55,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states 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:38:55,287 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states 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:38:55,287 INFO L175 Difference]: Start difference. First operand has 45 places, 30 transitions, 161 flow. Second operand 5 states and 510 transitions. [2023-11-19 07:38:55,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 64 transitions, 443 flow [2023-11-19 07:38:55,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 64 transitions, 437 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-19 07:38:55,303 INFO L231 Difference]: Finished difference. Result has 49 places, 29 transitions, 175 flow [2023-11-19 07:38:55,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=175, PETRI_PLACES=49, PETRI_TRANSITIONS=29} [2023-11-19 07:38:55,305 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 17 predicate places. [2023-11-19 07:38:55,305 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 29 transitions, 175 flow [2023-11-19 07:38:55,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.2) internal successors, (476), 5 states have internal predecessors, (476), 0 states have call successors, (0), 0 states 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:38:55,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:38:55,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:38:55,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:38:55,307 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:38:55,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:55,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1740659860, now seen corresponding path program 2 times [2023-11-19 07:38:55,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:55,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121776703] [2023-11-19 07:38:55,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:55,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:55,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:55,634 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:38:55,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:38:55,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121776703] [2023-11-19 07:38:55,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121776703] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:55,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:55,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:38:55,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24024889] [2023-11-19 07:38:55,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:55,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:38:55,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:38:55,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:38:55,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:38:55,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 213 [2023-11-19 07:38:55,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 29 transitions, 175 flow. Second operand has 5 states, 5 states have (on average 96.8) internal successors, (484), 5 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:38:55,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:38:55,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 213 [2023-11-19 07:38:55,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:38:55,966 INFO L124 PetriNetUnfolderBase]: 282/552 cut-off events. [2023-11-19 07:38:55,966 INFO L125 PetriNetUnfolderBase]: For 788/790 co-relation queries the response was YES. [2023-11-19 07:38:55,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1911 conditions, 552 events. 282/552 cut-off events. For 788/790 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2581 event pairs, 46 based on Foata normal form. 67/615 useless extension candidates. Maximal degree in co-relation 1888. Up to 212 conditions per place. [2023-11-19 07:38:55,972 INFO L140 encePairwiseOnDemand]: 207/213 looper letters, 41 selfloop transitions, 8 changer transitions 9/62 dead transitions. [2023-11-19 07:38:55,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 62 transitions, 459 flow [2023-11-19 07:38:55,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:38:55,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:38:55,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 522 transitions. [2023-11-19 07:38:55,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49014084507042255 [2023-11-19 07:38:55,976 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 522 transitions. [2023-11-19 07:38:55,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 522 transitions. [2023-11-19 07:38:55,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:38:55,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 522 transitions. [2023-11-19 07:38:55,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states 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:38:55,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states 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:38:55,983 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states 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:38:55,983 INFO L175 Difference]: Start difference. First operand has 49 places, 29 transitions, 175 flow. Second operand 5 states and 522 transitions. [2023-11-19 07:38:55,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 62 transitions, 459 flow [2023-11-19 07:38:55,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 62 transitions, 414 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-11-19 07:38:55,988 INFO L231 Difference]: Finished difference. Result has 49 places, 32 transitions, 195 flow [2023-11-19 07:38:55,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=195, PETRI_PLACES=49, PETRI_TRANSITIONS=32} [2023-11-19 07:38:55,989 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 17 predicate places. [2023-11-19 07:38:55,989 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 32 transitions, 195 flow [2023-11-19 07:38:55,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.8) internal successors, (484), 5 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:38:55,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:38:55,990 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:38:55,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:38:55,991 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:38:55,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:55,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1770201911, now seen corresponding path program 1 times [2023-11-19 07:38:55,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:55,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731715000] [2023-11-19 07:38:55,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:55,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:56,545 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:38:56,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:38:56,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731715000] [2023-11-19 07:38:56,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731715000] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:56,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:56,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:38:56,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880158762] [2023-11-19 07:38:56,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:56,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:38:56,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:38:56,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:38:56,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:38:56,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 213 [2023-11-19 07:38:56,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 32 transitions, 195 flow. Second operand has 6 states, 6 states have (on average 96.66666666666667) internal successors, (580), 6 states have internal predecessors, (580), 0 states have call successors, (0), 0 states 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:38:56,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:38:56,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 213 [2023-11-19 07:38:56,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:38:56,816 INFO L124 PetriNetUnfolderBase]: 234/489 cut-off events. [2023-11-19 07:38:56,816 INFO L125 PetriNetUnfolderBase]: For 964/965 co-relation queries the response was YES. [2023-11-19 07:38:56,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1915 conditions, 489 events. 234/489 cut-off events. For 964/965 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2215 event pairs, 29 based on Foata normal form. 11/500 useless extension candidates. Maximal degree in co-relation 1892. Up to 259 conditions per place. [2023-11-19 07:38:56,820 INFO L140 encePairwiseOnDemand]: 206/213 looper letters, 43 selfloop transitions, 6 changer transitions 22/75 dead transitions. [2023-11-19 07:38:56,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 75 transitions, 611 flow [2023-11-19 07:38:56,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:38:56,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:38:56,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 706 transitions. [2023-11-19 07:38:56,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47350771294433264 [2023-11-19 07:38:56,824 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 706 transitions. [2023-11-19 07:38:56,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 706 transitions. [2023-11-19 07:38:56,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:38:56,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 706 transitions. [2023-11-19 07:38:56,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.85714285714286) internal successors, (706), 7 states have internal predecessors, (706), 0 states have call successors, (0), 0 states 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:38:56,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states 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:38:56,832 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states 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:38:56,832 INFO L175 Difference]: Start difference. First operand has 49 places, 32 transitions, 195 flow. Second operand 7 states and 706 transitions. [2023-11-19 07:38:56,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 75 transitions, 611 flow [2023-11-19 07:38:56,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 75 transitions, 527 flow, removed 15 selfloop flow, removed 5 redundant places. [2023-11-19 07:38:56,838 INFO L231 Difference]: Finished difference. Result has 54 places, 36 transitions, 213 flow [2023-11-19 07:38:56,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=213, PETRI_PLACES=54, PETRI_TRANSITIONS=36} [2023-11-19 07:38:56,839 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 22 predicate places. [2023-11-19 07:38:56,839 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 36 transitions, 213 flow [2023-11-19 07:38:56,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.66666666666667) internal successors, (580), 6 states have internal predecessors, (580), 0 states have call successors, (0), 0 states 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:38:56,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:38:56,840 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:38:56,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:38:56,840 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:38:56,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:56,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1907005970, now seen corresponding path program 1 times [2023-11-19 07:38:56,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:56,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725165619] [2023-11-19 07:38:56,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:56,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:56,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:57,077 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:38:57,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:38:57,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725165619] [2023-11-19 07:38:57,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725165619] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:57,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:57,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:38:57,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980910213] [2023-11-19 07:38:57,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:57,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:38:57,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:38:57,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:38:57,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:38:57,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 213 [2023-11-19 07:38:57,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 36 transitions, 213 flow. Second operand has 6 states, 6 states have (on average 96.66666666666667) internal successors, (580), 6 states have internal predecessors, (580), 0 states have call successors, (0), 0 states 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:38:57,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:38:57,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 213 [2023-11-19 07:38:57,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:38:57,269 INFO L124 PetriNetUnfolderBase]: 164/349 cut-off events. [2023-11-19 07:38:57,269 INFO L125 PetriNetUnfolderBase]: For 750/754 co-relation queries the response was YES. [2023-11-19 07:38:57,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1339 conditions, 349 events. 164/349 cut-off events. For 750/754 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1423 event pairs, 38 based on Foata normal form. 23/368 useless extension candidates. Maximal degree in co-relation 1314. Up to 120 conditions per place. [2023-11-19 07:38:57,273 INFO L140 encePairwiseOnDemand]: 207/213 looper letters, 34 selfloop transitions, 11 changer transitions 8/57 dead transitions. [2023-11-19 07:38:57,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 57 transitions, 430 flow [2023-11-19 07:38:57,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:38:57,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:38:57,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 608 transitions. [2023-11-19 07:38:57,276 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4757433489827856 [2023-11-19 07:38:57,277 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 608 transitions. [2023-11-19 07:38:57,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 608 transitions. [2023-11-19 07:38:57,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:38:57,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 608 transitions. [2023-11-19 07:38:57,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.33333333333333) internal successors, (608), 6 states have internal predecessors, (608), 0 states have call successors, (0), 0 states 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:38:57,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states 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:38:57,284 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states 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:38:57,284 INFO L175 Difference]: Start difference. First operand has 54 places, 36 transitions, 213 flow. Second operand 6 states and 608 transitions. [2023-11-19 07:38:57,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 57 transitions, 430 flow [2023-11-19 07:38:57,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 57 transitions, 411 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-11-19 07:38:57,288 INFO L231 Difference]: Finished difference. Result has 54 places, 34 transitions, 221 flow [2023-11-19 07:38:57,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=221, PETRI_PLACES=54, PETRI_TRANSITIONS=34} [2023-11-19 07:38:57,289 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 22 predicate places. [2023-11-19 07:38:57,289 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 34 transitions, 221 flow [2023-11-19 07:38:57,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.66666666666667) internal successors, (580), 6 states have internal predecessors, (580), 0 states have call successors, (0), 0 states 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:38:57,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:38:57,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:38:57,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:38:57,290 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:38:57,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:57,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1488839693, now seen corresponding path program 1 times [2023-11-19 07:38:57,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:57,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093544432] [2023-11-19 07:38:57,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:57,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:38:57,358 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:38:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:38:57,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:38:57,449 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:38:57,450 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-19 07:38:57,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-19 07:38:57,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-19 07:38:57,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-19 07:38:57,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-19 07:38:57,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-19 07:38:57,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:38:57,453 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:38:57,459 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 07:38:57,459 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:38:57,522 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 07:38:57,524 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 07:38:57,537 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 07:38:57,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:38:57 BasicIcfg [2023-11-19 07:38:57,552 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:38:57,552 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:38:57,552 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:38:57,553 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:38:57,553 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:38:44" (3/4) ... [2023-11-19 07:38:57,554 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-19 07:38:57,571 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 07:38:57,572 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 07:38:57,574 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 07:38:57,626 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29df63a-ff4f-4bee-a66c-d34d18bce9a7/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 07:38:57,627 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:38:57,627 INFO L158 Benchmark]: Toolchain (without parser) took 15422.77ms. Allocated memory was 195.0MB in the beginning and 339.7MB in the end (delta: 144.7MB). Free memory was 163.8MB in the beginning and 175.8MB in the end (delta: -12.1MB). Peak memory consumption was 133.5MB. Max. memory is 16.1GB. [2023-11-19 07:38:57,628 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 132.1MB. Free memory is still 104.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:38:57,628 INFO L158 Benchmark]: CACSL2BoogieTranslator took 882.49ms. Allocated memory is still 195.0MB. Free memory was 166.1MB in the beginning and 143.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-19 07:38:57,628 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.42ms. Allocated memory is still 195.0MB. Free memory was 143.0MB in the beginning and 140.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:38:57,629 INFO L158 Benchmark]: Boogie Preprocessor took 72.48ms. Allocated memory is still 195.0MB. Free memory was 140.9MB in the beginning and 138.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:38:57,629 INFO L158 Benchmark]: RCFGBuilder took 783.98ms. Allocated memory is still 195.0MB. Free memory was 138.8MB in the beginning and 133.1MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-19 07:38:57,630 INFO L158 Benchmark]: TraceAbstraction took 13491.49ms. Allocated memory was 195.0MB in the beginning and 339.7MB in the end (delta: 144.7MB). Free memory was 132.1MB in the beginning and 185.3MB in the end (delta: -53.1MB). Peak memory consumption was 93.6MB. Max. memory is 16.1GB. [2023-11-19 07:38:57,630 INFO L158 Benchmark]: Witness Printer took 74.48ms. Allocated memory is still 339.7MB. Free memory was 185.3MB in the beginning and 175.8MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-19 07:38:57,632 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.22ms. Allocated memory is still 132.1MB. Free memory is still 104.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 882.49ms. Allocated memory is still 195.0MB. Free memory was 166.1MB in the beginning and 143.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.42ms. Allocated memory is still 195.0MB. Free memory was 143.0MB in the beginning and 140.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.48ms. Allocated memory is still 195.0MB. Free memory was 140.9MB in the beginning and 138.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 783.98ms. Allocated memory is still 195.0MB. Free memory was 138.8MB in the beginning and 133.1MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 13491.49ms. Allocated memory was 195.0MB in the beginning and 339.7MB in the end (delta: 144.7MB). Free memory was 132.1MB in the beginning and 185.3MB in the end (delta: -53.1MB). Peak memory consumption was 93.6MB. Max. memory is 16.1GB. * Witness Printer took 74.48ms. Allocated memory is still 339.7MB. Free memory was 185.3MB in the beginning and 175.8MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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 Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - 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 Unfinished Backtranslation: IdentifierExpression #t~pre9 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: 4.6s, 117 PlacesBefore, 32 PlacesAfterwards, 109 TransitionsBefore, 22 TransitionsAfterwards, 2206 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 101 TotalNumberOfCompositions, 4906 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2447, independent: 2282, independent conditional: 0, independent unconditional: 2282, dependent: 165, dependent conditional: 0, dependent unconditional: 165, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1207, independent: 1172, independent conditional: 0, independent unconditional: 1172, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2447, independent: 1110, independent conditional: 0, independent unconditional: 1110, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 1207, unknown conditional: 0, unknown unconditional: 1207] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 53, Positive conditional cache size: 0, Positive unconditional cache size: 53, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1897; [L832] FCALL, FORK 0 pthread_create(&t1897, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1897={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] [L833] 0 pthread_t t1898; [L834] FCALL, FORK 0 pthread_create(&t1898, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1897={5:0}, t1898={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] [L835] 0 pthread_t t1899; [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L836] FCALL, FORK 0 pthread_create(&t1899, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1897={5:0}, t1898={6:0}, t1899={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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L803] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L806] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L744] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L789] 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) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 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 [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 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 [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L809] 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) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 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 [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 2 return 0; [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897={5:0}, t1898={6:0}, t1899={3: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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 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) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 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 [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897={5:0}, t1898={6:0}, t1899={3: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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L849] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 836]: 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: 834]: 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: 832]: 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, 140 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: 13.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 447 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 368 mSDsluCounter, 79 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 755 IncrementalHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 27 mSDtfsCounter, 755 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred in iteration=10, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 152 NumberOfCodeBlocks, 152 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 122 ConstructedInterpolants, 0 QuantifiedInterpolants, 532 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:38:57,673 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29df63a-ff4f-4bee-a66c-d34d18bce9a7/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