./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix013.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_914a73cc-3f03-4ee7-a85b-8259bf07e1ad/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_914a73cc-3f03-4ee7-a85b-8259bf07e1ad/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_914a73cc-3f03-4ee7-a85b-8259bf07e1ad/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_914a73cc-3f03-4ee7-a85b-8259bf07e1ad/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix013.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_914a73cc-3f03-4ee7-a85b-8259bf07e1ad/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_914a73cc-3f03-4ee7-a85b-8259bf07e1ad/bin/uautomizer-verify-BQ2R08f2Ya --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 7d5aa429e9fa5fafdbda3a249edb2f84a5af4e6e0b36ce720714921f621bb137 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:24:57,119 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:24:57,197 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_914a73cc-3f03-4ee7-a85b-8259bf07e1ad/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 06:24:57,202 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:24:57,203 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:24:57,229 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:24:57,229 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:24:57,230 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:24:57,231 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:24:57,231 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:24:57,232 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:24:57,232 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:24:57,233 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:24:57,233 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:24:57,234 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:24:57,235 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:24:57,235 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 06:24:57,236 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:24:57,236 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:24:57,236 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:24:57,237 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:24:57,238 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 06:24:57,238 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:24:57,239 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 06:24:57,239 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:24:57,240 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 06:24:57,240 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:24:57,240 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:24:57,241 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:24:57,241 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:24:57,241 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:24:57,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:24:57,242 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:24:57,243 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:24:57,243 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 06:24:57,243 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 06:24:57,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 06:24:57,243 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:24:57,244 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:24:57,244 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 06:24:57,244 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:24:57,244 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:24:57,245 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_914a73cc-3f03-4ee7-a85b-8259bf07e1ad/bin/uautomizer-verify-BQ2R08f2Ya/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_914a73cc-3f03-4ee7-a85b-8259bf07e1ad/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 7d5aa429e9fa5fafdbda3a249edb2f84a5af4e6e0b36ce720714921f621bb137 [2023-11-29 06:24:57,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:24:57,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:24:57,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:24:57,511 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:24:57,511 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:24:57,512 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_914a73cc-3f03-4ee7-a85b-8259bf07e1ad/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix013.opt.i [2023-11-29 06:25:00,333 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:25:00,587 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:25:00,588 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_914a73cc-3f03-4ee7-a85b-8259bf07e1ad/sv-benchmarks/c/pthread-wmm/mix013.opt.i [2023-11-29 06:25:00,605 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_914a73cc-3f03-4ee7-a85b-8259bf07e1ad/bin/uautomizer-verify-BQ2R08f2Ya/data/29ca39c42/aa704afd964243ddb4586e3685e51165/FLAG760286dab [2023-11-29 06:25:00,619 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_914a73cc-3f03-4ee7-a85b-8259bf07e1ad/bin/uautomizer-verify-BQ2R08f2Ya/data/29ca39c42/aa704afd964243ddb4586e3685e51165 [2023-11-29 06:25:00,622 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:25:00,623 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:25:00,625 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:25:00,625 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:25:00,631 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:25:00,631 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:25:00" (1/1) ... [2023-11-29 06:25:00,633 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ef4dd71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:25:00, skipping insertion in model container [2023-11-29 06:25:00,633 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:25:00" (1/1) ... [2023-11-29 06:25:00,691 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:25:00,857 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_914a73cc-3f03-4ee7-a85b-8259bf07e1ad/sv-benchmarks/c/pthread-wmm/mix013.opt.i[944,957] [2023-11-29 06:25:01,021 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:25:01,032 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:25:01,041 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_914a73cc-3f03-4ee7-a85b-8259bf07e1ad/sv-benchmarks/c/pthread-wmm/mix013.opt.i[944,957] [2023-11-29 06:25:01,091 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:25:01,120 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:25:01,120 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:25:01,126 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:25:01,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:25:01 WrapperNode [2023-11-29 06:25:01,126 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:25:01,127 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:25:01,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:25:01,128 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:25:01,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:25:01" (1/1) ... [2023-11-29 06:25:01,152 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:25:01" (1/1) ... [2023-11-29 06:25:01,183 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 166 [2023-11-29 06:25:01,183 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:25:01,184 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:25:01,184 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:25:01,185 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:25:01,197 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:25:01" (1/1) ... [2023-11-29 06:25:01,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:25:01" (1/1) ... [2023-11-29 06:25:01,202 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:25:01" (1/1) ... [2023-11-29 06:25:01,221 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2023-11-29 06:25:01,221 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:25:01" (1/1) ... [2023-11-29 06:25:01,222 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:25:01" (1/1) ... [2023-11-29 06:25:01,233 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:25:01" (1/1) ... [2023-11-29 06:25:01,235 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:25:01" (1/1) ... [2023-11-29 06:25:01,238 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:25:01" (1/1) ... [2023-11-29 06:25:01,240 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:25:01" (1/1) ... [2023-11-29 06:25:01,245 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:25:01,246 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:25:01,247 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:25:01,247 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:25:01,248 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:25:01" (1/1) ... [2023-11-29 06:25:01,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:25:01,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_914a73cc-3f03-4ee7-a85b-8259bf07e1ad/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:25:01,274 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_914a73cc-3f03-4ee7-a85b-8259bf07e1ad/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:25:01,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_914a73cc-3f03-4ee7-a85b-8259bf07e1ad/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:25:01,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 06:25:01,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 06:25:01,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 06:25:01,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 06:25:01,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 06:25:01,310 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 06:25:01,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:25:01,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 06:25:01,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 06:25:01,311 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 06:25:01,311 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 06:25:01,311 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 06:25:01,312 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 06:25:01,312 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 06:25:01,312 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 06:25:01,312 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-29 06:25:01,312 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-29 06:25:01,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 06:25:01,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 06:25:01,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 06:25:01,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 06:25:01,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 06:25:01,313 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 06:25:01,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:25:01,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:25:01,315 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 06:25:01,462 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:25:01,464 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:25:01,777 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:25:02,006 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:25:02,006 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 06:25:02,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:25:02 BoogieIcfgContainer [2023-11-29 06:25:02,007 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:25:02,009 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:25:02,009 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:25:02,013 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:25:02,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:25:00" (1/3) ... [2023-11-29 06:25:02,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f3016df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:25:02, skipping insertion in model container [2023-11-29 06:25:02,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:25:01" (2/3) ... [2023-11-29 06:25:02,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f3016df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:25:02, skipping insertion in model container [2023-11-29 06:25:02,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:25:02" (3/3) ... [2023-11-29 06:25:02,015 INFO L112 eAbstractionObserver]: Analyzing ICFG mix013.opt.i [2023-11-29 06:25:02,024 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 06:25:02,035 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:25:02,035 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-29 06:25:02,035 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 06:25:02,087 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 06:25:02,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 116 flow [2023-11-29 06:25:02,154 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2023-11-29 06:25:02,155 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 06:25:02,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 100 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2023-11-29 06:25:02,160 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 50 transitions, 116 flow [2023-11-29 06:25:02,164 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 46 transitions, 104 flow [2023-11-29 06:25:02,174 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:25:02,180 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;@3ae328bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:25:02,180 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-29 06:25:02,192 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 06:25:02,192 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2023-11-29 06:25:02,192 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 06:25:02,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:25:02,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:25:02,194 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 06:25:02,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:25:02,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1455134095, now seen corresponding path program 1 times [2023-11-29 06:25:02,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:25:02,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774292553] [2023-11-29 06:25:02,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:25:02,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:25:02,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:25:02,651 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-29 06:25:02,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:25:02,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774292553] [2023-11-29 06:25:02,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774292553] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:25:02,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:25:02,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:25:02,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308680040] [2023-11-29 06:25:02,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:25:02,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:25:02,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:25:02,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:25:02,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:25:02,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 50 [2023-11-29 06:25:02,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:02,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:25:02,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 50 [2023-11-29 06:25:02,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:25:03,151 INFO L124 PetriNetUnfolderBase]: 879/1453 cut-off events. [2023-11-29 06:25:03,152 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 06:25:03,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2773 conditions, 1453 events. 879/1453 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 9107 event pairs, 267 based on Foata normal form. 60/1454 useless extension candidates. Maximal degree in co-relation 2761. Up to 1009 conditions per place. [2023-11-29 06:25:03,175 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 26 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2023-11-29 06:25:03,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 53 transitions, 178 flow [2023-11-29 06:25:03,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:25:03,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:25:03,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2023-11-29 06:25:03,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.76 [2023-11-29 06:25:03,189 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 114 transitions. [2023-11-29 06:25:03,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 114 transitions. [2023-11-29 06:25:03,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:25:03,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 114 transitions. [2023-11-29 06:25:03,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:03,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:03,199 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:03,201 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 114 transitions. [2023-11-29 06:25:03,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 53 transitions, 178 flow [2023-11-29 06:25:03,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 174 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 06:25:03,208 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 98 flow [2023-11-29 06:25:03,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2023-11-29 06:25:03,214 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2023-11-29 06:25:03,214 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 98 flow [2023-11-29 06:25:03,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:03,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:25:03,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:25:03,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 06:25:03,216 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 06:25:03,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:25:03,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1694679855, now seen corresponding path program 1 times [2023-11-29 06:25:03,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:25:03,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665570152] [2023-11-29 06:25:03,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:25:03,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:25:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:25:03,485 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-29 06:25:03,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:25:03,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665570152] [2023-11-29 06:25:03,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665570152] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:25:03,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:25:03,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:25:03,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075117916] [2023-11-29 06:25:03,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:25:03,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:25:03,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:25:03,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:25:03,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:25:03,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2023-11-29 06:25:03,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:03,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:25:03,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2023-11-29 06:25:03,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:25:04,381 INFO L124 PetriNetUnfolderBase]: 4037/6466 cut-off events. [2023-11-29 06:25:04,382 INFO L125 PetriNetUnfolderBase]: For 244/244 co-relation queries the response was YES. [2023-11-29 06:25:04,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12426 conditions, 6466 events. 4037/6466 cut-off events. For 244/244 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 45953 event pairs, 603 based on Foata normal form. 216/6459 useless extension candidates. Maximal degree in co-relation 12416. Up to 3225 conditions per place. [2023-11-29 06:25:04,452 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 46 selfloop transitions, 6 changer transitions 1/71 dead transitions. [2023-11-29 06:25:04,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 71 transitions, 270 flow [2023-11-29 06:25:04,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:25:04,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 06:25:04,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2023-11-29 06:25:04,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.715 [2023-11-29 06:25:04,456 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 143 transitions. [2023-11-29 06:25:04,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 143 transitions. [2023-11-29 06:25:04,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:25:04,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 143 transitions. [2023-11-29 06:25:04,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:04,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 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-29 06:25:04,460 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 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-29 06:25:04,460 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 4 states and 143 transitions. [2023-11-29 06:25:04,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 71 transitions, 270 flow [2023-11-29 06:25:04,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 71 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:25:04,464 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 136 flow [2023-11-29 06:25:04,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2023-11-29 06:25:04,465 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -1 predicate places. [2023-11-29 06:25:04,465 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 136 flow [2023-11-29 06:25:04,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:04,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:25:04,466 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:25:04,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 06:25:04,467 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 06:25:04,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:25:04,467 INFO L85 PathProgramCache]: Analyzing trace with hash -2123631225, now seen corresponding path program 1 times [2023-11-29 06:25:04,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:25:04,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253834958] [2023-11-29 06:25:04,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:25:04,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:25:04,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:25:04,675 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-29 06:25:04,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:25:04,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253834958] [2023-11-29 06:25:04,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253834958] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:25:04,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:25:04,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:25:04,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248483440] [2023-11-29 06:25:04,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:25:04,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:25:04,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:25:04,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:25:04,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:25:04,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2023-11-29 06:25:04,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:04,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:25:04,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2023-11-29 06:25:04,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:25:05,462 INFO L124 PetriNetUnfolderBase]: 3433/5500 cut-off events. [2023-11-29 06:25:05,463 INFO L125 PetriNetUnfolderBase]: For 1469/1477 co-relation queries the response was YES. [2023-11-29 06:25:05,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12506 conditions, 5500 events. 3433/5500 cut-off events. For 1469/1477 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 37703 event pairs, 213 based on Foata normal form. 210/5531 useless extension candidates. Maximal degree in co-relation 12494. Up to 2433 conditions per place. [2023-11-29 06:25:05,499 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 59 selfloop transitions, 10 changer transitions 1/88 dead transitions. [2023-11-29 06:25:05,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 88 transitions, 387 flow [2023-11-29 06:25:05,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:25:05,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 06:25:05,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2023-11-29 06:25:05,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.728 [2023-11-29 06:25:05,502 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 182 transitions. [2023-11-29 06:25:05,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 182 transitions. [2023-11-29 06:25:05,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:25:05,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 182 transitions. [2023-11-29 06:25:05,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:05,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:05,506 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:05,506 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 136 flow. Second operand 5 states and 182 transitions. [2023-11-29 06:25:05,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 88 transitions, 387 flow [2023-11-29 06:25:05,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 88 transitions, 376 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 06:25:05,511 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 188 flow [2023-11-29 06:25:05,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2023-11-29 06:25:05,512 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 3 predicate places. [2023-11-29 06:25:05,513 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 188 flow [2023-11-29 06:25:05,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:05,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:25:05,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:25:05,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 06:25:05,514 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 06:25:05,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:25:05,514 INFO L85 PathProgramCache]: Analyzing trace with hash 2002697718, now seen corresponding path program 1 times [2023-11-29 06:25:05,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:25:05,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762438764] [2023-11-29 06:25:05,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:25:05,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:25:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:25:05,744 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-29 06:25:05,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:25:05,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762438764] [2023-11-29 06:25:05,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762438764] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:25:05,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:25:05,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:25:05,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331501984] [2023-11-29 06:25:05,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:25:05,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:25:05,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:25:05,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:25:05,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:25:05,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2023-11-29 06:25:05,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:05,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:25:05,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2023-11-29 06:25:05,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:25:06,464 INFO L124 PetriNetUnfolderBase]: 2355/3706 cut-off events. [2023-11-29 06:25:06,464 INFO L125 PetriNetUnfolderBase]: For 3008/3024 co-relation queries the response was YES. [2023-11-29 06:25:06,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9624 conditions, 3706 events. 2355/3706 cut-off events. For 3008/3024 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 21952 event pairs, 81 based on Foata normal form. 168/3779 useless extension candidates. Maximal degree in co-relation 9610. Up to 1089 conditions per place. [2023-11-29 06:25:06,497 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 70 selfloop transitions, 14 changer transitions 1/103 dead transitions. [2023-11-29 06:25:06,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 103 transitions, 510 flow [2023-11-29 06:25:06,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:25:06,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 06:25:06,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 219 transitions. [2023-11-29 06:25:06,499 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.73 [2023-11-29 06:25:06,499 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 219 transitions. [2023-11-29 06:25:06,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 219 transitions. [2023-11-29 06:25:06,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:25:06,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 219 transitions. [2023-11-29 06:25:06,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 36.5) internal successors, (219), 6 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:06,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:06,504 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:06,504 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 188 flow. Second operand 6 states and 219 transitions. [2023-11-29 06:25:06,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 103 transitions, 510 flow [2023-11-29 06:25:06,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 103 transitions, 480 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 06:25:06,517 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 238 flow [2023-11-29 06:25:06,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2023-11-29 06:25:06,518 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2023-11-29 06:25:06,518 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 238 flow [2023-11-29 06:25:06,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:06,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:25:06,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:25:06,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 06:25:06,520 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 06:25:06,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:25:06,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1859506695, now seen corresponding path program 1 times [2023-11-29 06:25:06,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:25:06,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496202228] [2023-11-29 06:25:06,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:25:06,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:25:06,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:25:06,803 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-29 06:25:06,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:25:06,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496202228] [2023-11-29 06:25:06,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496202228] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:25:06,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:25:06,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:25:06,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529552368] [2023-11-29 06:25:06,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:25:06,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:25:06,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:25:06,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:25:06,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:25:06,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2023-11-29 06:25:06,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 238 flow. Second operand has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:06,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:25:06,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2023-11-29 06:25:06,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:25:07,292 INFO L124 PetriNetUnfolderBase]: 1527/2282 cut-off events. [2023-11-29 06:25:07,293 INFO L125 PetriNetUnfolderBase]: For 3374/3390 co-relation queries the response was YES. [2023-11-29 06:25:07,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6769 conditions, 2282 events. 1527/2282 cut-off events. For 3374/3390 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 11297 event pairs, 47 based on Foata normal form. 84/2335 useless extension candidates. Maximal degree in co-relation 6754. Up to 768 conditions per place. [2023-11-29 06:25:07,312 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 63 selfloop transitions, 18 changer transitions 1/100 dead transitions. [2023-11-29 06:25:07,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 100 transitions, 508 flow [2023-11-29 06:25:07,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:25:07,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 06:25:07,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 238 transitions. [2023-11-29 06:25:07,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.68 [2023-11-29 06:25:07,314 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 238 transitions. [2023-11-29 06:25:07,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 238 transitions. [2023-11-29 06:25:07,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:25:07,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 238 transitions. [2023-11-29 06:25:07,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:07,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:07,318 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:07,318 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 238 flow. Second operand 7 states and 238 transitions. [2023-11-29 06:25:07,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 100 transitions, 508 flow [2023-11-29 06:25:07,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 100 transitions, 462 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-29 06:25:07,342 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 248 flow [2023-11-29 06:25:07,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=248, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2023-11-29 06:25:07,343 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2023-11-29 06:25:07,344 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 248 flow [2023-11-29 06:25:07,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:07,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:25:07,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:25:07,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 06:25:07,345 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 06:25:07,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:25:07,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1023709283, now seen corresponding path program 1 times [2023-11-29 06:25:07,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:25:07,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401957150] [2023-11-29 06:25:07,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:25:07,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:25:07,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:25:07,718 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-29 06:25:07,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:25:07,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401957150] [2023-11-29 06:25:07,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401957150] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:25:07,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:25:07,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:25:07,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781257160] [2023-11-29 06:25:07,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:25:07,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:25:07,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:25:07,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:25:07,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:25:07,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 50 [2023-11-29 06:25:07,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 248 flow. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:07,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:25:07,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 50 [2023-11-29 06:25:07,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:25:08,397 INFO L124 PetriNetUnfolderBase]: 2148/3943 cut-off events. [2023-11-29 06:25:08,397 INFO L125 PetriNetUnfolderBase]: For 2033/2125 co-relation queries the response was YES. [2023-11-29 06:25:08,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8961 conditions, 3943 events. 2148/3943 cut-off events. For 2033/2125 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 27389 event pairs, 605 based on Foata normal form. 16/3723 useless extension candidates. Maximal degree in co-relation 8945. Up to 1370 conditions per place. [2023-11-29 06:25:08,431 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 48 selfloop transitions, 2 changer transitions 12/93 dead transitions. [2023-11-29 06:25:08,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 93 transitions, 466 flow [2023-11-29 06:25:08,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:25:08,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 06:25:08,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 201 transitions. [2023-11-29 06:25:08,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.67 [2023-11-29 06:25:08,433 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 201 transitions. [2023-11-29 06:25:08,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 201 transitions. [2023-11-29 06:25:08,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:25:08,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 201 transitions. [2023-11-29 06:25:08,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 33.5) internal successors, (201), 6 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:08,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:08,436 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:08,436 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 248 flow. Second operand 6 states and 201 transitions. [2023-11-29 06:25:08,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 93 transitions, 466 flow [2023-11-29 06:25:08,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 93 transitions, 360 flow, removed 22 selfloop flow, removed 10 redundant places. [2023-11-29 06:25:08,465 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 169 flow [2023-11-29 06:25:08,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=169, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2023-11-29 06:25:08,466 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 8 predicate places. [2023-11-29 06:25:08,467 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 169 flow [2023-11-29 06:25:08,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:08,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:25:08,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:25:08,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 06:25:08,468 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 06:25:08,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:25:08,468 INFO L85 PathProgramCache]: Analyzing trace with hash -786866989, now seen corresponding path program 2 times [2023-11-29 06:25:08,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:25:08,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86151448] [2023-11-29 06:25:08,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:25:08,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:25:08,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:25:09,947 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-29 06:25:09,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:25:09,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86151448] [2023-11-29 06:25:09,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86151448] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:25:09,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:25:09,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 06:25:09,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841855058] [2023-11-29 06:25:09,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:25:09,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 06:25:09,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:25:09,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 06:25:09,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-29 06:25:09,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 50 [2023-11-29 06:25:09,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 169 flow. Second operand has 11 states, 11 states have (on average 24.818181818181817) internal successors, (273), 11 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:09,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:25:09,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 50 [2023-11-29 06:25:09,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:25:11,444 INFO L124 PetriNetUnfolderBase]: 5945/10256 cut-off events. [2023-11-29 06:25:11,444 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-29 06:25:11,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20266 conditions, 10256 events. 5945/10256 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 783. Compared 81505 event pairs, 812 based on Foata normal form. 32/9632 useless extension candidates. Maximal degree in co-relation 20252. Up to 2372 conditions per place. [2023-11-29 06:25:11,503 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 51 selfloop transitions, 12 changer transitions 59/154 dead transitions. [2023-11-29 06:25:11,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 154 transitions, 627 flow [2023-11-29 06:25:11,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 06:25:11,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-29 06:25:11,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 492 transitions. [2023-11-29 06:25:11,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.615 [2023-11-29 06:25:11,509 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 492 transitions. [2023-11-29 06:25:11,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 492 transitions. [2023-11-29 06:25:11,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:25:11,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 492 transitions. [2023-11-29 06:25:11,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 30.75) internal successors, (492), 16 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:11,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 50.0) internal successors, (850), 17 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:11,514 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 50.0) internal successors, (850), 17 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:11,514 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 169 flow. Second operand 16 states and 492 transitions. [2023-11-29 06:25:11,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 154 transitions, 627 flow [2023-11-29 06:25:11,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 154 transitions, 614 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-11-29 06:25:11,521 INFO L231 Difference]: Finished difference. Result has 88 places, 67 transitions, 261 flow [2023-11-29 06:25:11,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=261, PETRI_PLACES=88, PETRI_TRANSITIONS=67} [2023-11-29 06:25:11,521 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 30 predicate places. [2023-11-29 06:25:11,522 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 67 transitions, 261 flow [2023-11-29 06:25:11,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 24.818181818181817) internal successors, (273), 11 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:11,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:25:11,522 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:25:11,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 06:25:11,523 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 06:25:11,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:25:11,523 INFO L85 PathProgramCache]: Analyzing trace with hash -623814675, now seen corresponding path program 3 times [2023-11-29 06:25:11,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:25:11,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779163409] [2023-11-29 06:25:11,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:25:11,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:25:11,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:25:11,811 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-29 06:25:11,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:25:11,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779163409] [2023-11-29 06:25:11,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779163409] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:25:11,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:25:11,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:25:11,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968790142] [2023-11-29 06:25:11,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:25:11,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:25:11,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:25:11,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:25:11,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:25:11,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2023-11-29 06:25:11,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 67 transitions, 261 flow. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:11,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:25:11,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2023-11-29 06:25:11,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:25:13,886 INFO L124 PetriNetUnfolderBase]: 11256/18708 cut-off events. [2023-11-29 06:25:13,886 INFO L125 PetriNetUnfolderBase]: For 9066/9073 co-relation queries the response was YES. [2023-11-29 06:25:13,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44722 conditions, 18708 events. 11256/18708 cut-off events. For 9066/9073 co-relation queries the response was YES. Maximal size of possible extension queue 1334. Compared 152104 event pairs, 2904 based on Foata normal form. 33/17591 useless extension candidates. Maximal degree in co-relation 44697. Up to 9988 conditions per place. [2023-11-29 06:25:13,980 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 84 selfloop transitions, 20 changer transitions 15/148 dead transitions. [2023-11-29 06:25:13,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 148 transitions, 819 flow [2023-11-29 06:25:13,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:25:13,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 06:25:13,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 225 transitions. [2023-11-29 06:25:13,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2023-11-29 06:25:13,982 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 225 transitions. [2023-11-29 06:25:13,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 225 transitions. [2023-11-29 06:25:13,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:25:13,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 225 transitions. [2023-11-29 06:25:13,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 32.142857142857146) internal successors, (225), 7 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:13,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:13,984 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:13,984 INFO L175 Difference]: Start difference. First operand has 88 places, 67 transitions, 261 flow. Second operand 7 states and 225 transitions. [2023-11-29 06:25:13,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 148 transitions, 819 flow [2023-11-29 06:25:14,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 148 transitions, 803 flow, removed 8 selfloop flow, removed 5 redundant places. [2023-11-29 06:25:14,087 INFO L231 Difference]: Finished difference. Result has 87 places, 85 transitions, 454 flow [2023-11-29 06:25:14,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=454, PETRI_PLACES=87, PETRI_TRANSITIONS=85} [2023-11-29 06:25:14,088 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 29 predicate places. [2023-11-29 06:25:14,089 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 85 transitions, 454 flow [2023-11-29 06:25:14,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:14,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:25:14,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:25:14,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 06:25:14,090 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 06:25:14,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:25:14,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1585642581, now seen corresponding path program 4 times [2023-11-29 06:25:14,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:25:14,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81482560] [2023-11-29 06:25:14,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:25:14,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:25:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:25:14,447 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-29 06:25:14,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:25:14,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81482560] [2023-11-29 06:25:14,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81482560] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:25:14,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:25:14,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:25:14,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033483092] [2023-11-29 06:25:14,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:25:14,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:25:14,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:25:14,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:25:14,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:25:14,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2023-11-29 06:25:14,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 85 transitions, 454 flow. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:14,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:25:14,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2023-11-29 06:25:14,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:25:17,173 INFO L124 PetriNetUnfolderBase]: 13478/22702 cut-off events. [2023-11-29 06:25:17,173 INFO L125 PetriNetUnfolderBase]: For 23770/23851 co-relation queries the response was YES. [2023-11-29 06:25:17,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62013 conditions, 22702 events. 13478/22702 cut-off events. For 23770/23851 co-relation queries the response was YES. Maximal size of possible extension queue 1652. Compared 193259 event pairs, 2553 based on Foata normal form. 73/21433 useless extension candidates. Maximal degree in co-relation 61986. Up to 12639 conditions per place. [2023-11-29 06:25:17,331 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 73 selfloop transitions, 25 changer transitions 22/149 dead transitions. [2023-11-29 06:25:17,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 149 transitions, 1007 flow [2023-11-29 06:25:17,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:25:17,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 06:25:17,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 219 transitions. [2023-11-29 06:25:17,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6257142857142857 [2023-11-29 06:25:17,333 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 219 transitions. [2023-11-29 06:25:17,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 219 transitions. [2023-11-29 06:25:17,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:25:17,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 219 transitions. [2023-11-29 06:25:17,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 31.285714285714285) internal successors, (219), 7 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:17,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:17,336 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:17,336 INFO L175 Difference]: Start difference. First operand has 87 places, 85 transitions, 454 flow. Second operand 7 states and 219 transitions. [2023-11-29 06:25:17,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 149 transitions, 1007 flow [2023-11-29 06:25:17,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 149 transitions, 1001 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-29 06:25:17,473 INFO L231 Difference]: Finished difference. Result has 94 places, 96 transitions, 670 flow [2023-11-29 06:25:17,473 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=670, PETRI_PLACES=94, PETRI_TRANSITIONS=96} [2023-11-29 06:25:17,474 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 36 predicate places. [2023-11-29 06:25:17,474 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 96 transitions, 670 flow [2023-11-29 06:25:17,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:17,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:25:17,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:25:17,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 06:25:17,475 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 06:25:17,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:25:17,476 INFO L85 PathProgramCache]: Analyzing trace with hash -398019593, now seen corresponding path program 5 times [2023-11-29 06:25:17,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:25:17,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874685210] [2023-11-29 06:25:17,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:25:17,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:25:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:25:17,785 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-29 06:25:17,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:25:17,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874685210] [2023-11-29 06:25:17,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874685210] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:25:17,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:25:17,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 06:25:17,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249320133] [2023-11-29 06:25:17,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:25:17,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:25:17,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:25:17,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:25:17,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:25:17,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2023-11-29 06:25:17,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 96 transitions, 670 flow. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:17,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:25:17,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2023-11-29 06:25:17,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:25:20,155 INFO L124 PetriNetUnfolderBase]: 12129/20750 cut-off events. [2023-11-29 06:25:20,155 INFO L125 PetriNetUnfolderBase]: For 39625/39793 co-relation queries the response was YES. [2023-11-29 06:25:20,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60868 conditions, 20750 events. 12129/20750 cut-off events. For 39625/39793 co-relation queries the response was YES. Maximal size of possible extension queue 1512. Compared 178336 event pairs, 3250 based on Foata normal form. 61/19548 useless extension candidates. Maximal degree in co-relation 60836. Up to 8277 conditions per place. [2023-11-29 06:25:20,254 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 30 selfloop transitions, 4 changer transitions 99/162 dead transitions. [2023-11-29 06:25:20,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 162 transitions, 1305 flow [2023-11-29 06:25:20,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 06:25:20,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 06:25:20,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 242 transitions. [2023-11-29 06:25:20,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.605 [2023-11-29 06:25:20,256 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 242 transitions. [2023-11-29 06:25:20,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 242 transitions. [2023-11-29 06:25:20,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:25:20,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 242 transitions. [2023-11-29 06:25:20,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 30.25) internal successors, (242), 8 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-29 06:25:20,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 50.0) internal successors, (450), 9 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:20,259 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 50.0) internal successors, (450), 9 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:20,260 INFO L175 Difference]: Start difference. First operand has 94 places, 96 transitions, 670 flow. Second operand 8 states and 242 transitions. [2023-11-29 06:25:20,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 162 transitions, 1305 flow [2023-11-29 06:25:20,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 162 transitions, 1283 flow, removed 9 selfloop flow, removed 3 redundant places. [2023-11-29 06:25:20,393 INFO L231 Difference]: Finished difference. Result has 99 places, 59 transitions, 283 flow [2023-11-29 06:25:20,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=283, PETRI_PLACES=99, PETRI_TRANSITIONS=59} [2023-11-29 06:25:20,394 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 41 predicate places. [2023-11-29 06:25:20,394 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 59 transitions, 283 flow [2023-11-29 06:25:20,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:20,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:25:20,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:25:20,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 06:25:20,395 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 06:25:20,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:25:20,395 INFO L85 PathProgramCache]: Analyzing trace with hash -125665327, now seen corresponding path program 6 times [2023-11-29 06:25:20,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:25:20,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933590785] [2023-11-29 06:25:20,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:25:20,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:25:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:25:21,763 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-29 06:25:21,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:25:21,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933590785] [2023-11-29 06:25:21,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933590785] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:25:21,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:25:21,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 06:25:21,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861789795] [2023-11-29 06:25:21,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:25:21,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 06:25:21,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:25:21,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 06:25:21,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:25:21,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 50 [2023-11-29 06:25:21,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 59 transitions, 283 flow. Second operand has 9 states, 9 states have (on average 27.0) internal successors, (243), 9 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:21,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:25:21,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 50 [2023-11-29 06:25:21,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:25:22,575 INFO L124 PetriNetUnfolderBase]: 2060/3778 cut-off events. [2023-11-29 06:25:22,575 INFO L125 PetriNetUnfolderBase]: For 3972/4018 co-relation queries the response was YES. [2023-11-29 06:25:22,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9162 conditions, 3778 events. 2060/3778 cut-off events. For 3972/4018 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 26120 event pairs, 480 based on Foata normal form. 16/3381 useless extension candidates. Maximal degree in co-relation 9128. Up to 1017 conditions per place. [2023-11-29 06:25:22,595 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 33 selfloop transitions, 8 changer transitions 16/92 dead transitions. [2023-11-29 06:25:22,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 92 transitions, 491 flow [2023-11-29 06:25:22,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 06:25:22,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 06:25:22,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 305 transitions. [2023-11-29 06:25:22,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.61 [2023-11-29 06:25:22,598 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 305 transitions. [2023-11-29 06:25:22,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 305 transitions. [2023-11-29 06:25:22,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:25:22,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 305 transitions. [2023-11-29 06:25:22,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 30.5) internal successors, (305), 10 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:22,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 50.0) internal successors, (550), 11 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:22,602 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 50.0) internal successors, (550), 11 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:22,602 INFO L175 Difference]: Start difference. First operand has 99 places, 59 transitions, 283 flow. Second operand 10 states and 305 transitions. [2023-11-29 06:25:22,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 92 transitions, 491 flow [2023-11-29 06:25:22,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 92 transitions, 426 flow, removed 24 selfloop flow, removed 14 redundant places. [2023-11-29 06:25:22,614 INFO L231 Difference]: Finished difference. Result has 86 places, 61 transitions, 278 flow [2023-11-29 06:25:22,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=278, PETRI_PLACES=86, PETRI_TRANSITIONS=61} [2023-11-29 06:25:22,615 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 28 predicate places. [2023-11-29 06:25:22,615 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 61 transitions, 278 flow [2023-11-29 06:25:22,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.0) internal successors, (243), 9 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:25:22,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:25:22,616 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:25:22,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 06:25:22,616 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 06:25:22,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:25:22,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1078373377, now seen corresponding path program 7 times [2023-11-29 06:25:22,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:25:22,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364491375] [2023-11-29 06:25:22,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:25:22,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:25:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:25:22,677 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:25:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:25:22,762 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:25:22,762 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 06:25:22,763 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-29 06:25:22,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-29 06:25:22,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-29 06:25:22,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-29 06:25:22,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-29 06:25:22,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-29 06:25:22,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-29 06:25:22,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 06:25:22,766 INFO L445 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1] [2023-11-29 06:25:22,773 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 06:25:22,773 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 06:25:22,849 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 06:25:22,852 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 06:25:22,853 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 06:25:22,854 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre13 could not be translated [2023-11-29 06:25:22,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 06:25:22 BasicIcfg [2023-11-29 06:25:22,888 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 06:25:22,888 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 06:25:22,888 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 06:25:22,889 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 06:25:22,889 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:25:02" (3/4) ... [2023-11-29 06:25:22,890 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-29 06:25:22,931 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 06:25:22,932 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 06:25:22,933 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 06:25:22,934 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre13 could not be translated [2023-11-29 06:25:23,013 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_914a73cc-3f03-4ee7-a85b-8259bf07e1ad/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 06:25:23,014 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 06:25:23,014 INFO L158 Benchmark]: Toolchain (without parser) took 22390.97ms. Allocated memory was 180.4MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 143.7MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2023-11-29 06:25:23,015 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 121.6MB. Free memory is still 89.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:25:23,015 INFO L158 Benchmark]: CACSL2BoogieTranslator took 501.99ms. Allocated memory is still 180.4MB. Free memory was 143.7MB in the beginning and 131.2MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 06:25:23,015 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.07ms. Allocated memory is still 180.4MB. Free memory was 130.7MB in the beginning and 128.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 06:25:23,016 INFO L158 Benchmark]: Boogie Preprocessor took 61.52ms. Allocated memory is still 180.4MB. Free memory was 128.0MB in the beginning and 124.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 06:25:23,016 INFO L158 Benchmark]: RCFGBuilder took 760.55ms. Allocated memory is still 180.4MB. Free memory was 124.4MB in the beginning and 134.8MB in the end (delta: -10.4MB). Peak memory consumption was 48.5MB. Max. memory is 16.1GB. [2023-11-29 06:25:23,016 INFO L158 Benchmark]: TraceAbstraction took 20878.52ms. Allocated memory was 180.4MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 133.9MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2023-11-29 06:25:23,017 INFO L158 Benchmark]: Witness Printer took 125.46ms. Allocated memory is still 2.6GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 06:25:23,019 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.17ms. Allocated memory is still 121.6MB. Free memory is still 89.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 501.99ms. Allocated memory is still 180.4MB. Free memory was 143.7MB in the beginning and 131.2MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.07ms. Allocated memory is still 180.4MB. Free memory was 130.7MB in the beginning and 128.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.52ms. Allocated memory is still 180.4MB. Free memory was 128.0MB in the beginning and 124.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 760.55ms. Allocated memory is still 180.4MB. Free memory was 124.4MB in the beginning and 134.8MB in the end (delta: -10.4MB). Peak memory consumption was 48.5MB. Max. memory is 16.1GB. * TraceAbstraction took 20878.52ms. Allocated memory was 180.4MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 133.9MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 125.46ms. Allocated memory is still 2.6GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre13 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre13 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int __unbuffered_p2_EAX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L871] 0 pthread_t t325; [L872] FCALL, FORK 0 pthread_create(&t325, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t325={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L873] 0 pthread_t t326; [L874] FCALL, FORK 0 pthread_create(&t326, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t325={5:0}, t326={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L875] 0 pthread_t t327; [L876] FCALL, FORK 0 pthread_create(&t327, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t325={5:0}, t326={6:0}, t327={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L877] 0 pthread_t t328; [L878] FCALL, FORK 0 pthread_create(&t328, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t325={5:0}, t326={6:0}, t327={7:0}, t328={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L817] 4 z$w_buff1 = z$w_buff0 [L818] 4 z$w_buff0 = 1 [L819] 4 z$w_buff1_used = z$w_buff0_used [L820] 4 z$w_buff0_used = (_Bool)1 [L821] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L821] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L822] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L823] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L824] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L825] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L826] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 z$flush_delayed = weak$$choice2 [L833] 4 z$mem_tmp = z [L834] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L835] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L836] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L837] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L838] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L840] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EAX = z [L842] 4 z = z$flush_delayed ? z$mem_tmp : z [L843] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L846] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L789] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 z$flush_delayed = weak$$choice2 [L795] 3 z$mem_tmp = z [L796] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L797] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L798] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L799] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L800] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L802] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EAX = z [L804] 3 z = z$flush_delayed ? z$mem_tmp : z [L805] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L849] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L850] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L851] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L852] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L853] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L782] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t325={5:0}, t326={6:0}, t327={7:0}, t328={3:0}, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L885] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L886] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L887] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L888] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t325={5:0}, t326={6:0}, t327={7:0}, t328={3:0}, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L891] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t325={5:0}, t326={6:0}, t327={7:0}, t328={3:0}, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 85 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 14.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 782 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 718 mSDsluCounter, 375 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 322 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2172 IncrementalHoareTripleChecker+Invalid, 2216 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 53 mSDtfsCounter, 2172 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=670occurred in iteration=9, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 371 NumberOfCodeBlocks, 371 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 322 ConstructedInterpolants, 0 QuantifiedInterpolants, 2354 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-29 06:25:23,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_914a73cc-3f03-4ee7-a85b-8259bf07e1ad/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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