./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe033_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 cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6de85db4-866b-426c-973f-e63faf504bce/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6de85db4-866b-426c-973f-e63faf504bce/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6de85db4-866b-426c-973f-e63faf504bce/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6de85db4-866b-426c-973f-e63faf504bce/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6de85db4-866b-426c-973f-e63faf504bce/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6de85db4-866b-426c-973f-e63faf504bce/bin/uautomizer-verify-uTZkv6EMXl --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 48c4b734419752ee9918164f01e542b34e2482d2668432fb42f6f1192b7f0b6a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:15:48,182 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:15:48,255 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6de85db4-866b-426c-973f-e63faf504bce/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:15:48,261 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:15:48,262 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:15:48,296 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:15:48,297 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:15:48,298 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:15:48,299 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:15:48,304 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:15:48,305 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:15:48,306 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:15:48,307 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:15:48,308 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:15:48,309 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:15:48,309 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:15:48,310 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:15:48,310 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:15:48,311 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:15:48,311 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:15:48,312 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:15:48,312 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:15:48,313 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:15:48,313 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:15:48,314 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:15:48,315 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:15:48,315 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:15:48,316 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:15:48,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:15:48,317 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:15:48,318 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:15:48,318 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:15:48,319 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:15:48,319 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:15:48,319 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:15:48,319 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:15:48,320 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:15:48,320 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:15:48,320 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:15:48,320 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_6de85db4-866b-426c-973f-e63faf504bce/bin/uautomizer-verify-uTZkv6EMXl/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_6de85db4-866b-426c-973f-e63faf504bce/bin/uautomizer-verify-uTZkv6EMXl 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 -> 48c4b734419752ee9918164f01e542b34e2482d2668432fb42f6f1192b7f0b6a [2023-11-12 02:15:48,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:15:48,681 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:15:48,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:15:48,686 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:15:48,686 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:15:48,687 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6de85db4-866b-426c-973f-e63faf504bce/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-12 02:15:51,776 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:15:52,152 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:15:52,152 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6de85db4-866b-426c-973f-e63faf504bce/sv-benchmarks/c/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-12 02:15:52,169 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6de85db4-866b-426c-973f-e63faf504bce/bin/uautomizer-verify-uTZkv6EMXl/data/455046422/9adaa0ce090248ac8479635671885ab0/FLAG41804880d [2023-11-12 02:15:52,184 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6de85db4-866b-426c-973f-e63faf504bce/bin/uautomizer-verify-uTZkv6EMXl/data/455046422/9adaa0ce090248ac8479635671885ab0 [2023-11-12 02:15:52,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:15:52,189 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:15:52,190 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:15:52,190 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:15:52,196 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:15:52,197 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:15:52" (1/1) ... [2023-11-12 02:15:52,198 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d7d99ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:52, skipping insertion in model container [2023-11-12 02:15:52,198 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:15:52" (1/1) ... [2023-11-12 02:15:52,248 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:15:52,455 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_6de85db4-866b-426c-973f-e63faf504bce/sv-benchmarks/c/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-11-12 02:15:52,751 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:15:52,766 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:15:52,784 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_6de85db4-866b-426c-973f-e63faf504bce/sv-benchmarks/c/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-11-12 02:15:52,868 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:15:52,921 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:15:52,922 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:15:52,930 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:15:52,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:52 WrapperNode [2023-11-12 02:15:52,931 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:15:52,932 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:15:52,933 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:15:52,934 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:15:52,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:52" (1/1) ... [2023-11-12 02:15:52,984 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:52" (1/1) ... [2023-11-12 02:15:53,029 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 111 [2023-11-12 02:15:53,031 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:15:53,031 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:15:53,032 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:15:53,032 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:15:53,042 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:52" (1/1) ... [2023-11-12 02:15:53,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:52" (1/1) ... [2023-11-12 02:15:53,056 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:52" (1/1) ... [2023-11-12 02:15:53,058 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:52" (1/1) ... [2023-11-12 02:15:53,071 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:52" (1/1) ... [2023-11-12 02:15:53,082 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:52" (1/1) ... [2023-11-12 02:15:53,084 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:52" (1/1) ... [2023-11-12 02:15:53,097 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:52" (1/1) ... [2023-11-12 02:15:53,100 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:15:53,101 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:15:53,102 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:15:53,102 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:15:53,103 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:52" (1/1) ... [2023-11-12 02:15:53,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:15:53,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6de85db4-866b-426c-973f-e63faf504bce/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:15:53,152 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6de85db4-866b-426c-973f-e63faf504bce/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:15:53,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6de85db4-866b-426c-973f-e63faf504bce/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:15:53,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:15:53,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-12 02:15:53,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:15:53,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:15:53,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:15:53,207 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-12 02:15:53,207 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-12 02:15:53,207 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-12 02:15:53,207 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-12 02:15:53,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:15:53,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-12 02:15:53,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:15:53,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:15:53,212 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-12 02:15:53,392 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:15:53,395 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:15:53,747 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:15:53,951 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:15:53,951 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-12 02:15:53,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:15:53 BoogieIcfgContainer [2023-11-12 02:15:53,956 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:15:53,959 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:15:53,959 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:15:53,963 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:15:53,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:15:52" (1/3) ... [2023-11-12 02:15:53,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38b8b967 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:15:53, skipping insertion in model container [2023-11-12 02:15:53,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:52" (2/3) ... [2023-11-12 02:15:53,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38b8b967 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:15:53, skipping insertion in model container [2023-11-12 02:15:53,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:15:53" (3/3) ... [2023-11-12 02:15:53,969 INFO L112 eAbstractionObserver]: Analyzing ICFG safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-12 02:15:53,980 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-12 02:15:53,992 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:15:53,993 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-12 02:15:53,993 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 02:15:54,051 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-12 02:15:54,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 186 flow [2023-11-12 02:15:54,197 INFO L124 PetriNetUnfolderBase]: 2/87 cut-off events. [2023-11-12 02:15:54,197 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:15:54,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 40 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2023-11-12 02:15:54,203 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 89 transitions, 186 flow [2023-11-12 02:15:54,210 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 87 transitions, 180 flow [2023-11-12 02:15:54,214 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-12 02:15:54,227 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 87 transitions, 180 flow [2023-11-12 02:15:54,229 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 87 transitions, 180 flow [2023-11-12 02:15:54,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 87 transitions, 180 flow [2023-11-12 02:15:54,256 INFO L124 PetriNetUnfolderBase]: 2/87 cut-off events. [2023-11-12 02:15:54,256 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:15:54,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 40 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2023-11-12 02:15:54,258 INFO L119 LiptonReduction]: Number of co-enabled transitions 1048 [2023-11-12 02:15:58,178 INFO L134 LiptonReduction]: Checked pairs total: 2476 [2023-11-12 02:15:58,178 INFO L136 LiptonReduction]: Total number of compositions: 83 [2023-11-12 02:15:58,195 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:15:58,203 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;@239c3de5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:15:58,203 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-12 02:15:58,209 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-12 02:15:58,209 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-11-12 02:15:58,210 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:15:58,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:15:58,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 02:15:58,211 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:15:58,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:58,217 INFO L85 PathProgramCache]: Analyzing trace with hash 384033578, now seen corresponding path program 1 times [2023-11-12 02:15:58,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:58,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710380504] [2023-11-12 02:15:58,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:58,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:58,768 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-12 02:15:58,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:15:58,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710380504] [2023-11-12 02:15:58,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710380504] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:15:58,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:15:58,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:15:58,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061566751] [2023-11-12 02:15:58,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:15:58,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:15:58,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:15:58,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:15:58,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:15:58,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 172 [2023-11-12 02:15:58,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:58,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:15:58,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 172 [2023-11-12 02:15:58,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:15:59,017 INFO L124 PetriNetUnfolderBase]: 111/220 cut-off events. [2023-11-12 02:15:59,017 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-12 02:15:59,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 220 events. 111/220 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 819 event pairs, 18 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 424. Up to 154 conditions per place. [2023-11-12 02:15:59,024 INFO L140 encePairwiseOnDemand]: 168/172 looper letters, 17 selfloop transitions, 2 changer transitions 2/22 dead transitions. [2023-11-12 02:15:59,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 22 transitions, 92 flow [2023-11-12 02:15:59,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:15:59,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:15:59,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 258 transitions. [2023-11-12 02:15:59,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-11-12 02:15:59,051 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 258 transitions. [2023-11-12 02:15:59,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 258 transitions. [2023-11-12 02:15:59,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:15:59,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 258 transitions. [2023-11-12 02:15:59,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:59,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:59,070 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:59,072 INFO L175 Difference]: Start difference. First operand has 23 places, 17 transitions, 40 flow. Second operand 3 states and 258 transitions. [2023-11-12 02:15:59,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 22 transitions, 92 flow [2023-11-12 02:15:59,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 22 transitions, 90 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:15:59,078 INFO L231 Difference]: Finished difference. Result has 22 places, 14 transitions, 36 flow [2023-11-12 02:15:59,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=36, PETRI_PLACES=22, PETRI_TRANSITIONS=14} [2023-11-12 02:15:59,085 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, -1 predicate places. [2023-11-12 02:15:59,086 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 14 transitions, 36 flow [2023-11-12 02:15:59,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:59,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:15:59,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:15:59,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:15:59,088 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:15:59,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:59,088 INFO L85 PathProgramCache]: Analyzing trace with hash -310862209, now seen corresponding path program 1 times [2023-11-12 02:15:59,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:59,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482647964] [2023-11-12 02:15:59,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:59,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:59,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:15:59,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:15:59,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482647964] [2023-11-12 02:15:59,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482647964] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:15:59,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:15:59,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:15:59,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125363421] [2023-11-12 02:15:59,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:15:59,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:15:59,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:15:59,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:15:59,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:15:59,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 172 [2023-11-12 02:15:59,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 14 transitions, 36 flow. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:59,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:15:59,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 172 [2023-11-12 02:15:59,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:15:59,541 INFO L124 PetriNetUnfolderBase]: 107/194 cut-off events. [2023-11-12 02:15:59,542 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-12 02:15:59,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 194 events. 107/194 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 619 event pairs, 41 based on Foata normal form. 2/196 useless extension candidates. Maximal degree in co-relation 407. Up to 184 conditions per place. [2023-11-12 02:15:59,546 INFO L140 encePairwiseOnDemand]: 168/172 looper letters, 18 selfloop transitions, 3 changer transitions 0/21 dead transitions. [2023-11-12 02:15:59,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 21 transitions, 96 flow [2023-11-12 02:15:59,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:15:59,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:15:59,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2023-11-12 02:15:59,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4844961240310077 [2023-11-12 02:15:59,551 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 250 transitions. [2023-11-12 02:15:59,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 250 transitions. [2023-11-12 02:15:59,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:15:59,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 250 transitions. [2023-11-12 02:15:59,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:59,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:59,560 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:59,561 INFO L175 Difference]: Start difference. First operand has 22 places, 14 transitions, 36 flow. Second operand 3 states and 250 transitions. [2023-11-12 02:15:59,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 21 transitions, 96 flow [2023-11-12 02:15:59,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 21 transitions, 90 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:15:59,562 INFO L231 Difference]: Finished difference. Result has 22 places, 16 transitions, 51 flow [2023-11-12 02:15:59,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=32, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=51, PETRI_PLACES=22, PETRI_TRANSITIONS=16} [2023-11-12 02:15:59,564 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, -1 predicate places. [2023-11-12 02:15:59,564 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 16 transitions, 51 flow [2023-11-12 02:15:59,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:59,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:15:59,564 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:15:59,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:15:59,565 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:15:59,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:59,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1046794665, now seen corresponding path program 1 times [2023-11-12 02:15:59,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:59,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750638360] [2023-11-12 02:15:59,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:59,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:59,737 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-12 02:15:59,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:15:59,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750638360] [2023-11-12 02:15:59,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750638360] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:15:59,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:15:59,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:15:59,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733348208] [2023-11-12 02:15:59,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:15:59,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:15:59,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:15:59,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:15:59,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:15:59,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 172 [2023-11-12 02:15:59,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 16 transitions, 51 flow. Second operand has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:59,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:15:59,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 172 [2023-11-12 02:15:59,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:15:59,921 INFO L124 PetriNetUnfolderBase]: 55/124 cut-off events. [2023-11-12 02:15:59,921 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-12 02:15:59,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 124 events. 55/124 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 399 event pairs, 11 based on Foata normal form. 19/142 useless extension candidates. Maximal degree in co-relation 282. Up to 57 conditions per place. [2023-11-12 02:15:59,926 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 19 selfloop transitions, 3 changer transitions 14/38 dead transitions. [2023-11-12 02:15:59,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 38 transitions, 178 flow [2023-11-12 02:15:59,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:15:59,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:15:59,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 391 transitions. [2023-11-12 02:15:59,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45465116279069767 [2023-11-12 02:15:59,930 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 391 transitions. [2023-11-12 02:15:59,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 391 transitions. [2023-11-12 02:15:59,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:15:59,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 391 transitions. [2023-11-12 02:15:59,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 78.2) internal successors, (391), 5 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:59,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:59,935 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:59,936 INFO L175 Difference]: Start difference. First operand has 22 places, 16 transitions, 51 flow. Second operand 5 states and 391 transitions. [2023-11-12 02:15:59,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 38 transitions, 178 flow [2023-11-12 02:15:59,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 38 transitions, 174 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-12 02:15:59,938 INFO L231 Difference]: Finished difference. Result has 28 places, 18 transitions, 75 flow [2023-11-12 02:15:59,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=75, PETRI_PLACES=28, PETRI_TRANSITIONS=18} [2023-11-12 02:15:59,939 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 5 predicate places. [2023-11-12 02:15:59,939 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 18 transitions, 75 flow [2023-11-12 02:15:59,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:59,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:15:59,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:15:59,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:15:59,940 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:15:59,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:59,941 INFO L85 PathProgramCache]: Analyzing trace with hash 631042991, now seen corresponding path program 1 times [2023-11-12 02:15:59,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:59,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212901157] [2023-11-12 02:15:59,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:59,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:00,154 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-12 02:16:00,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:00,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212901157] [2023-11-12 02:16:00,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212901157] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:00,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:00,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:16:00,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8569468] [2023-11-12 02:16:00,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:00,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:16:00,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:00,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:16:00,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:16:00,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 172 [2023-11-12 02:16:00,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 18 transitions, 75 flow. Second operand has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:00,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:16:00,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 172 [2023-11-12 02:16:00,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:16:00,269 INFO L124 PetriNetUnfolderBase]: 21/59 cut-off events. [2023-11-12 02:16:00,269 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-11-12 02:16:00,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 59 events. 21/59 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 125 event pairs, 7 based on Foata normal form. 7/66 useless extension candidates. Maximal degree in co-relation 165. Up to 25 conditions per place. [2023-11-12 02:16:00,270 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 17 selfloop transitions, 5 changer transitions 7/31 dead transitions. [2023-11-12 02:16:00,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 31 transitions, 175 flow [2023-11-12 02:16:00,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:16:00,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-12 02:16:00,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 456 transitions. [2023-11-12 02:16:00,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418604651162791 [2023-11-12 02:16:00,273 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 456 transitions. [2023-11-12 02:16:00,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 456 transitions. [2023-11-12 02:16:00,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:16:00,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 456 transitions. [2023-11-12 02:16:00,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 76.0) internal successors, (456), 6 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:00,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 172.0) internal successors, (1204), 7 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:00,279 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 172.0) internal successors, (1204), 7 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:00,280 INFO L175 Difference]: Start difference. First operand has 28 places, 18 transitions, 75 flow. Second operand 6 states and 456 transitions. [2023-11-12 02:16:00,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 31 transitions, 175 flow [2023-11-12 02:16:00,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 31 transitions, 160 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-11-12 02:16:00,282 INFO L231 Difference]: Finished difference. Result has 32 places, 18 transitions, 84 flow [2023-11-12 02:16:00,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=84, PETRI_PLACES=32, PETRI_TRANSITIONS=18} [2023-11-12 02:16:00,283 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 9 predicate places. [2023-11-12 02:16:00,284 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 18 transitions, 84 flow [2023-11-12 02:16:00,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:00,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:16:00,284 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:00,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:16:00,285 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:16:00,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:00,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1583624756, now seen corresponding path program 1 times [2023-11-12 02:16:00,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:00,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885155084] [2023-11-12 02:16:00,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:00,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:00,467 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-12 02:16:00,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:00,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885155084] [2023-11-12 02:16:00,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885155084] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:00,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:00,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:16:00,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846501244] [2023-11-12 02:16:00,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:00,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:16:00,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:00,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:16:00,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:16:00,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 172 [2023-11-12 02:16:00,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 18 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:00,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:16:00,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 172 [2023-11-12 02:16:00,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:16:00,544 INFO L124 PetriNetUnfolderBase]: 21/64 cut-off events. [2023-11-12 02:16:00,544 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2023-11-12 02:16:00,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 64 events. 21/64 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 149 event pairs, 9 based on Foata normal form. 1/65 useless extension candidates. Maximal degree in co-relation 191. Up to 45 conditions per place. [2023-11-12 02:16:00,545 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 16 selfloop transitions, 2 changer transitions 8/26 dead transitions. [2023-11-12 02:16:00,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 26 transitions, 182 flow [2023-11-12 02:16:00,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:16:00,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:16:00,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2023-11-12 02:16:00,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4844961240310077 [2023-11-12 02:16:00,548 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 250 transitions. [2023-11-12 02:16:00,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 250 transitions. [2023-11-12 02:16:00,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:16:00,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 250 transitions. [2023-11-12 02:16:00,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:00,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:00,552 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:00,552 INFO L175 Difference]: Start difference. First operand has 32 places, 18 transitions, 84 flow. Second operand 3 states and 250 transitions. [2023-11-12 02:16:00,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 26 transitions, 182 flow [2023-11-12 02:16:00,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 26 transitions, 152 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-11-12 02:16:00,555 INFO L231 Difference]: Finished difference. Result has 28 places, 16 transitions, 68 flow [2023-11-12 02:16:00,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=28, PETRI_TRANSITIONS=16} [2023-11-12 02:16:00,556 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 5 predicate places. [2023-11-12 02:16:00,556 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 16 transitions, 68 flow [2023-11-12 02:16:00,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:00,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:16:00,557 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:00,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:16:00,558 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:16:00,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:00,558 INFO L85 PathProgramCache]: Analyzing trace with hash -971840812, now seen corresponding path program 2 times [2023-11-12 02:16:00,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:00,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695711329] [2023-11-12 02:16:00,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:00,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:01,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:16:01,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:01,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695711329] [2023-11-12 02:16:01,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695711329] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:01,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:01,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:16:01,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500126456] [2023-11-12 02:16:01,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:01,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:16:01,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:01,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:16:01,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:16:01,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 172 [2023-11-12 02:16:01,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 16 transitions, 68 flow. Second operand has 6 states, 6 states have (on average 76.16666666666667) internal successors, (457), 6 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:01,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:16:01,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 172 [2023-11-12 02:16:01,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:16:01,291 INFO L124 PetriNetUnfolderBase]: 6/32 cut-off events. [2023-11-12 02:16:01,291 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-11-12 02:16:01,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 32 events. 6/32 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 44 event pairs, 1 based on Foata normal form. 1/33 useless extension candidates. Maximal degree in co-relation 95. Up to 12 conditions per place. [2023-11-12 02:16:01,292 INFO L140 encePairwiseOnDemand]: 166/172 looper letters, 12 selfloop transitions, 3 changer transitions 10/26 dead transitions. [2023-11-12 02:16:01,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 26 transitions, 163 flow [2023-11-12 02:16:01,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:16:01,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:16:01,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 540 transitions. [2023-11-12 02:16:01,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4485049833887043 [2023-11-12 02:16:01,295 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 540 transitions. [2023-11-12 02:16:01,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 540 transitions. [2023-11-12 02:16:01,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:16:01,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 540 transitions. [2023-11-12 02:16:01,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 77.14285714285714) internal successors, (540), 7 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:01,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 172.0) internal successors, (1376), 8 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:01,300 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 172.0) internal successors, (1376), 8 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:01,301 INFO L175 Difference]: Start difference. First operand has 28 places, 16 transitions, 68 flow. Second operand 7 states and 540 transitions. [2023-11-12 02:16:01,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 26 transitions, 163 flow [2023-11-12 02:16:01,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 26 transitions, 144 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-11-12 02:16:01,303 INFO L231 Difference]: Finished difference. Result has 32 places, 16 transitions, 68 flow [2023-11-12 02:16:01,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=68, PETRI_PLACES=32, PETRI_TRANSITIONS=16} [2023-11-12 02:16:01,304 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 9 predicate places. [2023-11-12 02:16:01,304 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 16 transitions, 68 flow [2023-11-12 02:16:01,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.16666666666667) internal successors, (457), 6 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:01,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:16:01,304 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:01,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:16:01,305 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:16:01,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:01,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1436497960, now seen corresponding path program 3 times [2023-11-12 02:16:01,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:01,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325313737] [2023-11-12 02:16:01,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:01,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:01,344 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:16:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:01,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:16:01,405 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 02:16:01,407 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-12 02:16:01,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-12 02:16:01,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-12 02:16:01,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-12 02:16:01,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-12 02:16:01,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:16:01,410 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2023-11-12 02:16:01,416 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-12 02:16:01,416 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:16:01,447 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-12 02:16:01,449 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-12 02:16:01,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:16:01 BasicIcfg [2023-11-12 02:16:01,470 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:16:01,471 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:16:01,471 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:16:01,471 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:16:01,472 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:15:53" (3/4) ... [2023-11-12 02:16:01,472 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-12 02:16:01,498 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-12 02:16:01,499 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-12 02:16:01,580 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6de85db4-866b-426c-973f-e63faf504bce/bin/uautomizer-verify-uTZkv6EMXl/witness.graphml [2023-11-12 02:16:01,580 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:16:01,581 INFO L158 Benchmark]: Toolchain (without parser) took 9392.37ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 126.3MB in the beginning and 103.7MB in the end (delta: 22.6MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. [2023-11-12 02:16:01,582 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 111.1MB. Free memory is still 62.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:16:01,582 INFO L158 Benchmark]: CACSL2BoogieTranslator took 741.37ms. Allocated memory is still 159.4MB. Free memory was 126.3MB in the beginning and 103.6MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-12 02:16:01,583 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.53ms. Allocated memory is still 159.4MB. Free memory was 103.6MB in the beginning and 101.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:16:01,583 INFO L158 Benchmark]: Boogie Preprocessor took 69.06ms. Allocated memory is still 159.4MB. Free memory was 101.2MB in the beginning and 99.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:16:01,583 INFO L158 Benchmark]: RCFGBuilder took 854.83ms. Allocated memory is still 159.4MB. Free memory was 99.4MB in the beginning and 122.5MB in the end (delta: -23.1MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2023-11-12 02:16:01,584 INFO L158 Benchmark]: TraceAbstraction took 7511.37ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 121.8MB in the beginning and 110.0MB in the end (delta: 11.8MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. [2023-11-12 02:16:01,584 INFO L158 Benchmark]: Witness Printer took 109.41ms. Allocated memory is still 192.9MB. Free memory was 110.0MB in the beginning and 103.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-12 02:16:01,586 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.34ms. Allocated memory is still 111.1MB. Free memory is still 62.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 741.37ms. Allocated memory is still 159.4MB. Free memory was 126.3MB in the beginning and 103.6MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.53ms. Allocated memory is still 159.4MB. Free memory was 103.6MB in the beginning and 101.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.06ms. Allocated memory is still 159.4MB. Free memory was 101.2MB in the beginning and 99.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 854.83ms. Allocated memory is still 159.4MB. Free memory was 99.4MB in the beginning and 122.5MB in the end (delta: -23.1MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. * TraceAbstraction took 7511.37ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 121.8MB in the beginning and 110.0MB in the end (delta: 11.8MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. * Witness Printer took 109.41ms. Allocated memory is still 192.9MB. Free memory was 110.0MB in the beginning and 103.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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 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 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: 3.9s, 92 PlacesBefore, 23 PlacesAfterwards, 87 TransitionsBefore, 17 TransitionsAfterwards, 1048 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 83 TotalNumberOfCompositions, 2476 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1066, independent: 943, independent conditional: 0, independent unconditional: 943, dependent: 123, dependent conditional: 0, dependent unconditional: 123, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 597, independent: 574, independent conditional: 0, independent unconditional: 574, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1066, independent: 369, independent conditional: 0, independent unconditional: 369, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 597, unknown conditional: 0, unknown unconditional: 597] , Statistics on independence cache: Total cache size (in pairs): 32, Positive cache size: 23, Positive conditional cache size: 0, Positive unconditional cache size: 23, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L716] 0 _Bool x$flush_delayed; [L717] 0 int x$mem_tmp; [L718] 0 _Bool x$r_buff0_thd0; [L719] 0 _Bool x$r_buff0_thd1; [L720] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff1_thd0; [L722] 0 _Bool x$r_buff1_thd1; [L723] 0 _Bool x$r_buff1_thd2; [L724] 0 _Bool x$read_delayed; [L725] 0 int *x$read_delayed_var; [L726] 0 int x$w_buff0; [L727] 0 _Bool x$w_buff0_used; [L728] 0 int x$w_buff1; [L729] 0 _Bool x$w_buff1_used; [L731] 0 int y = 0; [L732] 0 _Bool weak$$choice0; [L733] 0 _Bool weak$$choice2; [L803] 0 pthread_t t2561; [L804] FCALL, FORK 0 pthread_create(&t2561, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2561={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L805] 0 pthread_t t2562; [L806] FCALL, FORK 0 pthread_create(&t2562, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2561={5:0}, t2562={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L767] 2 x$w_buff1 = x$w_buff0 [L768] 2 x$w_buff0 = 1 [L769] 2 x$w_buff1_used = x$w_buff0_used [L770] 2 x$w_buff0_used = (_Bool)1 [L771] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L771] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L772] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L773] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L774] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L775] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L778] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L737] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 x$flush_delayed = weak$$choice2 [L745] 1 x$mem_tmp = x [L746] 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) [L747] 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)) [L748] 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)) [L749] 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)) [L750] 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)) [L751] 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)) [L752] 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)) [L753] 1 __unbuffered_p0_EAX = x [L754] 1 x = x$flush_delayed ? x$mem_tmp : x [L755] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L781] 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) [L782] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L783] 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 [L784] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L785] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 2 return 0; [L808] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L810] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L810] RET 0 assume_abort_if_not(main$tmp_guard0) [L812] 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) [L813] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L814] 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 [L815] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L816] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2561={5:0}, t2562={3:0}, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0) [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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: 806]: 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: 804]: 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 5 procedures, 106 locations, 5 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: 7.3s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 126 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 78 mSDsluCounter, 81 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 57 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 328 IncrementalHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 24 mSDtfsCounter, 328 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=4, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 52 ConstructedInterpolants, 0 QuantifiedInterpolants, 203 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-12 02:16:01,617 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6de85db4-866b-426c-973f-e63faf504bce/bin/uautomizer-verify-uTZkv6EMXl/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