./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 a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87f35854-e811-44ba-914a-820bfcf353d1/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87f35854-e811-44ba-914a-820bfcf353d1/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87f35854-e811-44ba-914a-820bfcf353d1/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87f35854-e811-44ba-914a-820bfcf353d1/bin/uautomizer-verify-jihMAELWvX/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_87f35854-e811-44ba-914a-820bfcf353d1/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87f35854-e811-44ba-914a-820bfcf353d1/bin/uautomizer-verify-jihMAELWvX --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.2.5-dev-a016563 [2024-11-08 18:44:11,749 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:44:11,838 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87f35854-e811-44ba-914a-820bfcf353d1/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 18:44:11,848 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:44:11,851 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:44:11,883 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:44:11,884 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:44:11,884 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:44:11,885 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:44:11,885 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:44:11,885 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:44:11,886 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:44:11,886 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:44:11,887 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:44:11,887 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:44:11,888 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:44:11,888 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:44:11,888 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:44:11,889 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:44:11,889 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:44:11,889 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:44:11,890 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:44:11,890 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:44:11,890 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:44:11,891 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:44:11,891 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:44:11,891 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:44:11,892 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:44:11,892 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:44:11,892 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:44:11,893 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:44:11,893 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:44:11,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:44:11,894 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:44:11,894 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:44:11,894 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:44:11,895 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 18:44:11,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 18:44:11,895 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:44:11,896 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:44:11,896 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:44:11,896 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:44:11,897 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87f35854-e811-44ba-914a-820bfcf353d1/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87f35854-e811-44ba-914a-820bfcf353d1/bin/uautomizer-verify-jihMAELWvX 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-08 18:44:12,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:44:12,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:44:12,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:44:12,240 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:44:12,240 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:44:12,242 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87f35854-e811-44ba-914a-820bfcf353d1/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c Unable to find full path for "g++" [2024-11-08 18:44:14,191 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:44:14,460 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:44:14,461 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87f35854-e811-44ba-914a-820bfcf353d1/sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c [2024-11-08 18:44:14,476 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87f35854-e811-44ba-914a-820bfcf353d1/bin/uautomizer-verify-jihMAELWvX/data/11c143597/cf49ad7d3dc948e1ab8576a9ac5eda6b/FLAG7dd27c206 [2024-11-08 18:44:14,492 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87f35854-e811-44ba-914a-820bfcf353d1/bin/uautomizer-verify-jihMAELWvX/data/11c143597/cf49ad7d3dc948e1ab8576a9ac5eda6b [2024-11-08 18:44:14,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:44:14,496 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:44:14,497 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:44:14,497 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:44:14,503 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:44:14,504 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:44:14" (1/1) ... [2024-11-08 18:44:14,505 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b1ea08f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:44:14, skipping insertion in model container [2024-11-08 18:44:14,505 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:44:14" (1/1) ... [2024-11-08 18:44:14,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:44:14,763 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_87f35854-e811-44ba-914a-820bfcf353d1/sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c[4403,4416] [2024-11-08 18:44:14,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:44:14,798 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:44:14,848 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_87f35854-e811-44ba-914a-820bfcf353d1/sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c[4403,4416] [2024-11-08 18:44:14,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:44:14,880 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:44:14,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:44:14 WrapperNode [2024-11-08 18:44:14,881 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:44:14,882 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:44:14,883 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:44:14,883 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:44:14,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:44:14" (1/1) ... [2024-11-08 18:44:14,901 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:44:14" (1/1) ... [2024-11-08 18:44:14,946 INFO L138 Inliner]: procedures = 26, calls = 67, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 333 [2024-11-08 18:44:14,946 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:44:14,947 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:44:14,950 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:44:14,951 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:44:14,965 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:44:14" (1/1) ... [2024-11-08 18:44:14,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:44:14" (1/1) ... [2024-11-08 18:44:14,974 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:44:14" (1/1) ... [2024-11-08 18:44:15,001 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-08 18:44:15,001 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:44:14" (1/1) ... [2024-11-08 18:44:15,002 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:44:14" (1/1) ... [2024-11-08 18:44:15,011 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:44:14" (1/1) ... [2024-11-08 18:44:15,016 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:44:14" (1/1) ... [2024-11-08 18:44:15,018 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:44:14" (1/1) ... [2024-11-08 18:44:15,020 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:44:14" (1/1) ... [2024-11-08 18:44:15,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:44:15,025 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:44:15,025 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:44:15,025 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:44:15,026 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:44:14" (1/1) ... [2024-11-08 18:44:15,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:44:15,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87f35854-e811-44ba-914a-820bfcf353d1/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:44:15,063 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87f35854-e811-44ba-914a-820bfcf353d1/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:44:15,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87f35854-e811-44ba-914a-820bfcf353d1/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:44:15,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:44:15,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 18:44:15,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 18:44:15,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 18:44:15,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 18:44:15,108 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-08 18:44:15,109 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-08 18:44:15,109 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-08 18:44:15,109 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-08 18:44:15,109 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-08 18:44:15,109 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-08 18:44:15,109 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-08 18:44:15,110 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-08 18:44:15,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 18:44:15,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 18:44:15,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-08 18:44:15,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-08 18:44:15,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 18:44:15,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:44:15,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:44:15,113 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-08 18:44:15,247 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:44:15,248 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:44:15,815 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-08 18:44:15,815 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:44:16,367 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:44:16,368 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 18:44:16,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:44:16 BoogieIcfgContainer [2024-11-08 18:44:16,368 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:44:16,372 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:44:16,373 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:44:16,377 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:44:16,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:44:14" (1/3) ... [2024-11-08 18:44:16,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c9e31dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:44:16, skipping insertion in model container [2024-11-08 18:44:16,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:44:14" (2/3) ... [2024-11-08 18:44:16,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c9e31dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:44:16, skipping insertion in model container [2024-11-08 18:44:16,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:44:16" (3/3) ... [2024-11-08 18:44:16,381 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series3.wvr.c [2024-11-08 18:44:16,401 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:44:16,402 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:44:16,402 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-08 18:44:16,495 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-08 18:44:16,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 73 transitions, 174 flow [2024-11-08 18:44:16,607 INFO L124 PetriNetUnfolderBase]: 14/69 cut-off events. [2024-11-08 18:44:16,607 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-08 18:44:16,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 69 events. 14/69 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 140 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2024-11-08 18:44:16,612 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 73 transitions, 174 flow [2024-11-08 18:44:16,617 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 68 transitions, 160 flow [2024-11-08 18:44:16,633 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:44:16,639 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;@52e9a3a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:44:16,639 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-08 18:44:16,662 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-08 18:44:16,663 INFO L124 PetriNetUnfolderBase]: 14/67 cut-off events. [2024-11-08 18:44:16,663 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-08 18:44:16,663 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:44:16,664 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-08 18:44:16,665 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-08 18:44:16,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:44:16,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1792758193, now seen corresponding path program 1 times [2024-11-08 18:44:16,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:44:16,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685482588] [2024-11-08 18:44:16,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:44:16,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:44:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:44:17,203 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-08 18:44:17,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:44:17,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685482588] [2024-11-08 18:44:17,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685482588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:44:17,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:44:17,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:44:17,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641333013] [2024-11-08 18:44:17,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:44:17,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:44:17,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:44:17,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:44:17,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:44:17,250 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 73 [2024-11-08 18:44:17,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 68 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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-08 18:44:17,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:44:17,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 73 [2024-11-08 18:44:17,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:44:18,194 INFO L124 PetriNetUnfolderBase]: 2744/4738 cut-off events. [2024-11-08 18:44:18,194 INFO L125 PetriNetUnfolderBase]: For 211/211 co-relation queries the response was YES. [2024-11-08 18:44:18,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8009 conditions, 4738 events. 2744/4738 cut-off events. For 211/211 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 31849 event pairs, 472 based on Foata normal form. 1/3770 useless extension candidates. Maximal degree in co-relation 7230. Up to 2067 conditions per place. [2024-11-08 18:44:18,262 INFO L140 encePairwiseOnDemand]: 69/73 looper letters, 43 selfloop transitions, 3 changer transitions 1/85 dead transitions. [2024-11-08 18:44:18,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 85 transitions, 303 flow [2024-11-08 18:44:18,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:44:18,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:44:18,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2024-11-08 18:44:18,278 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7945205479452054 [2024-11-08 18:44:18,280 INFO L175 Difference]: Start difference. First operand has 67 places, 68 transitions, 160 flow. Second operand 3 states and 174 transitions. [2024-11-08 18:44:18,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 85 transitions, 303 flow [2024-11-08 18:44:18,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 85 transitions, 277 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-08 18:44:18,295 INFO L231 Difference]: Finished difference. Result has 62 places, 70 transitions, 163 flow [2024-11-08 18:44:18,297 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=163, PETRI_PLACES=62, PETRI_TRANSITIONS=70} [2024-11-08 18:44:18,303 INFO L277 CegarLoopForPetriNet]: 67 programPoint places, -5 predicate places. [2024-11-08 18:44:18,303 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 70 transitions, 163 flow [2024-11-08 18:44:18,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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-08 18:44:18,304 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:44:18,304 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] [2024-11-08 18:44:18,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 18:44:18,304 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-08 18:44:18,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:44:18,305 INFO L85 PathProgramCache]: Analyzing trace with hash 788215955, now seen corresponding path program 1 times [2024-11-08 18:44:18,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:44:18,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052948530] [2024-11-08 18:44:18,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:44:18,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:44:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:44:18,561 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-08 18:44:18,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:44:18,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052948530] [2024-11-08 18:44:18,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052948530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:44:18,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:44:18,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:44:18,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970511425] [2024-11-08 18:44:18,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:44:18,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:44:18,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:44:18,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:44:18,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:44:18,572 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 73 [2024-11-08 18:44:18,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 70 transitions, 163 flow. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:44:18,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:44:18,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 73 [2024-11-08 18:44:18,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:44:19,424 INFO L124 PetriNetUnfolderBase]: 2963/4969 cut-off events. [2024-11-08 18:44:19,424 INFO L125 PetriNetUnfolderBase]: For 683/683 co-relation queries the response was YES. [2024-11-08 18:44:19,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9323 conditions, 4969 events. 2963/4969 cut-off events. For 683/683 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 33177 event pairs, 761 based on Foata normal form. 98/4158 useless extension candidates. Maximal degree in co-relation 3528. Up to 2321 conditions per place. [2024-11-08 18:44:19,478 INFO L140 encePairwiseOnDemand]: 70/73 looper letters, 52 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2024-11-08 18:44:19,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 92 transitions, 329 flow [2024-11-08 18:44:19,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:44:19,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:44:19,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 178 transitions. [2024-11-08 18:44:19,480 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8127853881278538 [2024-11-08 18:44:19,480 INFO L175 Difference]: Start difference. First operand has 62 places, 70 transitions, 163 flow. Second operand 3 states and 178 transitions. [2024-11-08 18:44:19,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 92 transitions, 329 flow [2024-11-08 18:44:19,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 92 transitions, 325 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 18:44:19,485 INFO L231 Difference]: Finished difference. Result has 64 places, 71 transitions, 174 flow [2024-11-08 18:44:19,486 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=64, PETRI_TRANSITIONS=71} [2024-11-08 18:44:19,486 INFO L277 CegarLoopForPetriNet]: 67 programPoint places, -3 predicate places. [2024-11-08 18:44:19,486 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 71 transitions, 174 flow [2024-11-08 18:44:19,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:44:19,487 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:44:19,487 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] [2024-11-08 18:44:19,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 18:44:19,488 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-08 18:44:19,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:44:19,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1232238227, now seen corresponding path program 1 times [2024-11-08 18:44:19,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:44:19,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447532903] [2024-11-08 18:44:19,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:44:19,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:44:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:44:19,730 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-08 18:44:19,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:44:19,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447532903] [2024-11-08 18:44:19,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447532903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:44:19,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:44:19,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:44:19,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137096891] [2024-11-08 18:44:19,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:44:19,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:44:19,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:44:19,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:44:19,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:44:19,741 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 73 [2024-11-08 18:44:19,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 71 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:44:19,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:44:19,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 73 [2024-11-08 18:44:19,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:44:20,641 INFO L124 PetriNetUnfolderBase]: 3328/5793 cut-off events. [2024-11-08 18:44:20,641 INFO L125 PetriNetUnfolderBase]: For 1558/1645 co-relation queries the response was YES. [2024-11-08 18:44:20,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11241 conditions, 5793 events. 3328/5793 cut-off events. For 1558/1645 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 41098 event pairs, 955 based on Foata normal form. 90/4970 useless extension candidates. Maximal degree in co-relation 5090. Up to 2600 conditions per place. [2024-11-08 18:44:20,700 INFO L140 encePairwiseOnDemand]: 70/73 looper letters, 52 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2024-11-08 18:44:20,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 92 transitions, 345 flow [2024-11-08 18:44:20,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:44:20,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:44:20,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2024-11-08 18:44:20,702 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8036529680365296 [2024-11-08 18:44:20,702 INFO L175 Difference]: Start difference. First operand has 64 places, 71 transitions, 174 flow. Second operand 3 states and 176 transitions. [2024-11-08 18:44:20,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 92 transitions, 345 flow [2024-11-08 18:44:20,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 92 transitions, 342 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 18:44:20,706 INFO L231 Difference]: Finished difference. Result has 66 places, 72 transitions, 186 flow [2024-11-08 18:44:20,706 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=66, PETRI_TRANSITIONS=72} [2024-11-08 18:44:20,707 INFO L277 CegarLoopForPetriNet]: 67 programPoint places, -1 predicate places. [2024-11-08 18:44:20,707 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 72 transitions, 186 flow [2024-11-08 18:44:20,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:44:20,708 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:44:20,708 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, 1, 1] [2024-11-08 18:44:20,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 18:44:20,708 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-08 18:44:20,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:44:20,709 INFO L85 PathProgramCache]: Analyzing trace with hash 270694079, now seen corresponding path program 1 times [2024-11-08 18:44:20,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:44:20,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477208883] [2024-11-08 18:44:20,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:44:20,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:44:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:44:20,975 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-08 18:44:20,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:44:20,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477208883] [2024-11-08 18:44:20,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477208883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:44:20,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:44:20,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:44:20,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256759706] [2024-11-08 18:44:20,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:44:20,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:44:20,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:44:20,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:44:20,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:44:21,002 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 73 [2024-11-08 18:44:21,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 72 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:44:21,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:44:21,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 73 [2024-11-08 18:44:21,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:44:22,114 INFO L124 PetriNetUnfolderBase]: 3984/7073 cut-off events. [2024-11-08 18:44:22,115 INFO L125 PetriNetUnfolderBase]: For 2412/2602 co-relation queries the response was YES. [2024-11-08 18:44:22,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14280 conditions, 7073 events. 3984/7073 cut-off events. For 2412/2602 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 53039 event pairs, 2675 based on Foata normal form. 106/5950 useless extension candidates. Maximal degree in co-relation 6930. Up to 4017 conditions per place. [2024-11-08 18:44:22,236 INFO L140 encePairwiseOnDemand]: 64/73 looper letters, 74 selfloop transitions, 8 changer transitions 0/114 dead transitions. [2024-11-08 18:44:22,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 114 transitions, 457 flow [2024-11-08 18:44:22,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:44:22,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-08 18:44:22,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 257 transitions. [2024-11-08 18:44:22,238 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7041095890410959 [2024-11-08 18:44:22,238 INFO L175 Difference]: Start difference. First operand has 66 places, 72 transitions, 186 flow. Second operand 5 states and 257 transitions. [2024-11-08 18:44:22,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 114 transitions, 457 flow [2024-11-08 18:44:22,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 114 transitions, 454 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 18:44:22,245 INFO L231 Difference]: Finished difference. Result has 72 places, 79 transitions, 244 flow [2024-11-08 18:44:22,246 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=244, PETRI_PLACES=72, PETRI_TRANSITIONS=79} [2024-11-08 18:44:22,246 INFO L277 CegarLoopForPetriNet]: 67 programPoint places, 5 predicate places. [2024-11-08 18:44:22,246 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 79 transitions, 244 flow [2024-11-08 18:44:22,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:44:22,247 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:44:22,247 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, 1, 1] [2024-11-08 18:44:22,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 18:44:22,248 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-08 18:44:22,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:44:22,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1477455313, now seen corresponding path program 1 times [2024-11-08 18:44:22,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:44:22,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357780440] [2024-11-08 18:44:22,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:44:22,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:44:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:44:22,527 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-08 18:44:22,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:44:22,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357780440] [2024-11-08 18:44:22,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357780440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:44:22,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:44:22,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:44:22,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543399299] [2024-11-08 18:44:22,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:44:22,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:44:22,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:44:22,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:44:22,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:44:22,563 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 73 [2024-11-08 18:44:22,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 79 transitions, 244 flow. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:44:22,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:44:22,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 73 [2024-11-08 18:44:22,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:44:23,978 INFO L124 PetriNetUnfolderBase]: 4837/8846 cut-off events. [2024-11-08 18:44:23,978 INFO L125 PetriNetUnfolderBase]: For 3034/3310 co-relation queries the response was YES. [2024-11-08 18:44:24,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17738 conditions, 8846 events. 4837/8846 cut-off events. For 3034/3310 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 70054 event pairs, 3295 based on Foata normal form. 146/7482 useless extension candidates. Maximal degree in co-relation 14830. Up to 4887 conditions per place. [2024-11-08 18:44:24,055 INFO L140 encePairwiseOnDemand]: 66/73 looper letters, 74 selfloop transitions, 7 changer transitions 2/115 dead transitions. [2024-11-08 18:44:24,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 115 transitions, 526 flow [2024-11-08 18:44:24,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:44:24,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-08 18:44:24,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 249 transitions. [2024-11-08 18:44:24,057 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6821917808219178 [2024-11-08 18:44:24,057 INFO L175 Difference]: Start difference. First operand has 72 places, 79 transitions, 244 flow. Second operand 5 states and 249 transitions. [2024-11-08 18:44:24,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 115 transitions, 526 flow [2024-11-08 18:44:24,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 115 transitions, 524 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 18:44:24,061 INFO L231 Difference]: Finished difference. Result has 78 places, 84 transitions, 299 flow [2024-11-08 18:44:24,061 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=299, PETRI_PLACES=78, PETRI_TRANSITIONS=84} [2024-11-08 18:44:24,062 INFO L277 CegarLoopForPetriNet]: 67 programPoint places, 11 predicate places. [2024-11-08 18:44:24,062 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 84 transitions, 299 flow [2024-11-08 18:44:24,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:44:24,063 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:44:24,063 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, 1, 1, 1, 1] [2024-11-08 18:44:24,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 18:44:24,063 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-08 18:44:24,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:44:24,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1703306319, now seen corresponding path program 1 times [2024-11-08 18:44:24,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:44:24,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231559585] [2024-11-08 18:44:24,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:44:24,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:44:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:44:24,611 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-08 18:44:24,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:44:24,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231559585] [2024-11-08 18:44:24,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231559585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:44:24,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:44:24,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:44:24,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411728817] [2024-11-08 18:44:24,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:44:24,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:44:24,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:44:24,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:44:24,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:44:24,722 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 73 [2024-11-08 18:44:24,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 84 transitions, 299 flow. Second operand has 6 states, 6 states have (on average 37.333333333333336) internal successors, (224), 6 states have internal predecessors, (224), 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-08 18:44:24,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:44:24,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 73 [2024-11-08 18:44:24,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:44:27,362 INFO L124 PetriNetUnfolderBase]: 11382/19098 cut-off events. [2024-11-08 18:44:27,363 INFO L125 PetriNetUnfolderBase]: For 6556/6889 co-relation queries the response was YES. [2024-11-08 18:44:27,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40027 conditions, 19098 events. 11382/19098 cut-off events. For 6556/6889 co-relation queries the response was YES. Maximal size of possible extension queue 903. Compared 153423 event pairs, 4428 based on Foata normal form. 255/16946 useless extension candidates. Maximal degree in co-relation 30452. Up to 6751 conditions per place. [2024-11-08 18:44:27,736 INFO L140 encePairwiseOnDemand]: 64/73 looper letters, 109 selfloop transitions, 12 changer transitions 1/150 dead transitions. [2024-11-08 18:44:27,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 150 transitions, 749 flow [2024-11-08 18:44:27,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:44:27,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-08 18:44:27,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 325 transitions. [2024-11-08 18:44:27,738 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6360078277886497 [2024-11-08 18:44:27,739 INFO L175 Difference]: Start difference. First operand has 78 places, 84 transitions, 299 flow. Second operand 7 states and 325 transitions. [2024-11-08 18:44:27,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 150 transitions, 749 flow [2024-11-08 18:44:27,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 150 transitions, 746 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 18:44:27,752 INFO L231 Difference]: Finished difference. Result has 88 places, 89 transitions, 370 flow [2024-11-08 18:44:27,756 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=370, PETRI_PLACES=88, PETRI_TRANSITIONS=89} [2024-11-08 18:44:27,757 INFO L277 CegarLoopForPetriNet]: 67 programPoint places, 21 predicate places. [2024-11-08 18:44:27,757 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 89 transitions, 370 flow [2024-11-08 18:44:27,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.333333333333336) internal successors, (224), 6 states have internal predecessors, (224), 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-08 18:44:27,757 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:44:27,757 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, 1, 1, 1, 1] [2024-11-08 18:44:27,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 18:44:27,758 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-08 18:44:27,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:44:27,759 INFO L85 PathProgramCache]: Analyzing trace with hash 356522934, now seen corresponding path program 1 times [2024-11-08 18:44:27,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:44:27,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047934840] [2024-11-08 18:44:27,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:44:27,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:44:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:44:28,223 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-08 18:44:28,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:44:28,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047934840] [2024-11-08 18:44:28,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047934840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:44:28,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:44:28,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:44:28,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524200501] [2024-11-08 18:44:28,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:44:28,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:44:28,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:44:28,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:44:28,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:44:28,316 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 73 [2024-11-08 18:44:28,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 89 transitions, 370 flow. Second operand has 6 states, 6 states have (on average 37.333333333333336) internal successors, (224), 6 states have internal predecessors, (224), 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-08 18:44:28,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:44:28,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 73 [2024-11-08 18:44:28,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:44:30,329 INFO L124 PetriNetUnfolderBase]: 12355/19432 cut-off events. [2024-11-08 18:44:30,329 INFO L125 PetriNetUnfolderBase]: For 8047/8095 co-relation queries the response was YES. [2024-11-08 18:44:30,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42933 conditions, 19432 events. 12355/19432 cut-off events. For 8047/8095 co-relation queries the response was YES. Maximal size of possible extension queue 1019. Compared 150337 event pairs, 3544 based on Foata normal form. 66/17989 useless extension candidates. Maximal degree in co-relation 33645. Up to 10808 conditions per place. [2024-11-08 18:44:30,467 INFO L140 encePairwiseOnDemand]: 63/73 looper letters, 96 selfloop transitions, 15 changer transitions 5/145 dead transitions. [2024-11-08 18:44:30,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 145 transitions, 763 flow [2024-11-08 18:44:30,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 18:44:30,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-08 18:44:30,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 355 transitions. [2024-11-08 18:44:30,469 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6078767123287672 [2024-11-08 18:44:30,470 INFO L175 Difference]: Start difference. First operand has 88 places, 89 transitions, 370 flow. Second operand 8 states and 355 transitions. [2024-11-08 18:44:30,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 145 transitions, 763 flow [2024-11-08 18:44:30,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 145 transitions, 760 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 18:44:30,479 INFO L231 Difference]: Finished difference. Result has 97 places, 94 transitions, 434 flow [2024-11-08 18:44:30,480 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=434, PETRI_PLACES=97, PETRI_TRANSITIONS=94} [2024-11-08 18:44:30,480 INFO L277 CegarLoopForPetriNet]: 67 programPoint places, 30 predicate places. [2024-11-08 18:44:30,481 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 94 transitions, 434 flow [2024-11-08 18:44:30,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.333333333333336) internal successors, (224), 6 states have internal predecessors, (224), 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-08 18:44:30,481 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:44:30,481 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, 1, 1, 1, 1] [2024-11-08 18:44:30,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 18:44:30,482 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-08 18:44:30,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:44:30,482 INFO L85 PathProgramCache]: Analyzing trace with hash 698498076, now seen corresponding path program 2 times [2024-11-08 18:44:30,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:44:30,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085773391] [2024-11-08 18:44:30,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:44:30,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:44:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:44:31,018 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-08 18:44:31,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:44:31,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085773391] [2024-11-08 18:44:31,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085773391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:44:31,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:44:31,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:44:31,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894560137] [2024-11-08 18:44:31,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:44:31,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:44:31,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:44:31,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:44:31,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:44:31,115 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 73 [2024-11-08 18:44:31,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 94 transitions, 434 flow. Second operand has 6 states, 6 states have (on average 37.333333333333336) internal successors, (224), 6 states have internal predecessors, (224), 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-08 18:44:31,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:44:31,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 73 [2024-11-08 18:44:31,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:44:33,287 INFO L124 PetriNetUnfolderBase]: 11016/17515 cut-off events. [2024-11-08 18:44:33,287 INFO L125 PetriNetUnfolderBase]: For 9865/10151 co-relation queries the response was YES. [2024-11-08 18:44:33,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40457 conditions, 17515 events. 11016/17515 cut-off events. For 9865/10151 co-relation queries the response was YES. Maximal size of possible extension queue 827. Compared 133103 event pairs, 3949 based on Foata normal form. 83/15866 useless extension candidates. Maximal degree in co-relation 34565. Up to 7856 conditions per place. [2024-11-08 18:44:33,422 INFO L140 encePairwiseOnDemand]: 64/73 looper letters, 72 selfloop transitions, 7 changer transitions 32/139 dead transitions. [2024-11-08 18:44:33,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 139 transitions, 765 flow [2024-11-08 18:44:33,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:44:33,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-08 18:44:33,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 315 transitions. [2024-11-08 18:44:33,424 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6164383561643836 [2024-11-08 18:44:33,424 INFO L175 Difference]: Start difference. First operand has 97 places, 94 transitions, 434 flow. Second operand 7 states and 315 transitions. [2024-11-08 18:44:33,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 139 transitions, 765 flow [2024-11-08 18:44:33,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 139 transitions, 752 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-08 18:44:33,458 INFO L231 Difference]: Finished difference. Result has 102 places, 85 transitions, 367 flow [2024-11-08 18:44:33,459 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=367, PETRI_PLACES=102, PETRI_TRANSITIONS=85} [2024-11-08 18:44:33,462 INFO L277 CegarLoopForPetriNet]: 67 programPoint places, 35 predicate places. [2024-11-08 18:44:33,462 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 85 transitions, 367 flow [2024-11-08 18:44:33,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.333333333333336) internal successors, (224), 6 states have internal predecessors, (224), 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-08 18:44:33,466 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:44:33,467 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, 1, 1, 1, 1, 1, 1] [2024-11-08 18:44:33,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 18:44:33,467 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-08 18:44:33,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:44:33,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1063043628, now seen corresponding path program 1 times [2024-11-08 18:44:33,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:44:33,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201425104] [2024-11-08 18:44:33,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:44:33,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:44:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:44:33,867 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-08 18:44:33,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:44:33,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201425104] [2024-11-08 18:44:33,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201425104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:44:33,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:44:33,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:44:33,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597225620] [2024-11-08 18:44:33,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:44:33,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:44:33,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:44:33,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:44:33,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:44:33,972 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 73 [2024-11-08 18:44:33,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 85 transitions, 367 flow. Second operand has 6 states, 6 states have (on average 40.0) internal successors, (240), 6 states have internal predecessors, (240), 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-08 18:44:33,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:44:33,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 73 [2024-11-08 18:44:33,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:44:35,644 INFO L124 PetriNetUnfolderBase]: 7832/12741 cut-off events. [2024-11-08 18:44:35,645 INFO L125 PetriNetUnfolderBase]: For 9500/9600 co-relation queries the response was YES. [2024-11-08 18:44:35,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31364 conditions, 12741 events. 7832/12741 cut-off events. For 9500/9600 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 95793 event pairs, 1681 based on Foata normal form. 862/12946 useless extension candidates. Maximal degree in co-relation 26363. Up to 6765 conditions per place. [2024-11-08 18:44:35,731 INFO L140 encePairwiseOnDemand]: 65/73 looper letters, 91 selfloop transitions, 8 changer transitions 5/137 dead transitions. [2024-11-08 18:44:35,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 137 transitions, 770 flow [2024-11-08 18:44:35,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:44:35,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-08 18:44:35,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 328 transitions. [2024-11-08 18:44:35,733 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6418786692759295 [2024-11-08 18:44:35,733 INFO L175 Difference]: Start difference. First operand has 102 places, 85 transitions, 367 flow. Second operand 7 states and 328 transitions. [2024-11-08 18:44:35,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 137 transitions, 770 flow [2024-11-08 18:44:35,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 137 transitions, 726 flow, removed 14 selfloop flow, removed 10 redundant places. [2024-11-08 18:44:35,772 INFO L231 Difference]: Finished difference. Result has 94 places, 86 transitions, 360 flow [2024-11-08 18:44:35,773 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=360, PETRI_PLACES=94, PETRI_TRANSITIONS=86} [2024-11-08 18:44:35,773 INFO L277 CegarLoopForPetriNet]: 67 programPoint places, 27 predicate places. [2024-11-08 18:44:35,774 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 86 transitions, 360 flow [2024-11-08 18:44:35,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.0) internal successors, (240), 6 states have internal predecessors, (240), 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-08 18:44:35,774 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:44:35,774 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, 1, 1, 1, 1, 1, 1] [2024-11-08 18:44:35,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 18:44:35,775 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-08 18:44:35,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:44:35,776 INFO L85 PathProgramCache]: Analyzing trace with hash 239495713, now seen corresponding path program 1 times [2024-11-08 18:44:35,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:44:35,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442113288] [2024-11-08 18:44:35,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:44:35,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:44:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:44:36,184 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-08 18:44:36,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:44:36,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442113288] [2024-11-08 18:44:36,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442113288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:44:36,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:44:36,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:44:36,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427869659] [2024-11-08 18:44:36,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:44:36,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:44:36,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:44:36,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:44:36,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:44:36,278 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 73 [2024-11-08 18:44:36,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 86 transitions, 360 flow. Second operand has 6 states, 6 states have (on average 40.0) internal successors, (240), 6 states have internal predecessors, (240), 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-08 18:44:36,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:44:36,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 73 [2024-11-08 18:44:36,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:44:37,622 INFO L124 PetriNetUnfolderBase]: 7203/11553 cut-off events. [2024-11-08 18:44:37,623 INFO L125 PetriNetUnfolderBase]: For 8377/8461 co-relation queries the response was YES. [2024-11-08 18:44:37,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28012 conditions, 11553 events. 7203/11553 cut-off events. For 8377/8461 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 82072 event pairs, 1078 based on Foata normal form. 618/11193 useless extension candidates. Maximal degree in co-relation 24846. Up to 7058 conditions per place. [2024-11-08 18:44:37,707 INFO L140 encePairwiseOnDemand]: 66/73 looper letters, 77 selfloop transitions, 5 changer transitions 5/120 dead transitions. [2024-11-08 18:44:37,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 120 transitions, 666 flow [2024-11-08 18:44:37,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:44:37,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 18:44:37,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 277 transitions. [2024-11-08 18:44:37,710 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.632420091324201 [2024-11-08 18:44:37,710 INFO L175 Difference]: Start difference. First operand has 94 places, 86 transitions, 360 flow. Second operand 6 states and 277 transitions. [2024-11-08 18:44:37,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 120 transitions, 666 flow [2024-11-08 18:44:37,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 120 transitions, 640 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-11-08 18:44:37,719 INFO L231 Difference]: Finished difference. Result has 94 places, 81 transitions, 316 flow [2024-11-08 18:44:37,719 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=316, PETRI_PLACES=94, PETRI_TRANSITIONS=81} [2024-11-08 18:44:37,720 INFO L277 CegarLoopForPetriNet]: 67 programPoint places, 27 predicate places. [2024-11-08 18:44:37,720 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 81 transitions, 316 flow [2024-11-08 18:44:37,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.0) internal successors, (240), 6 states have internal predecessors, (240), 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-08 18:44:37,721 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:44:37,721 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:44:37,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 18:44:37,722 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-08 18:44:37,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:44:37,722 INFO L85 PathProgramCache]: Analyzing trace with hash -336702675, now seen corresponding path program 1 times [2024-11-08 18:44:37,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:44:37,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630612451] [2024-11-08 18:44:37,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:44:37,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:44:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:44:37,787 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:44:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:44:37,901 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:44:37,902 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 18:44:37,903 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-11-08 18:44:37,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2024-11-08 18:44:37,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-11-08 18:44:37,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-11-08 18:44:37,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-11-08 18:44:37,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 18:44:37,906 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:44:38,030 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-08 18:44:38,031 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 18:44:38,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:44:38 BasicIcfg [2024-11-08 18:44:38,044 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 18:44:38,045 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 18:44:38,045 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 18:44:38,045 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 18:44:38,046 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:44:16" (3/4) ... [2024-11-08 18:44:38,051 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 18:44:38,212 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87f35854-e811-44ba-914a-820bfcf353d1/bin/uautomizer-verify-jihMAELWvX/witness.graphml [2024-11-08 18:44:38,213 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 18:44:38,213 INFO L158 Benchmark]: Toolchain (without parser) took 23717.56ms. Allocated memory was 153.1MB in the beginning and 6.3GB in the end (delta: 6.2GB). Free memory was 119.9MB in the beginning and 5.6GB in the end (delta: -5.5GB). Peak memory consumption was 704.7MB. Max. memory is 16.1GB. [2024-11-08 18:44:38,216 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 153.1MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:44:38,217 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.59ms. Allocated memory is still 153.1MB. Free memory was 119.9MB in the beginning and 104.6MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 18:44:38,217 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.13ms. Allocated memory is still 153.1MB. Free memory was 104.6MB in the beginning and 101.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 18:44:38,218 INFO L158 Benchmark]: Boogie Preprocessor took 77.20ms. Allocated memory is still 153.1MB. Free memory was 101.9MB in the beginning and 98.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 18:44:38,218 INFO L158 Benchmark]: RCFGBuilder took 1343.46ms. Allocated memory was 153.1MB in the beginning and 211.8MB in the end (delta: 58.7MB). Free memory was 98.3MB in the beginning and 126.1MB in the end (delta: -27.8MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2024-11-08 18:44:38,219 INFO L158 Benchmark]: TraceAbstraction took 21672.13ms. Allocated memory was 211.8MB in the beginning and 6.3GB in the end (delta: 6.1GB). Free memory was 125.1MB in the beginning and 5.6GB in the end (delta: -5.5GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-08 18:44:38,219 INFO L158 Benchmark]: Witness Printer took 167.76ms. Allocated memory is still 6.3GB. Free memory was 5.6GB in the beginning and 5.6GB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-08 18:44:38,221 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.19ms. Allocated memory is still 153.1MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 384.59ms. Allocated memory is still 153.1MB. Free memory was 119.9MB in the beginning and 104.6MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.13ms. Allocated memory is still 153.1MB. Free memory was 104.6MB in the beginning and 101.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.20ms. Allocated memory is still 153.1MB. Free memory was 101.9MB in the beginning and 98.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1343.46ms. Allocated memory was 153.1MB in the beginning and 211.8MB in the end (delta: 58.7MB). Free memory was 98.3MB in the beginning and 126.1MB in the end (delta: -27.8MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * TraceAbstraction took 21672.13ms. Allocated memory was 211.8MB in the beginning and 6.3GB in the end (delta: 6.1GB). Free memory was 125.1MB in the beginning and 5.6GB in the end (delta: -5.5GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 167.76ms. Allocated memory is still 6.3GB. Free memory was 5.6GB in the beginning and 5.6GB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. 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 FALSE 0 !(i < size) VAL [N=1, f={0: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, 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 TRUE 0 i < size VAL [N=1, f={0: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, total=0] [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 FALSE 0 !(i < size) VAL [N=1, f={0: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, 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 TRUE 0 i < size VAL [N=1, f={0: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, total=0] [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 FALSE 0 !(i < size) VAL [N=1, f={0: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] [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 TRUE 0 i < size VAL [N=1, f={0: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] [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] [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 FALSE 2 !(\read(cond)) 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, 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] [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] [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 TRUE 4 \read(cond) VAL [N=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] [L125] 4 return 0; [L51] COND FALSE 1 !(\read(cond)) VAL [N=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] [L51] COND TRUE 1 \read(cond) 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] [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 TRUE 2 \read(cond) VAL [N=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] [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 TRUE 1 \read(cond) VAL [N=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] [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 FALSE 3 !(\read(cond)) VAL [N=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 TRUE 3 \read(cond) 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, total=7] [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: 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. - 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: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 98 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: 21.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 17.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 874 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 698 mSDsluCounter, 315 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 254 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1560 IncrementalHoareTripleChecker+Invalid, 1610 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 61 mSDtfsCounter, 1560 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=434occurred in iteration=7, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 512 NumberOfCodeBlocks, 512 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 445 ConstructedInterpolants, 0 QuantifiedInterpolants, 1350 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 23/23 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-08 18:44:38,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87f35854-e811-44ba-914a-820bfcf353d1/bin/uautomizer-verify-jihMAELWvX/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