./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a80043f7-8893-4c87-bf20-3b93010e9bde/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a80043f7-8893-4c87-bf20-3b93010e9bde/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a80043f7-8893-4c87-bf20-3b93010e9bde/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a80043f7-8893-4c87-bf20-3b93010e9bde/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a80043f7-8893-4c87-bf20-3b93010e9bde/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a80043f7-8893-4c87-bf20-3b93010e9bde/bin/uautomizer-verify-qhAvR1uOyd --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 c031a4ce44fce05276ee0c322906dbff86776176e55e116d257d2b83e85a253c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:29:46,055 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:29:46,142 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a80043f7-8893-4c87-bf20-3b93010e9bde/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 13:29:46,146 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:29:46,147 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:29:46,169 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:29:46,170 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:29:46,170 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:29:46,170 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:29:46,170 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:29:46,170 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:29:46,171 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:29:46,171 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:29:46,171 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:29:46,171 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:29:46,171 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:29:46,171 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:29:46,172 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:29:46,172 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:29:46,172 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:29:46,172 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:29:46,172 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:29:46,172 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:29:46,172 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:29:46,172 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:29:46,172 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:29:46,176 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:29:46,176 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:29:46,176 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:29:46,177 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:29:46,177 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:29:46,177 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:29:46,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:29:46,177 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:29:46,177 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:29:46,177 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:29:46,177 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:29:46,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:29:46,178 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:29:46,178 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:29:46,178 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:29:46,178 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:29:46,178 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_a80043f7-8893-4c87-bf20-3b93010e9bde/bin/uautomizer-verify-qhAvR1uOyd 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 -> c031a4ce44fce05276ee0c322906dbff86776176e55e116d257d2b83e85a253c [2024-11-13 13:29:46,490 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:29:46,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:29:46,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:29:46,504 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:29:46,505 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:29:46,506 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a80043f7-8893-4c87-bf20-3b93010e9bde/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c Unable to find full path for "g++" [2024-11-13 13:29:48,609 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:29:48,883 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:29:48,884 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a80043f7-8893-4c87-bf20-3b93010e9bde/sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c [2024-11-13 13:29:48,895 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a80043f7-8893-4c87-bf20-3b93010e9bde/bin/uautomizer-verify-qhAvR1uOyd/data/57ae2c67d/4c65f4563f0e4effbe28d48122c0774b/FLAG99a196aae [2024-11-13 13:29:48,920 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a80043f7-8893-4c87-bf20-3b93010e9bde/bin/uautomizer-verify-qhAvR1uOyd/data/57ae2c67d/4c65f4563f0e4effbe28d48122c0774b [2024-11-13 13:29:48,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:29:48,927 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:29:48,931 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:29:48,932 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:29:48,939 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:29:48,940 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:29:48" (1/1) ... [2024-11-13 13:29:48,944 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bcb96aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:29:48, skipping insertion in model container [2024-11-13 13:29:48,945 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:29:48" (1/1) ... [2024-11-13 13:29:48,980 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:29:49,279 WARN L250 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_a80043f7-8893-4c87-bf20-3b93010e9bde/sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c[4403,4416] [2024-11-13 13:29:49,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:29:49,318 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:29:49,375 WARN L250 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_a80043f7-8893-4c87-bf20-3b93010e9bde/sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c[4403,4416] [2024-11-13 13:29:49,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:29:49,415 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:29:49,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:29:49 WrapperNode [2024-11-13 13:29:49,416 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:29:49,418 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:29:49,419 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:29:49,419 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:29:49,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:29:49" (1/1) ... [2024-11-13 13:29:49,444 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:29:49" (1/1) ... [2024-11-13 13:29:49,497 INFO L138 Inliner]: procedures = 26, calls = 67, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 333 [2024-11-13 13:29:49,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:29:49,502 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:29:49,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:29:49,506 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:29:49,520 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:29:49" (1/1) ... [2024-11-13 13:29:49,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:29:49" (1/1) ... [2024-11-13 13:29:49,525 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:29:49" (1/1) ... [2024-11-13 13:29:49,555 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-11-13 13:29:49,556 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:29:49" (1/1) ... [2024-11-13 13:29:49,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:29:49" (1/1) ... [2024-11-13 13:29:49,580 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:29:49" (1/1) ... [2024-11-13 13:29:49,596 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:29:49" (1/1) ... [2024-11-13 13:29:49,599 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:29:49" (1/1) ... [2024-11-13 13:29:49,604 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:29:49" (1/1) ... [2024-11-13 13:29:49,611 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:29:49,613 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:29:49,616 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:29:49,616 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:29:49,618 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:29:49" (1/1) ... [2024-11-13 13:29:49,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:29:49,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a80043f7-8893-4c87-bf20-3b93010e9bde/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:29:49,673 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a80043f7-8893-4c87-bf20-3b93010e9bde/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:29:49,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a80043f7-8893-4c87-bf20-3b93010e9bde/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:29:49,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:29:49,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 13:29:49,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 13:29:49,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 13:29:49,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 13:29:49,718 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-13 13:29:49,718 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-13 13:29:49,718 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-13 13:29:49,718 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-13 13:29:49,719 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-13 13:29:49,719 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-13 13:29:49,719 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-13 13:29:49,719 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-13 13:29:49,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:29:49,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 13:29:49,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-13 13:29:49,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-13 13:29:49,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 13:29:49,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:29:49,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:29:49,723 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 13:29:49,970 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:29:49,972 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:29:50,776 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 13:29:50,776 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:29:51,388 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:29:51,390 INFO L316 CfgBuilder]: Removed 7 assume(true) statements. [2024-11-13 13:29:51,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:29:51 BoogieIcfgContainer [2024-11-13 13:29:51,390 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:29:51,395 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:29:51,395 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:29:51,437 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:29:51,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:29:48" (1/3) ... [2024-11-13 13:29:51,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54dd705c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:29:51, skipping insertion in model container [2024-11-13 13:29:51,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:29:49" (2/3) ... [2024-11-13 13:29:51,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54dd705c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:29:51, skipping insertion in model container [2024-11-13 13:29:51,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:29:51" (3/3) ... [2024-11-13 13:29:51,441 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series3.wvr.c [2024-11-13 13:29:51,462 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:29:51,464 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-series3.wvr.c that has 5 procedures, 46 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2024-11-13 13:29:51,464 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 13:29:51,578 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-13 13:29:51,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 52 transitions, 132 flow [2024-11-13 13:29:51,683 INFO L124 PetriNetUnfolderBase]: 7/48 cut-off events. [2024-11-13 13:29:51,685 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-13 13:29:51,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 48 events. 7/48 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 82 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2024-11-13 13:29:51,689 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 52 transitions, 132 flow [2024-11-13 13:29:51,699 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 47 transitions, 118 flow [2024-11-13 13:29:51,714 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:29:51,728 INFO L333 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, 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;@38cf5c20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:29:51,730 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-13 13:29:51,761 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 13:29:51,762 INFO L124 PetriNetUnfolderBase]: 7/46 cut-off events. [2024-11-13 13:29:51,762 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-13 13:29:51,763 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:29:51,763 INFO L204 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] [2024-11-13 13:29:51,764 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 13:29:51,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:29:51,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1369541980, now seen corresponding path program 1 times [2024-11-13 13:29:51,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:29:51,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247625705] [2024-11-13 13:29:51,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:29:51,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:29:51,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:52,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:29:52,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:29:52,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247625705] [2024-11-13 13:29:52,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247625705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:29:52,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:29:52,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:29:52,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786155273] [2024-11-13 13:29:52,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:29:52,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:29:52,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:29:52,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:29:52,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:29:52,354 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 52 [2024-11-13 13:29:52,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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) [2024-11-13 13:29:52,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:29:52,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 52 [2024-11-13 13:29:52,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:29:53,310 INFO L124 PetriNetUnfolderBase]: 2408/3712 cut-off events. [2024-11-13 13:29:53,310 INFO L125 PetriNetUnfolderBase]: For 205/205 co-relation queries the response was YES. [2024-11-13 13:29:53,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6983 conditions, 3712 events. 2408/3712 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 21258 event pairs, 472 based on Foata normal form. 1/3511 useless extension candidates. Maximal degree in co-relation 6291. Up to 2067 conditions per place. [2024-11-13 13:29:53,359 INFO L140 encePairwiseOnDemand]: 48/52 looper letters, 43 selfloop transitions, 3 changer transitions 1/64 dead transitions. [2024-11-13 13:29:53,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 64 transitions, 261 flow [2024-11-13 13:29:53,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:29:53,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 13:29:53,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2024-11-13 13:29:53,380 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7115384615384616 [2024-11-13 13:29:53,382 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 118 flow. Second operand 3 states and 111 transitions. [2024-11-13 13:29:53,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 64 transitions, 261 flow [2024-11-13 13:29:53,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 64 transitions, 235 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-13 13:29:53,401 INFO L231 Difference]: Finished difference. Result has 48 places, 49 transitions, 121 flow [2024-11-13 13:29:53,405 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=48, PETRI_TRANSITIONS=49} [2024-11-13 13:29:53,410 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2024-11-13 13:29:53,410 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 49 transitions, 121 flow [2024-11-13 13:29:53,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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) [2024-11-13 13:29:53,411 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:29:53,411 INFO L204 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] [2024-11-13 13:29:53,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:29:53,412 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 13:29:53,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:29:53,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1954021766, now seen corresponding path program 1 times [2024-11-13 13:29:53,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:29:53,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424959025] [2024-11-13 13:29:53,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:29:53,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:29:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:53,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:29:53,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:29:53,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424959025] [2024-11-13 13:29:53,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424959025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:29:53,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:29:53,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:29:53,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616994722] [2024-11-13 13:29:53,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:29:53,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:29:53,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:29:53,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:29:53,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:29:53,845 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 52 [2024-11-13 13:29:53,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 49 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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) [2024-11-13 13:29:53,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:29:53,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 52 [2024-11-13 13:29:53,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:29:54,563 INFO L124 PetriNetUnfolderBase]: 2669/4087 cut-off events. [2024-11-13 13:29:54,563 INFO L125 PetriNetUnfolderBase]: For 683/683 co-relation queries the response was YES. [2024-11-13 13:29:54,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8441 conditions, 4087 events. 2669/4087 cut-off events. For 683/683 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 24514 event pairs, 761 based on Foata normal form. 104/3956 useless extension candidates. Maximal degree in co-relation 3135. Up to 2321 conditions per place. [2024-11-13 13:29:54,599 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 52 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2024-11-13 13:29:54,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 71 transitions, 287 flow [2024-11-13 13:29:54,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:29:54,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 13:29:54,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2024-11-13 13:29:54,602 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7371794871794872 [2024-11-13 13:29:54,603 INFO L175 Difference]: Start difference. First operand has 48 places, 49 transitions, 121 flow. Second operand 3 states and 115 transitions. [2024-11-13 13:29:54,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 71 transitions, 287 flow [2024-11-13 13:29:54,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 71 transitions, 283 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 13:29:54,606 INFO L231 Difference]: Finished difference. Result has 50 places, 50 transitions, 132 flow [2024-11-13 13:29:54,607 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=50, PETRI_TRANSITIONS=50} [2024-11-13 13:29:54,608 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2024-11-13 13:29:54,609 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 50 transitions, 132 flow [2024-11-13 13:29:54,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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) [2024-11-13 13:29:54,609 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:29:54,609 INFO L204 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] [2024-11-13 13:29:54,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:29:54,610 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 13:29:54,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:29:54,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1110394158, now seen corresponding path program 1 times [2024-11-13 13:29:54,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:29:54,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632330088] [2024-11-13 13:29:54,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:29:54,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:29:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:54,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:29:54,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:29:54,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632330088] [2024-11-13 13:29:54,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632330088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:29:54,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:29:54,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:29:54,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400356712] [2024-11-13 13:29:54,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:29:54,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:29:54,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:29:54,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:29:54,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:29:54,871 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 52 [2024-11-13 13:29:54,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 50 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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) [2024-11-13 13:29:54,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:29:54,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 52 [2024-11-13 13:29:54,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:29:55,585 INFO L124 PetriNetUnfolderBase]: 2977/4712 cut-off events. [2024-11-13 13:29:55,586 INFO L125 PetriNetUnfolderBase]: For 1586/1601 co-relation queries the response was YES. [2024-11-13 13:29:55,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10160 conditions, 4712 events. 2977/4712 cut-off events. For 1586/1601 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 30053 event pairs, 955 based on Foata normal form. 69/4608 useless extension candidates. Maximal degree in co-relation 4634. Up to 2600 conditions per place. [2024-11-13 13:29:55,618 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 52 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2024-11-13 13:29:55,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 71 transitions, 303 flow [2024-11-13 13:29:55,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:29:55,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 13:29:55,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-11-13 13:29:55,623 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7243589743589743 [2024-11-13 13:29:55,625 INFO L175 Difference]: Start difference. First operand has 50 places, 50 transitions, 132 flow. Second operand 3 states and 113 transitions. [2024-11-13 13:29:55,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 71 transitions, 303 flow [2024-11-13 13:29:55,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 71 transitions, 300 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 13:29:55,628 INFO L231 Difference]: Finished difference. Result has 52 places, 51 transitions, 144 flow [2024-11-13 13:29:55,629 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=52, PETRI_TRANSITIONS=51} [2024-11-13 13:29:55,630 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2024-11-13 13:29:55,631 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 51 transitions, 144 flow [2024-11-13 13:29:55,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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) [2024-11-13 13:29:55,631 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:29:55,631 INFO L204 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] [2024-11-13 13:29:55,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 13:29:55,632 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 13:29:55,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:29:55,633 INFO L85 PathProgramCache]: Analyzing trace with hash -50944641, now seen corresponding path program 1 times [2024-11-13 13:29:55,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:29:55,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460362725] [2024-11-13 13:29:55,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:29:55,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:29:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:55,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:29:55,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:29:55,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460362725] [2024-11-13 13:29:55,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460362725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:29:55,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:29:55,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:29:55,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291421675] [2024-11-13 13:29:55,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:29:55,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:29:55,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:29:55,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:29:55,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:29:55,941 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 52 [2024-11-13 13:29:55,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 51 transitions, 144 flow. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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) [2024-11-13 13:29:55,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:29:55,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 52 [2024-11-13 13:29:55,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:29:56,858 INFO L124 PetriNetUnfolderBase]: 3555/5588 cut-off events. [2024-11-13 13:29:56,859 INFO L125 PetriNetUnfolderBase]: For 2361/2442 co-relation queries the response was YES. [2024-11-13 13:29:56,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12775 conditions, 5588 events. 3555/5588 cut-off events. For 2361/2442 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 37060 event pairs, 2675 based on Foata normal form. 108/5348 useless extension candidates. Maximal degree in co-relation 6216. Up to 4011 conditions per place. [2024-11-13 13:29:56,895 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 58 selfloop transitions, 4 changer transitions 0/79 dead transitions. [2024-11-13 13:29:56,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 79 transitions, 347 flow [2024-11-13 13:29:56,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:29:56,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 13:29:56,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2024-11-13 13:29:56,899 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6230769230769231 [2024-11-13 13:29:56,900 INFO L175 Difference]: Start difference. First operand has 52 places, 51 transitions, 144 flow. Second operand 5 states and 162 transitions. [2024-11-13 13:29:56,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 79 transitions, 347 flow [2024-11-13 13:29:56,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 79 transitions, 344 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 13:29:56,904 INFO L231 Difference]: Finished difference. Result has 58 places, 54 transitions, 170 flow [2024-11-13 13:29:56,904 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=170, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2024-11-13 13:29:56,907 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 5 predicate places. [2024-11-13 13:29:56,907 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 54 transitions, 170 flow [2024-11-13 13:29:56,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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) [2024-11-13 13:29:56,909 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:29:56,909 INFO L204 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] [2024-11-13 13:29:56,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 13:29:56,910 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 13:29:56,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:29:56,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1630491565, now seen corresponding path program 1 times [2024-11-13 13:29:56,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:29:56,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556081467] [2024-11-13 13:29:56,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:29:56,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:29:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:57,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:29:57,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:29:57,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556081467] [2024-11-13 13:29:57,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556081467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:29:57,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:29:57,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:29:57,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649522528] [2024-11-13 13:29:57,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:29:57,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:29:57,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:29:57,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:29:57,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:29:57,224 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 52 [2024-11-13 13:29:57,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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) [2024-11-13 13:29:57,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:29:57,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 52 [2024-11-13 13:29:57,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:29:58,149 INFO L124 PetriNetUnfolderBase]: 4275/6985 cut-off events. [2024-11-13 13:29:58,149 INFO L125 PetriNetUnfolderBase]: For 3058/3156 co-relation queries the response was YES. [2024-11-13 13:29:58,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15827 conditions, 6985 events. 4275/6985 cut-off events. For 3058/3156 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 49740 event pairs, 3295 based on Foata normal form. 145/6703 useless extension candidates. Maximal degree in co-relation 13272. Up to 4871 conditions per place. [2024-11-13 13:29:58,201 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 59 selfloop transitions, 6 changer transitions 2/84 dead transitions. [2024-11-13 13:29:58,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 84 transitions, 400 flow [2024-11-13 13:29:58,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:29:58,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 13:29:58,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2024-11-13 13:29:58,202 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6230769230769231 [2024-11-13 13:29:58,203 INFO L175 Difference]: Start difference. First operand has 58 places, 54 transitions, 170 flow. Second operand 5 states and 162 transitions. [2024-11-13 13:29:58,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 84 transitions, 400 flow [2024-11-13 13:29:58,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 84 transitions, 396 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-13 13:29:58,208 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 209 flow [2024-11-13 13:29:58,209 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=209, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2024-11-13 13:29:58,209 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 11 predicate places. [2024-11-13 13:29:58,212 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 209 flow [2024-11-13 13:29:58,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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) [2024-11-13 13:29:58,212 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:29:58,212 INFO L204 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] [2024-11-13 13:29:58,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 13:29:58,213 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 13:29:58,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:29:58,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1354152565, now seen corresponding path program 1 times [2024-11-13 13:29:58,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:29:58,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857871464] [2024-11-13 13:29:58,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:29:58,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:29:58,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:58,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 13:29:58,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:29:58,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857871464] [2024-11-13 13:29:58,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857871464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:29:58,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:29:58,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:29:58,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252834577] [2024-11-13 13:29:58,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:29:58,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:29:58,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:29:58,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:29:58,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:29:58,755 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 52 [2024-11-13 13:29:58,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 209 flow. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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) [2024-11-13 13:29:58,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:29:58,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 52 [2024-11-13 13:29:58,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:30:00,711 INFO L124 PetriNetUnfolderBase]: 8981/14310 cut-off events. [2024-11-13 13:30:00,711 INFO L125 PetriNetUnfolderBase]: For 5646/5918 co-relation queries the response was YES. [2024-11-13 13:30:00,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32726 conditions, 14310 events. 8981/14310 cut-off events. For 5646/5918 co-relation queries the response was YES. Maximal size of possible extension queue 735. Compared 106207 event pairs, 3970 based on Foata normal form. 5/13357 useless extension candidates. Maximal degree in co-relation 24425. Up to 5797 conditions per place. [2024-11-13 13:30:00,806 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 98 selfloop transitions, 9 changer transitions 1/122 dead transitions. [2024-11-13 13:30:00,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 122 transitions, 631 flow [2024-11-13 13:30:00,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:30:00,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 13:30:00,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 199 transitions. [2024-11-13 13:30:00,810 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6378205128205128 [2024-11-13 13:30:00,810 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 209 flow. Second operand 6 states and 199 transitions. [2024-11-13 13:30:00,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 122 transitions, 631 flow [2024-11-13 13:30:00,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 122 transitions, 624 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-13 13:30:00,821 INFO L231 Difference]: Finished difference. Result has 72 places, 62 transitions, 264 flow [2024-11-13 13:30:00,823 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=264, PETRI_PLACES=72, PETRI_TRANSITIONS=62} [2024-11-13 13:30:00,824 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 19 predicate places. [2024-11-13 13:30:00,824 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 62 transitions, 264 flow [2024-11-13 13:30:00,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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) [2024-11-13 13:30:00,824 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:30:00,825 INFO L204 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] [2024-11-13 13:30:00,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 13:30:00,825 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 13:30:00,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:30:00,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1266423299, now seen corresponding path program 1 times [2024-11-13 13:30:00,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:30:00,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447898699] [2024-11-13 13:30:00,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:30:00,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:30:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:01,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 13:30:01,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:30:01,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447898699] [2024-11-13 13:30:01,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447898699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:30:01,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:30:01,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:30:01,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249213166] [2024-11-13 13:30:01,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:30:01,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:30:01,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:30:01,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:30:01,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:30:01,358 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 52 [2024-11-13 13:30:01,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 62 transitions, 264 flow. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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) [2024-11-13 13:30:01,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:30:01,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 52 [2024-11-13 13:30:01,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:30:02,730 INFO L124 PetriNetUnfolderBase]: 7733/12028 cut-off events. [2024-11-13 13:30:02,730 INFO L125 PetriNetUnfolderBase]: For 6352/6658 co-relation queries the response was YES. [2024-11-13 13:30:02,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28814 conditions, 12028 events. 7733/12028 cut-off events. For 6352/6658 co-relation queries the response was YES. Maximal size of possible extension queue 598. Compared 84649 event pairs, 3191 based on Foata normal form. 17/11110 useless extension candidates. Maximal degree in co-relation 23961. Up to 5705 conditions per place. [2024-11-13 13:30:02,802 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 61 selfloop transitions, 6 changer transitions 29/110 dead transitions. [2024-11-13 13:30:02,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 110 transitions, 592 flow [2024-11-13 13:30:02,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:30:02,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 13:30:02,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 189 transitions. [2024-11-13 13:30:02,804 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6057692307692307 [2024-11-13 13:30:02,804 INFO L175 Difference]: Start difference. First operand has 72 places, 62 transitions, 264 flow. Second operand 6 states and 189 transitions. [2024-11-13 13:30:02,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 110 transitions, 592 flow [2024-11-13 13:30:02,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 110 transitions, 581 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-11-13 13:30:02,813 INFO L231 Difference]: Finished difference. Result has 79 places, 60 transitions, 254 flow [2024-11-13 13:30:02,813 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=254, PETRI_PLACES=79, PETRI_TRANSITIONS=60} [2024-11-13 13:30:02,814 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 26 predicate places. [2024-11-13 13:30:02,814 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 60 transitions, 254 flow [2024-11-13 13:30:02,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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) [2024-11-13 13:30:02,815 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:30:02,815 INFO L204 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, 1] [2024-11-13 13:30:02,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 13:30:02,816 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 13:30:02,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:30:02,816 INFO L85 PathProgramCache]: Analyzing trace with hash -167615021, now seen corresponding path program 1 times [2024-11-13 13:30:02,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:30:02,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056497864] [2024-11-13 13:30:02,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:30:02,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:30:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:03,365 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 13:30:03,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:30:03,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056497864] [2024-11-13 13:30:03,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056497864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:30:03,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:30:03,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:30:03,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763860938] [2024-11-13 13:30:03,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:30:03,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:30:03,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:30:03,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:30:03,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:30:03,454 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 52 [2024-11-13 13:30:03,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 60 transitions, 254 flow. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 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) [2024-11-13 13:30:03,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:30:03,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 52 [2024-11-13 13:30:03,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:30:04,653 INFO L124 PetriNetUnfolderBase]: 6261/9808 cut-off events. [2024-11-13 13:30:04,653 INFO L125 PetriNetUnfolderBase]: For 7188/7236 co-relation queries the response was YES. [2024-11-13 13:30:04,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24620 conditions, 9808 events. 6261/9808 cut-off events. For 7188/7236 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 67749 event pairs, 1396 based on Foata normal form. 452/10115 useless extension candidates. Maximal degree in co-relation 20502. Up to 5105 conditions per place. [2024-11-13 13:30:04,719 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 81 selfloop transitions, 7 changer transitions 8/111 dead transitions. [2024-11-13 13:30:04,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 111 transitions, 640 flow [2024-11-13 13:30:04,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 13:30:04,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-13 13:30:04,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 209 transitions. [2024-11-13 13:30:04,721 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5741758241758241 [2024-11-13 13:30:04,721 INFO L175 Difference]: Start difference. First operand has 79 places, 60 transitions, 254 flow. Second operand 7 states and 209 transitions. [2024-11-13 13:30:04,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 111 transitions, 640 flow [2024-11-13 13:30:04,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 111 transitions, 613 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-11-13 13:30:04,735 INFO L231 Difference]: Finished difference. Result has 78 places, 61 transitions, 253 flow [2024-11-13 13:30:04,736 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=253, PETRI_PLACES=78, PETRI_TRANSITIONS=61} [2024-11-13 13:30:04,737 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 25 predicate places. [2024-11-13 13:30:04,737 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 61 transitions, 253 flow [2024-11-13 13:30:04,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 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) [2024-11-13 13:30:04,737 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:30:04,737 INFO L204 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, 1] [2024-11-13 13:30:04,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 13:30:04,738 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 13:30:04,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:30:04,738 INFO L85 PathProgramCache]: Analyzing trace with hash -2128906627, now seen corresponding path program 1 times [2024-11-13 13:30:04,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:30:04,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032273059] [2024-11-13 13:30:04,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:30:04,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:30:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:05,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 13:30:05,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:30:05,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032273059] [2024-11-13 13:30:05,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032273059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:30:05,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:30:05,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:30:05,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733843555] [2024-11-13 13:30:05,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:30:05,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:30:05,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:30:05,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:30:05,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:30:05,261 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 52 [2024-11-13 13:30:05,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 61 transitions, 253 flow. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 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) [2024-11-13 13:30:05,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:30:05,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 52 [2024-11-13 13:30:05,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:30:06,351 INFO L124 PetriNetUnfolderBase]: 4688/7154 cut-off events. [2024-11-13 13:30:06,352 INFO L125 PetriNetUnfolderBase]: For 6763/6976 co-relation queries the response was YES. [2024-11-13 13:30:06,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19167 conditions, 7154 events. 4688/7154 cut-off events. For 6763/6976 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 44986 event pairs, 802 based on Foata normal form. 360/7440 useless extension candidates. Maximal degree in co-relation 16676. Up to 4641 conditions per place. [2024-11-13 13:30:06,412 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 71 selfloop transitions, 5 changer transitions 2/95 dead transitions. [2024-11-13 13:30:06,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 95 transitions, 549 flow [2024-11-13 13:30:06,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:30:06,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 13:30:06,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 175 transitions. [2024-11-13 13:30:06,414 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5608974358974359 [2024-11-13 13:30:06,414 INFO L175 Difference]: Start difference. First operand has 78 places, 61 transitions, 253 flow. Second operand 6 states and 175 transitions. [2024-11-13 13:30:06,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 95 transitions, 549 flow [2024-11-13 13:30:06,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 95 transitions, 517 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-11-13 13:30:06,426 INFO L231 Difference]: Finished difference. Result has 76 places, 59 transitions, 233 flow [2024-11-13 13:30:06,426 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=233, PETRI_PLACES=76, PETRI_TRANSITIONS=59} [2024-11-13 13:30:06,427 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 23 predicate places. [2024-11-13 13:30:06,427 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 59 transitions, 233 flow [2024-11-13 13:30:06,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 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) [2024-11-13 13:30:06,427 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:30:06,427 INFO L204 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, 1, 1, 1, 1, 1, 1] [2024-11-13 13:30:06,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 13:30:06,428 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 13:30:06,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:30:06,428 INFO L85 PathProgramCache]: Analyzing trace with hash 457397532, now seen corresponding path program 1 times [2024-11-13 13:30:06,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:30:06,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791345456] [2024-11-13 13:30:06,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:30:06,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:30:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:30:06,532 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:30:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:30:06,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:30:06,619 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 13:30:06,621 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-11-13 13:30:06,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2024-11-13 13:30:06,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-11-13 13:30:06,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-11-13 13:30:06,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-11-13 13:30:06,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 13:30:06,624 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:30:06,785 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-13 13:30:06,787 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 13:30:06,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 01:30:06 BasicIcfg [2024-11-13 13:30:06,797 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 13:30:06,798 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 13:30:06,798 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 13:30:06,798 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 13:30:06,799 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:29:51" (3/4) ... [2024-11-13 13:30:06,801 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 13:30:06,941 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a80043f7-8893-4c87-bf20-3b93010e9bde/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 13:30:06,942 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 13:30:06,943 INFO L158 Benchmark]: Toolchain (without parser) took 18015.62ms. Allocated memory was 117.4MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 92.9MB in the beginning and 303.4MB in the end (delta: -210.4MB). Peak memory consumption was 917.6MB. Max. memory is 16.1GB. [2024-11-13 13:30:06,944 INFO L158 Benchmark]: CDTParser took 0.50ms. Allocated memory is still 117.4MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:30:06,944 INFO L158 Benchmark]: CACSL2BoogieTranslator took 485.89ms. Allocated memory is still 117.4MB. Free memory was 92.8MB in the beginning and 79.7MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 13:30:06,945 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.68ms. Allocated memory is still 117.4MB. Free memory was 79.7MB in the beginning and 77.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:30:06,946 INFO L158 Benchmark]: Boogie Preprocessor took 109.57ms. Allocated memory is still 117.4MB. Free memory was 77.1MB in the beginning and 74.2MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:30:06,947 INFO L158 Benchmark]: RCFGBuilder took 1777.99ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 33.9MB in the end (delta: 40.4MB). Peak memory consumption was 47.3MB. Max. memory is 16.1GB. [2024-11-13 13:30:06,947 INFO L158 Benchmark]: TraceAbstraction took 15402.62ms. Allocated memory was 117.4MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 33.3MB in the beginning and 324.4MB in the end (delta: -291.0MB). Peak memory consumption was 845.1MB. Max. memory is 16.1GB. [2024-11-13 13:30:06,947 INFO L158 Benchmark]: Witness Printer took 144.09ms. Allocated memory is still 1.2GB. Free memory was 324.4MB in the beginning and 303.4MB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 13:30:06,949 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.50ms. Allocated memory is still 117.4MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 485.89ms. Allocated memory is still 117.4MB. Free memory was 92.8MB in the beginning and 79.7MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.68ms. Allocated memory is still 117.4MB. Free memory was 79.7MB in the beginning and 77.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 109.57ms. Allocated memory is still 117.4MB. Free memory was 77.1MB in the beginning and 74.2MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1777.99ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 33.9MB in the end (delta: 40.4MB). Peak memory consumption was 47.3MB. Max. memory is 16.1GB. * TraceAbstraction took 15402.62ms. Allocated memory was 117.4MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 33.3MB in the beginning and 324.4MB in the end (delta: -291.0MB). Peak memory consumption was 845.1MB. Max. memory is 16.1GB. * Witness Printer took 144.09ms. Allocated memory is still 1.2GB. Free memory was 324.4MB in the beginning and 303.4MB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 155]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L41] 0 int *q1, *q2, *f; [L42] 0 int q1_front, q1_back, q2_front, q2_back, i, j, n1, n2, N, total; [L129] 0 pthread_t t1, t2, t3, t4; [L131] 0 N = __VERIFIER_nondet_int() [L132] 0 n1 = __VERIFIER_nondet_int() [L133] 0 n2 = __VERIFIER_nondet_int() [L134] 0 q1_front = __VERIFIER_nondet_int() [L135] 0 q1_back = q1_front [L136] 0 q2_front = __VERIFIER_nondet_int() [L137] 0 q2_back = q2_front [L138] CALL, EXPR 0 create_fresh_int_array(n1) [L161] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size >= 0) [L162] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L162] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L164] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L165] 0 int i = 0; VAL [N=1, \old(size)=1, arr={-6:0}, f={0:0}, i=0, i=0, j=0, n1=1, n2=1, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND TRUE 0 i < size [L166] 0 arr[i] = __VERIFIER_nondet_int() [L165] 0 i++ VAL [N=1, \old(size)=1, arr={-6:0}, f={0:0}, i=0, i=1, j=0, n1=1, n2=1, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND FALSE 0 !(i < size) [L168] 0 return arr; [L138] RET, EXPR 0 create_fresh_int_array(n1) [L138] 0 q1 = create_fresh_int_array(n1) [L139] CALL, EXPR 0 create_fresh_int_array(n2) [L161] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size >= 0) [L162] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L162] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L164] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L165] 0 int i = 0; VAL [N=1, \old(size)=1, arr={-4:0}, f={0:0}, i=0, i=0, j=0, n1=1, n2=1, q1={-6:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND TRUE 0 i < size [L166] 0 arr[i] = __VERIFIER_nondet_int() [L165] 0 i++ VAL [N=1, \old(size)=1, arr={-4:0}, f={0:0}, i=0, i=1, j=0, n1=1, n2=1, q1={-6:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND FALSE 0 !(i < size) [L168] 0 return arr; [L139] RET, EXPR 0 create_fresh_int_array(n2) [L139] 0 q2 = create_fresh_int_array(n2) [L140] CALL, EXPR 0 create_fresh_int_array(N) [L161] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size >= 0) [L162] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L162] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L164] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L165] 0 int i = 0; VAL [N=1, \old(size)=1, arr={-5:0}, f={0:0}, i=0, i=0, j=0, n1=1, n2=1, q1={-6:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND TRUE 0 i < size [L166] 0 arr[i] = __VERIFIER_nondet_int() [L165] 0 i++ VAL [N=1, \old(size)=1, arr={-5:0}, f={0:0}, i=0, i=1, j=0, n1=1, n2=1, q1={-6:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND FALSE 0 !(i < size) [L168] 0 return arr; [L140] RET, EXPR 0 create_fresh_int_array(N) [L140] 0 f = create_fresh_int_array(N) [L142] CALL 0 assume_abort_if_not(N >= 0) [L38] COND FALSE 0 !(!cond) [L142] RET 0 assume_abort_if_not(N >= 0) [L145] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [N=1, f={-5:0}, i=0, j=0, n1=1, n2=1, q1={-6:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, total=0] [L146] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [N=1, f={-5:0}, i=0, j=0, n1=1, n2=1, q1={-6:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, total=0] [L147] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [N=1, f={-5:0}, i=0, j=0, n1=1, n2=1, q1={-6:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, t3=-1, total=0] [L148] FCALL, FORK 0 pthread_create(&t4, 0, thread4, 0) VAL [N=1, f={-5:0}, i=0, j=0, n1=1, n2=1, q1={-6:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=0] [L49] 1 _Bool cond = i < N; VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=0, j=0, n1=1, n2=1, q1={-6:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L51] COND TRUE 1 \read(cond) VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=0, j=0, n1=1, n2=1, q1={-6:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L71] 2 _Bool cond = j < N; VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=0, j=0, n1=1, n2=1, q1={-6:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L73] COND TRUE 2 \read(cond) VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=0, j=0, n1=1, n2=1, q1={-6:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L75] CALL 2 assume_abort_if_not(q2_back >= 0 && q2_back < n2) [L38] COND FALSE 2 !(!cond) [L75] RET 2 assume_abort_if_not(q2_back >= 0 && q2_back < n2) [L76] EXPR 2 f[j] [L76] CALL 2 assume_abort_if_not(f[j] > -2147483648) [L38] COND FALSE 2 !(!cond) [L76] RET 2 assume_abort_if_not(f[j] > -2147483648) [L77] EXPR 2 q2[q2_back] [L77] EXPR 2 f[j] [L77] CALL 2 assume_abort_if_not(q2[q2_back] == -f[j]) [L38] COND FALSE 2 !(!cond) [L77] RET 2 assume_abort_if_not(q2[q2_back] == -f[j]) [L78] CALL 2 assume_abort_if_not(q2_back < 2147483647) [L38] COND FALSE 2 !(!cond) [L78] RET 2 assume_abort_if_not(q2_back < 2147483647) [L79] 2 j++ VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-6:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L112] 4 _Bool cond = j < N || q2_front < q2_back; VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-6:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L114] COND FALSE 4 !(\read(cond)) [L125] 4 return 0; [L82] 2 q2_back++ VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-6:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=1, q2_front=0, total=0] [L85] 2 cond = j < N VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-6:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=1, q2_front=0, total=0] [L73] COND FALSE 2 !(\read(cond)) [L89] 2 return 0; [L53] CALL 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1) [L38] COND FALSE 1 !(!cond) [L53] RET 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1) [L54] EXPR 1 q1[q1_back] [L54] EXPR 1 f[i] [L54] CALL 1 assume_abort_if_not(q1[q1_back] == f[i]) [L38] COND FALSE 1 !(!cond) [L54] RET 1 assume_abort_if_not(q1[q1_back] == f[i]) [L55] CALL 1 assume_abort_if_not(q1_back < 2147483647) [L38] COND FALSE 1 !(!cond) [L55] RET 1 assume_abort_if_not(q1_back < 2147483647) [L56] 1 i++ VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-6:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=1, q2_front=0, total=0] [L59] 1 q1_back++ VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-6:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=1, q2_front=0, total=0] [L62] 1 cond = i < N VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-6:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=1, q2_front=0, total=0] [L51] COND FALSE 1 !(\read(cond)) [L66] 1 return 0; [L94] 3 _Bool cond = i < N || q1_front < q1_back; VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-6:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=1, q2_front=0, total=0] [L96] COND TRUE 3 \read(cond) VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-6:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=1, q2_front=0, total=0] [L98] CALL 3 assume_abort_if_not(q1_front < q1_back && q1_front >= 0 && q1_front < n1) [L38] COND FALSE 3 !(!cond) [L98] RET 3 assume_abort_if_not(q1_front < q1_back && q1_front >= 0 && q1_front < n1) [L99] EXPR 3 q1[q1_front] [L99] CALL, EXPR 3 plus(total, q1[q1_front]) [L172] CALL 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L38] COND FALSE 3 !(!cond) [L172] RET 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L173] CALL 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 3 !(!cond) [L173] RET 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L174] 3 return a + b; [L99] RET, EXPR 3 plus(total, q1[q1_front]) [L99] 3 total = plus(total, q1[q1_front]) [L100] 3 q1_front++ VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-6:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=1, q2_front=0, total=7] [L103] 3 cond = i < N || q1_front < q1_back VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-6:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=1, q2_front=0, total=7] [L96] COND FALSE 3 !(\read(cond)) [L107] 3 return 0; [L149] FCALL, JOIN 1 pthread_join(t1, 0) VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-6:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=1, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=7] [L150] FCALL, JOIN 2 pthread_join(t2, 0) VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-6:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=1, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=7] [L151] FCALL, JOIN 3 pthread_join(t3, 0) VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-6:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=1, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=7] [L152] FCALL, JOIN 4 pthread_join(t4, 0) VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-6:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=1, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=7] [L154] CALL 0 assume_abort_if_not(total != 0) [L38] COND FALSE 0 !(!cond) [L154] RET 0 assume_abort_if_not(total != 0) [L155] 0 reach_error() VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-6:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=1, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=7] - UnprovableResult [Line: 148]: 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: 146]: 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: 147]: 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: 145]: 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, 76 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 15.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 471 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 418 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1177 IncrementalHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 8 mSDtfsCounter, 1177 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=264occurred in iteration=6, InterpolantAutomatonStates: 44, 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, 3.1s InterpolantComputationTime, 368 NumberOfCodeBlocks, 368 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 315 ConstructedInterpolants, 0 QuantifiedInterpolants, 865 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 20/20 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! [2024-11-13 13:30:06,997 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a80043f7-8893-4c87-bf20-3b93010e9bde/bin/uautomizer-verify-qhAvR1uOyd/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