./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-atomic/lamport.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc 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_81ae6ca4-a954-4508-bd77-cfe6b6b26f0d/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ae6ca4-a954-4508-bd77-cfe6b6b26f0d/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ae6ca4-a954-4508-bd77-cfe6b6b26f0d/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ae6ca4-a954-4508-bd77-cfe6b6b26f0d/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-atomic/lamport.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ae6ca4-a954-4508-bd77-cfe6b6b26f0d/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ae6ca4-a954-4508-bd77-cfe6b6b26f0d/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c35b909c90b92e30d40b0275e3d226db26dbebaf39dc73a31d7e72eee871d214 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:28:28,261 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:28:28,330 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ae6ca4-a954-4508-bd77-cfe6b6b26f0d/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 04:28:28,336 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:28:28,337 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:28:28,362 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:28:28,363 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:28:28,364 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:28:28,364 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:28:28,365 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:28:28,365 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:28:28,366 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:28:28,367 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:28:28,367 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:28:28,368 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:28:28,368 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:28:28,369 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:28:28,369 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:28:28,370 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:28:28,370 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:28:28,371 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 04:28:28,371 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 04:28:28,372 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 04:28:28,372 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:28:28,372 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:28:28,373 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:28:28,373 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:28:28,374 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:28:28,374 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:28:28,375 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:28:28,375 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:28:28,375 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:28:28,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:28:28,376 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:28:28,377 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:28:28,377 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:28:28,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:28:28,378 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:28:28,378 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:28:28,379 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:28:28,379 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:28:28,379 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_81ae6ca4-a954-4508-bd77-cfe6b6b26f0d/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ae6ca4-a954-4508-bd77-cfe6b6b26f0d/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> c35b909c90b92e30d40b0275e3d226db26dbebaf39dc73a31d7e72eee871d214 [2023-11-29 04:28:28,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:28:28,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:28:28,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:28:28,651 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:28:28,652 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:28:28,653 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ae6ca4-a954-4508-bd77-cfe6b6b26f0d/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-atomic/lamport.i [2023-11-29 04:28:31,503 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:28:31,743 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:28:31,744 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ae6ca4-a954-4508-bd77-cfe6b6b26f0d/sv-benchmarks/c/pthread-atomic/lamport.i [2023-11-29 04:28:31,761 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ae6ca4-a954-4508-bd77-cfe6b6b26f0d/bin/uautomizer-verify-BQ2R08f2Ya/data/166ceb797/a9f6a75065dc44218f386187cbad5cd9/FLAG1b6586e90 [2023-11-29 04:28:31,777 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ae6ca4-a954-4508-bd77-cfe6b6b26f0d/bin/uautomizer-verify-BQ2R08f2Ya/data/166ceb797/a9f6a75065dc44218f386187cbad5cd9 [2023-11-29 04:28:31,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:28:31,781 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:28:31,783 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:28:31,783 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:28:31,789 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:28:31,790 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:28:31" (1/1) ... [2023-11-29 04:28:31,791 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7196005b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:28:31, skipping insertion in model container [2023-11-29 04:28:31,791 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:28:31" (1/1) ... [2023-11-29 04:28:31,839 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:28:32,186 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:28:32,198 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:28:32,244 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:28:32,276 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:28:32,276 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:28:32,284 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:28:32,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:28:32 WrapperNode [2023-11-29 04:28:32,285 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:28:32,286 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:28:32,286 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:28:32,286 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:28:32,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:28:32" (1/1) ... [2023-11-29 04:28:32,309 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:28:32" (1/1) ... [2023-11-29 04:28:32,336 INFO L138 Inliner]: procedures = 170, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 207 [2023-11-29 04:28:32,337 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:28:32,338 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:28:32,338 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:28:32,338 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:28:32,350 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:28:32" (1/1) ... [2023-11-29 04:28:32,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:28:32" (1/1) ... [2023-11-29 04:28:32,354 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:28:32" (1/1) ... [2023-11-29 04:28:32,370 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2023-11-29 04:28:32,370 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:28:32" (1/1) ... [2023-11-29 04:28:32,370 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:28:32" (1/1) ... [2023-11-29 04:28:32,378 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:28:32" (1/1) ... [2023-11-29 04:28:32,382 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:28:32" (1/1) ... [2023-11-29 04:28:32,385 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:28:32" (1/1) ... [2023-11-29 04:28:32,386 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:28:32" (1/1) ... [2023-11-29 04:28:32,390 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:28:32,391 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:28:32,391 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:28:32,392 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:28:32,393 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:28:32" (1/1) ... [2023-11-29 04:28:32,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:28:32,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ae6ca4-a954-4508-bd77-cfe6b6b26f0d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:28:32,422 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ae6ca4-a954-4508-bd77-cfe6b6b26f0d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:28:32,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ae6ca4-a954-4508-bd77-cfe6b6b26f0d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:28:32,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 04:28:32,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 04:28:32,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 04:28:32,458 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2023-11-29 04:28:32,458 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2023-11-29 04:28:32,458 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-29 04:28:32,458 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-29 04:28:32,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 04:28:32,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 04:28:32,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 04:28:32,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 04:28:32,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:28:32,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:28:32,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:28:32,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:28:32,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 04:28:32,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 04:28:32,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 04:28:32,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:28:32,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:28:32,463 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 04:28:32,612 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:28:32,615 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:28:32,836 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:28:32,915 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:28:32,915 INFO L309 CfgBuilder]: Removed 8 assume(true) statements. [2023-11-29 04:28:32,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:28:32 BoogieIcfgContainer [2023-11-29 04:28:32,916 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:28:32,919 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:28:32,919 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:28:32,922 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:28:32,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:28:31" (1/3) ... [2023-11-29 04:28:32,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7928aa67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:28:32, skipping insertion in model container [2023-11-29 04:28:32,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:28:32" (2/3) ... [2023-11-29 04:28:32,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7928aa67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:28:32, skipping insertion in model container [2023-11-29 04:28:32,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:28:32" (3/3) ... [2023-11-29 04:28:32,925 INFO L112 eAbstractionObserver]: Analyzing ICFG lamport.i [2023-11-29 04:28:32,946 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:28:32,946 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-29 04:28:32,946 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 04:28:33,038 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-29 04:28:33,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 109 transitions, 232 flow [2023-11-29 04:28:33,114 INFO L124 PetriNetUnfolderBase]: 20/107 cut-off events. [2023-11-29 04:28:33,114 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 04:28:33,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 107 events. 20/107 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 299 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 95. Up to 4 conditions per place. [2023-11-29 04:28:33,119 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 109 transitions, 232 flow [2023-11-29 04:28:33,124 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 106 transitions, 224 flow [2023-11-29 04:28:33,133 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:28:33,140 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@4bfe4fbf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:28:33,140 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-11-29 04:28:33,143 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 04:28:33,143 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 04:28:33,143 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:28:33,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:28:33,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 04:28:33,145 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-29 04:28:33,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:28:33,149 INFO L85 PathProgramCache]: Analyzing trace with hash 12106, now seen corresponding path program 1 times [2023-11-29 04:28:33,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:28:33,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559001038] [2023-11-29 04:28:33,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:28:33,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:28:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:28:33,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:28:33,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:28:33,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559001038] [2023-11-29 04:28:33,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559001038] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:28:33,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:28:33,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:28:33,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518480723] [2023-11-29 04:28:33,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:28:33,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:28:33,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:28:33,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:28:33,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:28:33,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 109 [2023-11-29 04:28:33,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 106 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:33,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:28:33,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 109 [2023-11-29 04:28:33,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:28:33,721 INFO L124 PetriNetUnfolderBase]: 354/915 cut-off events. [2023-11-29 04:28:33,721 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-29 04:28:33,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1373 conditions, 915 events. 354/915 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5857 event pairs, 138 based on Foata normal form. 157/907 useless extension candidates. Maximal degree in co-relation 1292. Up to 432 conditions per place. [2023-11-29 04:28:33,736 INFO L140 encePairwiseOnDemand]: 97/109 looper letters, 20 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2023-11-29 04:28:33,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 94 transitions, 244 flow [2023-11-29 04:28:33,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:28:33,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:28:33,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2023-11-29 04:28:33,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7951070336391437 [2023-11-29 04:28:33,752 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 260 transitions. [2023-11-29 04:28:33,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 260 transitions. [2023-11-29 04:28:33,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:28:33,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 260 transitions. [2023-11-29 04:28:33,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:33,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:33,766 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:33,767 INFO L175 Difference]: Start difference. First operand has 93 places, 106 transitions, 224 flow. Second operand 3 states and 260 transitions. [2023-11-29 04:28:33,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 94 transitions, 244 flow [2023-11-29 04:28:33,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 94 transitions, 236 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 04:28:33,776 INFO L231 Difference]: Finished difference. Result has 87 places, 94 transitions, 196 flow [2023-11-29 04:28:33,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=87, PETRI_TRANSITIONS=94} [2023-11-29 04:28:33,782 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -6 predicate places. [2023-11-29 04:28:33,782 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 94 transitions, 196 flow [2023-11-29 04:28:33,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:33,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:28:33,783 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 04:28:33,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:28:33,784 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-29 04:28:33,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:28:33,784 INFO L85 PathProgramCache]: Analyzing trace with hash 12107, now seen corresponding path program 1 times [2023-11-29 04:28:33,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:28:33,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017963026] [2023-11-29 04:28:33,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:28:33,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:28:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:28:33,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:28:33,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:28:33,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017963026] [2023-11-29 04:28:33,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017963026] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:28:33,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:28:33,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:28:33,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630085766] [2023-11-29 04:28:33,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:28:33,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:28:33,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:28:33,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:28:33,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:28:33,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 109 [2023-11-29 04:28:33,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 94 transitions, 196 flow. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:33,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:28:33,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 109 [2023-11-29 04:28:33,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:28:34,059 INFO L124 PetriNetUnfolderBase]: 234/714 cut-off events. [2023-11-29 04:28:34,059 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-29 04:28:34,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1002 conditions, 714 events. 234/714 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4485 event pairs, 78 based on Foata normal form. 37/637 useless extension candidates. Maximal degree in co-relation 992. Up to 275 conditions per place. [2023-11-29 04:28:34,066 INFO L140 encePairwiseOnDemand]: 105/109 looper letters, 18 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2023-11-29 04:28:34,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 92 transitions, 232 flow [2023-11-29 04:28:34,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:28:34,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:28:34,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 256 transitions. [2023-11-29 04:28:34,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7828746177370031 [2023-11-29 04:28:34,070 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 256 transitions. [2023-11-29 04:28:34,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 256 transitions. [2023-11-29 04:28:34,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:28:34,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 256 transitions. [2023-11-29 04:28:34,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:34,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:34,074 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:34,075 INFO L175 Difference]: Start difference. First operand has 87 places, 94 transitions, 196 flow. Second operand 3 states and 256 transitions. [2023-11-29 04:28:34,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 92 transitions, 232 flow [2023-11-29 04:28:34,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 92 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:28:34,078 INFO L231 Difference]: Finished difference. Result has 85 places, 92 transitions, 192 flow [2023-11-29 04:28:34,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=85, PETRI_TRANSITIONS=92} [2023-11-29 04:28:34,079 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -8 predicate places. [2023-11-29 04:28:34,079 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 92 transitions, 192 flow [2023-11-29 04:28:34,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:34,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:28:34,080 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 04:28:34,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:28:34,081 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-29 04:28:34,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:28:34,081 INFO L85 PathProgramCache]: Analyzing trace with hash 361109270, now seen corresponding path program 1 times [2023-11-29 04:28:34,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:28:34,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558565623] [2023-11-29 04:28:34,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:28:34,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:28:34,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:28:34,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:28:34,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:28:34,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558565623] [2023-11-29 04:28:34,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558565623] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:28:34,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:28:34,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:28:34,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524465531] [2023-11-29 04:28:34,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:28:34,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:28:34,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:28:34,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:28:34,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:28:34,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 109 [2023-11-29 04:28:34,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 92 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:34,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:28:34,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 109 [2023-11-29 04:28:34,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:28:34,304 INFO L124 PetriNetUnfolderBase]: 254/736 cut-off events. [2023-11-29 04:28:34,304 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-29 04:28:34,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 736 events. 254/736 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4557 event pairs, 88 based on Foata normal form. 0/627 useless extension candidates. Maximal degree in co-relation 1046. Up to 307 conditions per place. [2023-11-29 04:28:34,313 INFO L140 encePairwiseOnDemand]: 105/109 looper letters, 20 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2023-11-29 04:28:34,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 90 transitions, 232 flow [2023-11-29 04:28:34,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:28:34,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:28:34,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2023-11-29 04:28:34,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7706422018348624 [2023-11-29 04:28:34,317 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 252 transitions. [2023-11-29 04:28:34,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 252 transitions. [2023-11-29 04:28:34,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:28:34,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 252 transitions. [2023-11-29 04:28:34,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:34,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:34,324 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:34,324 INFO L175 Difference]: Start difference. First operand has 85 places, 92 transitions, 192 flow. Second operand 3 states and 252 transitions. [2023-11-29 04:28:34,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 90 transitions, 232 flow [2023-11-29 04:28:34,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 90 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:28:34,331 INFO L231 Difference]: Finished difference. Result has 83 places, 90 transitions, 188 flow [2023-11-29 04:28:34,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=83, PETRI_TRANSITIONS=90} [2023-11-29 04:28:34,333 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -10 predicate places. [2023-11-29 04:28:34,333 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 90 transitions, 188 flow [2023-11-29 04:28:34,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:34,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:28:34,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 04:28:34,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 04:28:34,335 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-29 04:28:34,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:28:34,336 INFO L85 PathProgramCache]: Analyzing trace with hash 361109271, now seen corresponding path program 1 times [2023-11-29 04:28:34,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:28:34,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39188203] [2023-11-29 04:28:34,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:28:34,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:28:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:28:34,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:28:34,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:28:34,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39188203] [2023-11-29 04:28:34,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39188203] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:28:34,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:28:34,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:28:34,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358054632] [2023-11-29 04:28:34,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:28:34,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:28:34,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:28:34,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:28:34,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:28:34,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 109 [2023-11-29 04:28:34,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 90 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:34,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:28:34,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 109 [2023-11-29 04:28:34,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:28:34,534 INFO L124 PetriNetUnfolderBase]: 254/727 cut-off events. [2023-11-29 04:28:34,534 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-29 04:28:34,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1047 conditions, 727 events. 254/727 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4477 event pairs, 88 based on Foata normal form. 0/618 useless extension candidates. Maximal degree in co-relation 1037. Up to 307 conditions per place. [2023-11-29 04:28:34,541 INFO L140 encePairwiseOnDemand]: 105/109 looper letters, 20 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2023-11-29 04:28:34,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 88 transitions, 228 flow [2023-11-29 04:28:34,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:28:34,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:28:34,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2023-11-29 04:28:34,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7706422018348624 [2023-11-29 04:28:34,543 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 252 transitions. [2023-11-29 04:28:34,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 252 transitions. [2023-11-29 04:28:34,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:28:34,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 252 transitions. [2023-11-29 04:28:34,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:34,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:34,546 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:34,546 INFO L175 Difference]: Start difference. First operand has 83 places, 90 transitions, 188 flow. Second operand 3 states and 252 transitions. [2023-11-29 04:28:34,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 88 transitions, 228 flow [2023-11-29 04:28:34,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 88 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:28:34,548 INFO L231 Difference]: Finished difference. Result has 81 places, 88 transitions, 184 flow [2023-11-29 04:28:34,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=81, PETRI_TRANSITIONS=88} [2023-11-29 04:28:34,549 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -12 predicate places. [2023-11-29 04:28:34,550 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 88 transitions, 184 flow [2023-11-29 04:28:34,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:34,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:28:34,550 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:28:34,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 04:28:34,551 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-29 04:28:34,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:28:34,551 INFO L85 PathProgramCache]: Analyzing trace with hash -466095391, now seen corresponding path program 1 times [2023-11-29 04:28:34,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:28:34,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632399414] [2023-11-29 04:28:34,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:28:34,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:28:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:28:34,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:28:34,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:28:34,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632399414] [2023-11-29 04:28:34,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632399414] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:28:34,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:28:34,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:28:34,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966035922] [2023-11-29 04:28:34,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:28:34,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:28:34,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:28:34,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:28:34,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:28:34,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 109 [2023-11-29 04:28:34,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 88 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:34,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:28:34,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 109 [2023-11-29 04:28:34,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:28:34,716 INFO L124 PetriNetUnfolderBase]: 283/779 cut-off events. [2023-11-29 04:28:34,717 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-29 04:28:34,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 779 events. 283/779 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4819 event pairs, 58 based on Foata normal form. 16/689 useless extension candidates. Maximal degree in co-relation 1159. Up to 217 conditions per place. [2023-11-29 04:28:34,722 INFO L140 encePairwiseOnDemand]: 104/109 looper letters, 32 selfloop transitions, 3 changer transitions 0/100 dead transitions. [2023-11-29 04:28:34,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 100 transitions, 282 flow [2023-11-29 04:28:34,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:28:34,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:28:34,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 268 transitions. [2023-11-29 04:28:34,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8195718654434251 [2023-11-29 04:28:34,725 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 268 transitions. [2023-11-29 04:28:34,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 268 transitions. [2023-11-29 04:28:34,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:28:34,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 268 transitions. [2023-11-29 04:28:34,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:34,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:34,727 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:34,727 INFO L175 Difference]: Start difference. First operand has 81 places, 88 transitions, 184 flow. Second operand 3 states and 268 transitions. [2023-11-29 04:28:34,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 100 transitions, 282 flow [2023-11-29 04:28:34,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 100 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:28:34,730 INFO L231 Difference]: Finished difference. Result has 83 places, 89 transitions, 200 flow [2023-11-29 04:28:34,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=83, PETRI_TRANSITIONS=89} [2023-11-29 04:28:34,732 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -10 predicate places. [2023-11-29 04:28:34,732 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 89 transitions, 200 flow [2023-11-29 04:28:34,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:34,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:28:34,733 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:28:34,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 04:28:34,733 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr2Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-29 04:28:34,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:28:34,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1017198935, now seen corresponding path program 1 times [2023-11-29 04:28:34,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:28:34,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503092647] [2023-11-29 04:28:34,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:28:34,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:28:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:28:34,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:28:34,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:28:34,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503092647] [2023-11-29 04:28:34,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503092647] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:28:34,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:28:34,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:28:34,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86522608] [2023-11-29 04:28:34,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:28:34,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:28:34,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:28:34,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:28:34,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:28:34,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 109 [2023-11-29 04:28:34,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 89 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:34,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:28:34,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 109 [2023-11-29 04:28:34,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:28:34,901 INFO L124 PetriNetUnfolderBase]: 264/740 cut-off events. [2023-11-29 04:28:34,901 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2023-11-29 04:28:34,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1229 conditions, 740 events. 264/740 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4610 event pairs, 79 based on Foata normal form. 21/661 useless extension candidates. Maximal degree in co-relation 710. Up to 262 conditions per place. [2023-11-29 04:28:34,907 INFO L140 encePairwiseOnDemand]: 105/109 looper letters, 32 selfloop transitions, 2 changer transitions 0/99 dead transitions. [2023-11-29 04:28:34,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 99 transitions, 290 flow [2023-11-29 04:28:34,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:28:34,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:28:34,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 267 transitions. [2023-11-29 04:28:34,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8165137614678899 [2023-11-29 04:28:34,909 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 267 transitions. [2023-11-29 04:28:34,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 267 transitions. [2023-11-29 04:28:34,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:28:34,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 267 transitions. [2023-11-29 04:28:34,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:34,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:34,912 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:34,912 INFO L175 Difference]: Start difference. First operand has 83 places, 89 transitions, 200 flow. Second operand 3 states and 267 transitions. [2023-11-29 04:28:34,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 99 transitions, 290 flow [2023-11-29 04:28:34,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 99 transitions, 284 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:28:34,917 INFO L231 Difference]: Finished difference. Result has 84 places, 89 transitions, 204 flow [2023-11-29 04:28:34,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=84, PETRI_TRANSITIONS=89} [2023-11-29 04:28:34,918 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -9 predicate places. [2023-11-29 04:28:34,918 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 89 transitions, 204 flow [2023-11-29 04:28:34,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:34,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:28:34,919 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:28:34,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 04:28:34,919 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-29 04:28:34,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:28:34,920 INFO L85 PathProgramCache]: Analyzing trace with hash 827322681, now seen corresponding path program 1 times [2023-11-29 04:28:34,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:28:34,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242406954] [2023-11-29 04:28:34,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:28:34,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:28:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:28:34,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:28:34,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:28:34,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242406954] [2023-11-29 04:28:34,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242406954] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:28:34,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:28:34,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:28:34,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616653691] [2023-11-29 04:28:34,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:28:34,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:28:34,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:28:34,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:28:34,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:28:35,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 109 [2023-11-29 04:28:35,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 89 transitions, 204 flow. Second operand has 4 states, 4 states have (on average 71.25) internal successors, (285), 4 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:35,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:28:35,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 109 [2023-11-29 04:28:35,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:28:35,309 INFO L124 PetriNetUnfolderBase]: 850/2170 cut-off events. [2023-11-29 04:28:35,309 INFO L125 PetriNetUnfolderBase]: For 192/202 co-relation queries the response was YES. [2023-11-29 04:28:35,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3621 conditions, 2170 events. 850/2170 cut-off events. For 192/202 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 16020 event pairs, 198 based on Foata normal form. 62/2113 useless extension candidates. Maximal degree in co-relation 2561. Up to 648 conditions per place. [2023-11-29 04:28:35,322 INFO L140 encePairwiseOnDemand]: 95/109 looper letters, 59 selfloop transitions, 15 changer transitions 0/132 dead transitions. [2023-11-29 04:28:35,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 132 transitions, 444 flow [2023-11-29 04:28:35,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:28:35,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:28:35,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2023-11-29 04:28:35,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7834862385321101 [2023-11-29 04:28:35,325 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 427 transitions. [2023-11-29 04:28:35,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 427 transitions. [2023-11-29 04:28:35,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:28:35,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 427 transitions. [2023-11-29 04:28:35,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:35,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:35,330 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:35,330 INFO L175 Difference]: Start difference. First operand has 84 places, 89 transitions, 204 flow. Second operand 5 states and 427 transitions. [2023-11-29 04:28:35,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 132 transitions, 444 flow [2023-11-29 04:28:35,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 132 transitions, 442 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:28:35,335 INFO L231 Difference]: Finished difference. Result has 91 places, 104 transitions, 336 flow [2023-11-29 04:28:35,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=336, PETRI_PLACES=91, PETRI_TRANSITIONS=104} [2023-11-29 04:28:35,336 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -2 predicate places. [2023-11-29 04:28:35,337 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 104 transitions, 336 flow [2023-11-29 04:28:35,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.25) internal successors, (285), 4 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:35,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:28:35,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:28:35,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 04:28:35,338 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-29 04:28:35,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:28:35,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1700912099, now seen corresponding path program 2 times [2023-11-29 04:28:35,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:28:35,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256811579] [2023-11-29 04:28:35,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:28:35,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:28:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:28:35,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:28:35,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:28:35,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256811579] [2023-11-29 04:28:35,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256811579] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:28:35,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:28:35,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:28:35,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115713204] [2023-11-29 04:28:35,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:28:35,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:28:35,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:28:35,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:28:35,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:28:35,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 109 [2023-11-29 04:28:35,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 104 transitions, 336 flow. Second operand has 4 states, 4 states have (on average 71.25) internal successors, (285), 4 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:35,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:28:35,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 109 [2023-11-29 04:28:35,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:28:35,817 INFO L124 PetriNetUnfolderBase]: 1085/2879 cut-off events. [2023-11-29 04:28:35,818 INFO L125 PetriNetUnfolderBase]: For 1293/1465 co-relation queries the response was YES. [2023-11-29 04:28:35,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5955 conditions, 2879 events. 1085/2879 cut-off events. For 1293/1465 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 22380 event pairs, 309 based on Foata normal form. 140/2905 useless extension candidates. Maximal degree in co-relation 3308. Up to 1022 conditions per place. [2023-11-29 04:28:35,850 INFO L140 encePairwiseOnDemand]: 95/109 looper letters, 61 selfloop transitions, 16 changer transitions 0/145 dead transitions. [2023-11-29 04:28:35,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 145 transitions, 615 flow [2023-11-29 04:28:35,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:28:35,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:28:35,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 425 transitions. [2023-11-29 04:28:35,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7798165137614679 [2023-11-29 04:28:35,853 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 425 transitions. [2023-11-29 04:28:35,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 425 transitions. [2023-11-29 04:28:35,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:28:35,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 425 transitions. [2023-11-29 04:28:35,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:35,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:35,858 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:35,858 INFO L175 Difference]: Start difference. First operand has 91 places, 104 transitions, 336 flow. Second operand 5 states and 425 transitions. [2023-11-29 04:28:35,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 145 transitions, 615 flow [2023-11-29 04:28:35,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 145 transitions, 615 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 04:28:35,870 INFO L231 Difference]: Finished difference. Result has 99 places, 119 transitions, 486 flow [2023-11-29 04:28:35,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=486, PETRI_PLACES=99, PETRI_TRANSITIONS=119} [2023-11-29 04:28:35,871 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 6 predicate places. [2023-11-29 04:28:35,871 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 119 transitions, 486 flow [2023-11-29 04:28:35,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.25) internal successors, (285), 4 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:35,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:28:35,872 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:28:35,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 04:28:35,872 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-29 04:28:35,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:28:35,873 INFO L85 PathProgramCache]: Analyzing trace with hash 440520921, now seen corresponding path program 3 times [2023-11-29 04:28:35,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:28:35,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795867180] [2023-11-29 04:28:35,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:28:35,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:28:35,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:28:35,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:28:35,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:28:35,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795867180] [2023-11-29 04:28:35,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795867180] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:28:35,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:28:35,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:28:35,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745151888] [2023-11-29 04:28:35,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:28:35,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:28:35,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:28:35,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:28:35,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:28:35,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 109 [2023-11-29 04:28:35,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 119 transitions, 486 flow. Second operand has 4 states, 4 states have (on average 78.25) internal successors, (313), 4 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:35,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:28:35,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 109 [2023-11-29 04:28:35,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:28:36,418 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([430] L840-->thr2EXIT: Formula: (and (= |v_thr2Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thr2Thread1of1ForFork1_#res#1.base_1| 0)) InVars {} OutVars{thr2Thread1of1ForFork1_#res#1.offset=|v_thr2Thread1of1ForFork1_#res#1.offset_1|, thr2Thread1of1ForFork1_#res#1.base=|v_thr2Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_#res#1.offset, thr2Thread1of1ForFork1_#res#1.base][88], [Black: 128#(= ~y~0 1), Black: 131#(and (= |thr2Thread1of1ForFork1_~y2~0#1| 1) (= ~y~0 1)), 73#thr2EXITtrue, Black: 129#(= |thr2Thread1of1ForFork1_~y2~0#1| 1), 137#true, 53#L847true, 148#true, 81#L710true, Black: 139#(= 2 ~y~0), Black: 140#(= |thr1Thread1of1ForFork0_~y1~0#1| 2), Black: 142#(and (= |thr1Thread1of1ForFork0_~y1~0#1| 2) (= 2 ~y~0)), Black: 117#(= ~X~0 0), 123#(= ~X~0 1), 126#true]) [2023-11-29 04:28:36,418 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-29 04:28:36,418 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 04:28:36,418 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-29 04:28:36,418 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:28:36,730 INFO L124 PetriNetUnfolderBase]: 1908/5949 cut-off events. [2023-11-29 04:28:36,730 INFO L125 PetriNetUnfolderBase]: For 3384/3799 co-relation queries the response was YES. [2023-11-29 04:28:36,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12838 conditions, 5949 events. 1908/5949 cut-off events. For 3384/3799 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 56479 event pairs, 350 based on Foata normal form. 230/5816 useless extension candidates. Maximal degree in co-relation 7178. Up to 777 conditions per place. [2023-11-29 04:28:36,790 INFO L140 encePairwiseOnDemand]: 105/109 looper letters, 67 selfloop transitions, 6 changer transitions 0/168 dead transitions. [2023-11-29 04:28:36,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 168 transitions, 806 flow [2023-11-29 04:28:36,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:28:36,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:28:36,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 454 transitions. [2023-11-29 04:28:36,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8330275229357799 [2023-11-29 04:28:36,793 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 454 transitions. [2023-11-29 04:28:36,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 454 transitions. [2023-11-29 04:28:36,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:28:36,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 454 transitions. [2023-11-29 04:28:36,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:36,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:36,797 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:36,797 INFO L175 Difference]: Start difference. First operand has 99 places, 119 transitions, 486 flow. Second operand 5 states and 454 transitions. [2023-11-29 04:28:36,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 168 transitions, 806 flow [2023-11-29 04:28:36,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 168 transitions, 804 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-29 04:28:36,810 INFO L231 Difference]: Finished difference. Result has 107 places, 125 transitions, 534 flow [2023-11-29 04:28:36,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=534, PETRI_PLACES=107, PETRI_TRANSITIONS=125} [2023-11-29 04:28:36,811 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 14 predicate places. [2023-11-29 04:28:36,811 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 125 transitions, 534 flow [2023-11-29 04:28:36,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.25) internal successors, (313), 4 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:36,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:28:36,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:28:36,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 04:28:36,812 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-29 04:28:36,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:28:36,813 INFO L85 PathProgramCache]: Analyzing trace with hash -674076855, now seen corresponding path program 4 times [2023-11-29 04:28:36,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:28:36,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128744133] [2023-11-29 04:28:36,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:28:36,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:28:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:28:36,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:28:36,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:28:36,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128744133] [2023-11-29 04:28:36,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128744133] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:28:36,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:28:36,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:28:36,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802085398] [2023-11-29 04:28:36,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:28:36,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:28:36,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:28:36,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:28:36,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:28:36,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 109 [2023-11-29 04:28:36,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 125 transitions, 534 flow. Second operand has 4 states, 4 states have (on average 78.25) internal successors, (313), 4 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:36,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:28:36,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 109 [2023-11-29 04:28:36,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:28:37,633 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([472] L770-->thr1EXIT: Formula: (and (= |v_thr1Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thr1Thread1of1ForFork0_#res#1.base_1| 0)) InVars {} OutVars{thr1Thread1of1ForFork0_#res#1.base=|v_thr1Thread1of1ForFork0_#res#1.base_1|, thr1Thread1of1ForFork0_#res#1.offset=|v_thr1Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_#res#1.offset, thr1Thread1of1ForFork0_#res#1.base][157], [83#thr1EXITtrue, 162#(= |thr2Thread1of1ForFork1_~x2~0#1| 1), Black: 128#(= ~y~0 1), Black: 131#(and (= |thr2Thread1of1ForFork1_~y2~0#1| 1) (= ~y~0 1)), Black: 129#(= |thr2Thread1of1ForFork1_~y2~0#1| 1), 137#true, 150#(= 2 ~x~0), Black: 139#(= 2 ~y~0), 5#L846-4true, Black: 140#(= |thr1Thread1of1ForFork0_~y1~0#1| 2), Black: 142#(and (= |thr1Thread1of1ForFork0_~y1~0#1| 2) (= 2 ~y~0)), Black: 115#true, 19#L780true, Black: 148#true, Black: 151#(= |thr1Thread1of1ForFork0_~x1~0#1| 2), Black: 153#(and (= 2 ~x~0) (= |thr1Thread1of1ForFork0_~x1~0#1| 2)), Black: 123#(= ~X~0 1), 126#true]) [2023-11-29 04:28:37,633 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2023-11-29 04:28:37,633 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 04:28:37,634 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 04:28:37,634 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-29 04:28:37,656 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([472] L770-->thr1EXIT: Formula: (and (= |v_thr1Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thr1Thread1of1ForFork0_#res#1.base_1| 0)) InVars {} OutVars{thr1Thread1of1ForFork0_#res#1.base=|v_thr1Thread1of1ForFork0_#res#1.base_1|, thr1Thread1of1ForFork0_#res#1.offset=|v_thr1Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_#res#1.offset, thr1Thread1of1ForFork0_#res#1.base][157], [83#thr1EXITtrue, Black: 128#(= ~y~0 1), 162#(= |thr2Thread1of1ForFork1_~x2~0#1| 1), Black: 131#(and (= |thr2Thread1of1ForFork1_~y2~0#1| 1) (= ~y~0 1)), Black: 129#(= |thr2Thread1of1ForFork1_~y2~0#1| 1), 137#true, 53#L847true, 150#(= 2 ~x~0), Black: 139#(= 2 ~y~0), Black: 140#(= |thr1Thread1of1ForFork0_~y1~0#1| 2), Black: 142#(and (= |thr1Thread1of1ForFork0_~y1~0#1| 2) (= 2 ~y~0)), Black: 115#true, 19#L780true, Black: 148#true, Black: 151#(= |thr1Thread1of1ForFork0_~x1~0#1| 2), Black: 123#(= ~X~0 1), 126#true, Black: 153#(and (= 2 ~x~0) (= |thr1Thread1of1ForFork0_~x1~0#1| 2))]) [2023-11-29 04:28:37,656 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2023-11-29 04:28:37,657 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-29 04:28:37,657 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-29 04:28:37,657 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-29 04:28:37,925 INFO L124 PetriNetUnfolderBase]: 2789/8869 cut-off events. [2023-11-29 04:28:37,925 INFO L125 PetriNetUnfolderBase]: For 6073/6712 co-relation queries the response was YES. [2023-11-29 04:28:37,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19989 conditions, 8869 events. 2789/8869 cut-off events. For 6073/6712 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 89084 event pairs, 500 based on Foata normal form. 349/8868 useless extension candidates. Maximal degree in co-relation 12292. Up to 1294 conditions per place. [2023-11-29 04:28:38,008 INFO L140 encePairwiseOnDemand]: 105/109 looper letters, 71 selfloop transitions, 11 changer transitions 0/179 dead transitions. [2023-11-29 04:28:38,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 179 transitions, 916 flow [2023-11-29 04:28:38,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:28:38,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:28:38,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 457 transitions. [2023-11-29 04:28:38,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8385321100917431 [2023-11-29 04:28:38,011 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 457 transitions. [2023-11-29 04:28:38,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 457 transitions. [2023-11-29 04:28:38,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:28:38,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 457 transitions. [2023-11-29 04:28:38,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:38,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:38,015 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:38,015 INFO L175 Difference]: Start difference. First operand has 107 places, 125 transitions, 534 flow. Second operand 5 states and 457 transitions. [2023-11-29 04:28:38,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 179 transitions, 916 flow [2023-11-29 04:28:38,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 179 transitions, 916 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 04:28:38,032 INFO L231 Difference]: Finished difference. Result has 115 places, 133 transitions, 628 flow [2023-11-29 04:28:38,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=628, PETRI_PLACES=115, PETRI_TRANSITIONS=133} [2023-11-29 04:28:38,033 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 22 predicate places. [2023-11-29 04:28:38,033 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 133 transitions, 628 flow [2023-11-29 04:28:38,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.25) internal successors, (313), 4 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:38,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:28:38,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:28:38,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 04:28:38,034 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-29 04:28:38,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:28:38,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1107602552, now seen corresponding path program 1 times [2023-11-29 04:28:38,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:28:38,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468026133] [2023-11-29 04:28:38,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:28:38,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:28:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:28:38,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:28:38,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:28:38,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468026133] [2023-11-29 04:28:38,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468026133] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:28:38,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:28:38,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:28:38,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170096190] [2023-11-29 04:28:38,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:28:38,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:28:38,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:28:38,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:28:38,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:28:38,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 109 [2023-11-29 04:28:38,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 133 transitions, 628 flow. Second operand has 4 states, 4 states have (on average 76.25) internal successors, (305), 4 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:38,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:28:38,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 109 [2023-11-29 04:28:38,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:28:38,699 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([424] L777-->L780: Formula: (= 2 v_~x~0_1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0][22], [172#(= ~b2~0 1), Black: 161#(= ~x~0 1), Black: 131#(and (= |thr2Thread1of1ForFork1_~y2~0#1| 1) (= ~y~0 1)), Black: 162#(= |thr2Thread1of1ForFork1_~x2~0#1| 1), Black: 129#(= |thr2Thread1of1ForFork1_~y2~0#1| 1), 137#true, Black: 164#(and (= ~x~0 1) (= |thr2Thread1of1ForFork1_~x2~0#1| 1)), Black: 126#true, 53#L847true, 159#true, 150#(= 2 ~x~0), Black: 139#(= 2 ~y~0), 57#L733true, Black: 140#(= |thr1Thread1of1ForFork0_~y1~0#1| 2), Black: 142#(and (= |thr1Thread1of1ForFork0_~y1~0#1| 2) (= 2 ~y~0)), Black: 115#true, 128#(= ~y~0 1), Black: 148#true, 19#L780true, Black: 151#(= |thr1Thread1of1ForFork0_~x1~0#1| 2), Black: 123#(= ~X~0 1), Black: 153#(and (= 2 ~x~0) (= |thr1Thread1of1ForFork0_~x1~0#1| 2))]) [2023-11-29 04:28:38,699 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-29 04:28:38,699 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 04:28:38,699 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-29 04:28:38,699 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-29 04:28:38,746 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([485] L737-->L744: Formula: (= v_~b2~0_5 |v_thr1Thread1of1ForFork0_~b21~0#1_1|) InVars {~b2~0=v_~b2~0_5} OutVars{thr1Thread1of1ForFork0_~b21~0#1=|v_thr1Thread1of1ForFork0_~b21~0#1_1|, ~b2~0=v_~b2~0_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~b21~0#1][42], [161#(= ~x~0 1), 44#L744true, Black: 131#(and (= |thr2Thread1of1ForFork1_~y2~0#1| 1) (= ~y~0 1)), Black: 162#(= |thr2Thread1of1ForFork1_~x2~0#1| 1), Black: 129#(= |thr2Thread1of1ForFork1_~y2~0#1| 1), 137#true, Black: 164#(and (= ~x~0 1) (= |thr2Thread1of1ForFork1_~x2~0#1| 1)), Black: 126#true, Black: 159#true, 148#true, 53#L847true, Black: 139#(= 2 ~y~0), Black: 140#(= |thr1Thread1of1ForFork0_~y1~0#1| 2), Black: 142#(and (= |thr1Thread1of1ForFork0_~y1~0#1| 2) (= 2 ~y~0)), 61#L777true, Black: 115#true, 175#(and (= |thr1Thread1of1ForFork0_~b21~0#1| 1) (= ~b2~0 1)), 128#(= ~y~0 1), Black: 151#(= |thr1Thread1of1ForFork0_~x1~0#1| 2), Black: 123#(= ~X~0 1), Black: 153#(and (= 2 ~x~0) (= |thr1Thread1of1ForFork0_~x1~0#1| 2)), Black: 150#(= 2 ~x~0)]) [2023-11-29 04:28:38,746 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-11-29 04:28:38,746 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-29 04:28:38,746 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-29 04:28:38,746 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 04:28:39,067 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([472] L770-->thr1EXIT: Formula: (and (= |v_thr1Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thr1Thread1of1ForFork0_#res#1.base_1| 0)) InVars {} OutVars{thr1Thread1of1ForFork0_#res#1.base=|v_thr1Thread1of1ForFork0_#res#1.base_1|, thr1Thread1of1ForFork0_#res#1.offset=|v_thr1Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_#res#1.offset, thr1Thread1of1ForFork0_#res#1.base][66], [170#true, 83#thr1EXITtrue, Black: 128#(= ~y~0 1), Black: 131#(and (= |thr2Thread1of1ForFork1_~y2~0#1| 1) (= ~y~0 1)), Black: 161#(= ~x~0 1), 164#(and (= ~x~0 1) (= |thr2Thread1of1ForFork1_~x2~0#1| 1)), Black: 162#(= |thr2Thread1of1ForFork1_~x2~0#1| 1), Black: 129#(= |thr2Thread1of1ForFork1_~y2~0#1| 1), 137#true, Black: 159#true, 148#true, 53#L847true, Black: 139#(= 2 ~y~0), Black: 140#(= |thr1Thread1of1ForFork0_~y1~0#1| 2), Black: 142#(and (= |thr1Thread1of1ForFork0_~y1~0#1| 2) (= 2 ~y~0)), Black: 115#true, 13#L823-1true, Black: 151#(= |thr1Thread1of1ForFork0_~x1~0#1| 2), 126#true, Black: 153#(and (= 2 ~x~0) (= |thr1Thread1of1ForFork0_~x1~0#1| 2)), Black: 123#(= ~X~0 1), Black: 150#(= 2 ~x~0)]) [2023-11-29 04:28:39,067 INFO L294 olderBase$Statistics]: this new event has 62 ancestors and is cut-off event [2023-11-29 04:28:39,067 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-29 04:28:39,067 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-29 04:28:39,067 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-29 04:28:39,074 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([472] L770-->thr1EXIT: Formula: (and (= |v_thr1Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thr1Thread1of1ForFork0_#res#1.base_1| 0)) InVars {} OutVars{thr1Thread1of1ForFork0_#res#1.base=|v_thr1Thread1of1ForFork0_#res#1.base_1|, thr1Thread1of1ForFork0_#res#1.offset=|v_thr1Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_#res#1.offset, thr1Thread1of1ForFork0_#res#1.base][67], [83#thr1EXITtrue, 172#(= ~b2~0 1), Black: 128#(= ~y~0 1), Black: 131#(and (= |thr2Thread1of1ForFork1_~y2~0#1| 1) (= ~y~0 1)), Black: 161#(= ~x~0 1), 164#(and (= ~x~0 1) (= |thr2Thread1of1ForFork1_~x2~0#1| 1)), Black: 162#(= |thr2Thread1of1ForFork1_~x2~0#1| 1), Black: 129#(= |thr2Thread1of1ForFork1_~y2~0#1| 1), 137#true, Black: 159#true, 148#true, 53#L847true, Black: 139#(= 2 ~y~0), Black: 140#(= |thr1Thread1of1ForFork0_~y1~0#1| 2), Black: 142#(and (= |thr1Thread1of1ForFork0_~y1~0#1| 2) (= 2 ~y~0)), 61#L777true, Black: 115#true, Black: 151#(= |thr1Thread1of1ForFork0_~x1~0#1| 2), 126#true, Black: 153#(and (= 2 ~x~0) (= |thr1Thread1of1ForFork0_~x1~0#1| 2)), Black: 123#(= ~X~0 1), Black: 150#(= 2 ~x~0)]) [2023-11-29 04:28:39,074 INFO L294 olderBase$Statistics]: this new event has 64 ancestors and is cut-off event [2023-11-29 04:28:39,074 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 04:28:39,074 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-29 04:28:39,074 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 04:28:39,082 INFO L124 PetriNetUnfolderBase]: 2948/8855 cut-off events. [2023-11-29 04:28:39,082 INFO L125 PetriNetUnfolderBase]: For 5214/5600 co-relation queries the response was YES. [2023-11-29 04:28:39,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19967 conditions, 8855 events. 2948/8855 cut-off events. For 5214/5600 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 87763 event pairs, 1035 based on Foata normal form. 292/8690 useless extension candidates. Maximal degree in co-relation 10692. Up to 2935 conditions per place. [2023-11-29 04:28:39,133 INFO L140 encePairwiseOnDemand]: 102/109 looper letters, 41 selfloop transitions, 11 changer transitions 0/157 dead transitions. [2023-11-29 04:28:39,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 157 transitions, 801 flow [2023-11-29 04:28:39,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:28:39,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:28:39,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 424 transitions. [2023-11-29 04:28:39,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7779816513761468 [2023-11-29 04:28:39,135 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 424 transitions. [2023-11-29 04:28:39,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 424 transitions. [2023-11-29 04:28:39,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:28:39,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 424 transitions. [2023-11-29 04:28:39,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 84.8) internal successors, (424), 5 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:39,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:39,140 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:39,140 INFO L175 Difference]: Start difference. First operand has 115 places, 133 transitions, 628 flow. Second operand 5 states and 424 transitions. [2023-11-29 04:28:39,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 157 transitions, 801 flow [2023-11-29 04:28:39,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 157 transitions, 797 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-11-29 04:28:39,164 INFO L231 Difference]: Finished difference. Result has 122 places, 139 transitions, 681 flow [2023-11-29 04:28:39,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=681, PETRI_PLACES=122, PETRI_TRANSITIONS=139} [2023-11-29 04:28:39,165 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 29 predicate places. [2023-11-29 04:28:39,165 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 139 transitions, 681 flow [2023-11-29 04:28:39,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.25) internal successors, (305), 4 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:39,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:28:39,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:28:39,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 04:28:39,166 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-29 04:28:39,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:28:39,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1977874112, now seen corresponding path program 1 times [2023-11-29 04:28:39,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:28:39,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005852859] [2023-11-29 04:28:39,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:28:39,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:28:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:28:39,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:28:39,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:28:39,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005852859] [2023-11-29 04:28:39,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005852859] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:28:39,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:28:39,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:28:39,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189402502] [2023-11-29 04:28:39,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:28:39,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:28:39,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:28:39,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:28:39,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:28:39,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 109 [2023-11-29 04:28:39,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 139 transitions, 681 flow. Second operand has 4 states, 4 states have (on average 76.25) internal successors, (305), 4 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:39,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:28:39,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 109 [2023-11-29 04:28:39,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:28:39,552 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([466] L707-->L710: Formula: (= v_~x~0_4 1) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0][30], [139#(= 2 ~y~0), 161#(= ~x~0 1), Black: 128#(= ~y~0 1), Black: 131#(and (= |thr2Thread1of1ForFork1_~y2~0#1| 1) (= ~y~0 1)), Black: 129#(= |thr2Thread1of1ForFork1_~y2~0#1| 1), 81#L710true, Black: 140#(= |thr1Thread1of1ForFork0_~y1~0#1| 2), Black: 137#true, Black: 142#(and (= |thr1Thread1of1ForFork0_~y1~0#1| 2) (= 2 ~y~0)), Black: 151#(= |thr1Thread1of1ForFork0_~x1~0#1| 2), Black: 153#(and (= 2 ~x~0) (= |thr1Thread1of1ForFork0_~x1~0#1| 2)), 126#true, Black: 150#(= 2 ~x~0), 172#(= ~b2~0 1), Black: 162#(= |thr2Thread1of1ForFork1_~x2~0#1| 1), Black: 164#(and (= ~x~0 1) (= |thr2Thread1of1ForFork1_~x2~0#1| 1)), Black: 159#true, 53#L847true, 62#L803true, 148#true, 182#(= ~b1~0 1), Black: 175#(and (= |thr1Thread1of1ForFork0_~b21~0#1| 1) (= ~b2~0 1)), Black: 173#(= |thr1Thread1of1ForFork0_~b21~0#1| 1), Black: 115#true, Black: 123#(= ~X~0 1)]) [2023-11-29 04:28:39,552 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-29 04:28:39,553 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-29 04:28:39,553 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-29 04:28:39,553 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-29 04:28:39,638 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([443] L807-->L814: Formula: (= v_~b1~0_1 |v_thr2Thread1of1ForFork1_~b12~0#1_1|) InVars {~b1~0=v_~b1~0_1} OutVars{thr2Thread1of1ForFork1_~b12~0#1=|v_thr2Thread1of1ForFork1_~b12~0#1_1|, ~b1~0=v_~b1~0_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~b12~0#1][69], [139#(= 2 ~y~0), 170#true, Black: 128#(= ~y~0 1), Black: 131#(and (= |thr2Thread1of1ForFork1_~y2~0#1| 1) (= ~y~0 1)), Black: 129#(= |thr2Thread1of1ForFork1_~y2~0#1| 1), Black: 140#(= |thr1Thread1of1ForFork0_~y1~0#1| 2), Black: 137#true, Black: 142#(and (= |thr1Thread1of1ForFork0_~y1~0#1| 2) (= 2 ~y~0)), 185#(and (= |thr2Thread1of1ForFork1_~b12~0#1| 1) (= ~b1~0 1)), Black: 148#true, Black: 151#(= |thr1Thread1of1ForFork0_~x1~0#1| 2), Black: 153#(and (= 2 ~x~0) (= |thr1Thread1of1ForFork0_~x1~0#1| 2)), 126#true, Black: 161#(= ~x~0 1), Black: 162#(= |thr2Thread1of1ForFork1_~x2~0#1| 1), Black: 164#(and (= ~x~0 1) (= |thr2Thread1of1ForFork1_~x2~0#1| 1)), 53#L847true, 36#L707true, 159#true, 150#(= 2 ~x~0), Black: 172#(= ~b2~0 1), Black: 175#(and (= |thr1Thread1of1ForFork0_~b21~0#1| 1) (= ~b2~0 1)), Black: 173#(= |thr1Thread1of1ForFork0_~b21~0#1| 1), Black: 115#true, 31#L814true, Black: 123#(= ~X~0 1)]) [2023-11-29 04:28:39,638 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-29 04:28:39,638 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-29 04:28:39,638 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 04:28:39,638 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 04:28:39,730 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([430] L840-->thr2EXIT: Formula: (and (= |v_thr2Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thr2Thread1of1ForFork1_#res#1.base_1| 0)) InVars {} OutVars{thr2Thread1of1ForFork1_#res#1.offset=|v_thr2Thread1of1ForFork1_#res#1.offset_1|, thr2Thread1of1ForFork1_#res#1.base=|v_thr2Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_#res#1.offset, thr2Thread1of1ForFork1_#res#1.base][86], [170#true, Black: 128#(= ~y~0 1), Black: 131#(and (= |thr2Thread1of1ForFork1_~y2~0#1| 1) (= ~y~0 1)), Black: 129#(= |thr2Thread1of1ForFork1_~y2~0#1| 1), 137#true, Black: 139#(= 2 ~y~0), Black: 140#(= |thr1Thread1of1ForFork0_~y1~0#1| 2), Black: 142#(and (= |thr1Thread1of1ForFork0_~y1~0#1| 2) (= 2 ~y~0)), Black: 148#true, Black: 151#(= |thr1Thread1of1ForFork0_~x1~0#1| 2), 126#true, Black: 153#(and (= 2 ~x~0) (= |thr1Thread1of1ForFork0_~x1~0#1| 2)), Black: 161#(= ~x~0 1), Black: 162#(= |thr2Thread1of1ForFork1_~x2~0#1| 1), 73#thr2EXITtrue, Black: 164#(and (= ~x~0 1) (= |thr2Thread1of1ForFork1_~x2~0#1| 1)), 53#L847true, 36#L707true, 159#true, 150#(= 2 ~x~0), 182#(= ~b1~0 1), Black: 172#(= ~b2~0 1), Black: 175#(and (= |thr1Thread1of1ForFork0_~b21~0#1| 1) (= ~b2~0 1)), Black: 173#(= |thr1Thread1of1ForFork0_~b21~0#1| 1), Black: 117#(= ~X~0 0), 123#(= ~X~0 1)]) [2023-11-29 04:28:39,730 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-29 04:28:39,730 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 04:28:39,730 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:28:39,730 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 04:28:40,187 INFO L124 PetriNetUnfolderBase]: 2421/7551 cut-off events. [2023-11-29 04:28:40,187 INFO L125 PetriNetUnfolderBase]: For 4816/5047 co-relation queries the response was YES. [2023-11-29 04:28:40,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17917 conditions, 7551 events. 2421/7551 cut-off events. For 4816/5047 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 73763 event pairs, 769 based on Foata normal form. 233/7458 useless extension candidates. Maximal degree in co-relation 9998. Up to 2326 conditions per place. [2023-11-29 04:28:40,226 INFO L140 encePairwiseOnDemand]: 102/109 looper letters, 39 selfloop transitions, 11 changer transitions 0/155 dead transitions. [2023-11-29 04:28:40,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 155 transitions, 815 flow [2023-11-29 04:28:40,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:28:40,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:28:40,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 422 transitions. [2023-11-29 04:28:40,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7743119266055046 [2023-11-29 04:28:40,228 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 422 transitions. [2023-11-29 04:28:40,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 422 transitions. [2023-11-29 04:28:40,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:28:40,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 422 transitions. [2023-11-29 04:28:40,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:40,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:40,232 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:40,233 INFO L175 Difference]: Start difference. First operand has 122 places, 139 transitions, 681 flow. Second operand 5 states and 422 transitions. [2023-11-29 04:28:40,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 155 transitions, 815 flow [2023-11-29 04:28:40,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 155 transitions, 805 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-11-29 04:28:40,264 INFO L231 Difference]: Finished difference. Result has 122 places, 137 transitions, 692 flow [2023-11-29 04:28:40,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=692, PETRI_PLACES=122, PETRI_TRANSITIONS=137} [2023-11-29 04:28:40,265 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 29 predicate places. [2023-11-29 04:28:40,265 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 137 transitions, 692 flow [2023-11-29 04:28:40,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.25) internal successors, (305), 4 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:40,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:28:40,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:28:40,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 04:28:40,266 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-29 04:28:40,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:28:40,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1932904027, now seen corresponding path program 1 times [2023-11-29 04:28:40,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:28:40,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149200083] [2023-11-29 04:28:40,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:28:40,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:28:40,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:28:40,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:28:40,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:28:40,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149200083] [2023-11-29 04:28:40,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149200083] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:28:40,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:28:40,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:28:40,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658951518] [2023-11-29 04:28:40,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:28:40,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:28:40,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:28:40,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:28:40,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:28:40,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 109 [2023-11-29 04:28:40,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 137 transitions, 692 flow. Second operand has 4 states, 4 states have (on average 81.75) internal successors, (327), 4 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:40,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:28:40,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 109 [2023-11-29 04:28:40,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:28:41,211 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([430] L840-->thr2EXIT: Formula: (and (= |v_thr2Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thr2Thread1of1ForFork1_#res#1.base_1| 0)) InVars {} OutVars{thr2Thread1of1ForFork1_#res#1.offset=|v_thr2Thread1of1ForFork1_#res#1.offset_1|, thr2Thread1of1ForFork1_#res#1.base=|v_thr2Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_#res#1.offset, thr2Thread1of1ForFork1_#res#1.base][83], [170#true, Black: 128#(= ~y~0 1), Black: 131#(and (= |thr2Thread1of1ForFork1_~y2~0#1| 1) (= ~y~0 1)), Black: 129#(= |thr2Thread1of1ForFork1_~y2~0#1| 1), 137#true, 192#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store |#valid| |ULTIMATE.start_main_~#t1~0#1.base| 0) |ULTIMATE.start_main_~#t2~0#1.base| 0))), 54#L753-1true, Black: 139#(= 2 ~y~0), Black: 140#(= |thr1Thread1of1ForFork0_~y1~0#1| 2), Black: 142#(and (= |thr1Thread1of1ForFork0_~y1~0#1| 2) (= 2 ~y~0)), 180#true, Black: 148#true, Black: 151#(= |thr1Thread1of1ForFork0_~x1~0#1| 2), Black: 153#(and (= 2 ~x~0) (= |thr1Thread1of1ForFork0_~x1~0#1| 2)), 126#true, Black: 161#(= ~x~0 1), 73#thr2EXITtrue, Black: 162#(= |thr2Thread1of1ForFork1_~x2~0#1| 1), Black: 164#(and (= ~x~0 1) (= |thr2Thread1of1ForFork1_~x2~0#1| 1)), 53#L847true, 159#true, 150#(= 2 ~x~0), Black: 172#(= ~b2~0 1), Black: 175#(and (= |thr1Thread1of1ForFork0_~b21~0#1| 1) (= ~b2~0 1)), Black: 173#(= |thr1Thread1of1ForFork0_~b21~0#1| 1), Black: 117#(= ~X~0 0), 123#(= ~X~0 1), Black: 182#(= ~b1~0 1), Black: 183#(= |thr2Thread1of1ForFork1_~b12~0#1| 1), Black: 185#(and (= |thr2Thread1of1ForFork1_~b12~0#1| 1) (= ~b1~0 1))]) [2023-11-29 04:28:41,212 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-29 04:28:41,212 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 04:28:41,212 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 04:28:41,212 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-29 04:28:41,252 INFO L124 PetriNetUnfolderBase]: 1551/5521 cut-off events. [2023-11-29 04:28:41,252 INFO L125 PetriNetUnfolderBase]: For 4062/4237 co-relation queries the response was YES. [2023-11-29 04:28:41,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13483 conditions, 5521 events. 1551/5521 cut-off events. For 4062/4237 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 54492 event pairs, 603 based on Foata normal form. 84/5189 useless extension candidates. Maximal degree in co-relation 7280. Up to 1528 conditions per place. [2023-11-29 04:28:41,273 INFO L140 encePairwiseOnDemand]: 106/109 looper letters, 0 selfloop transitions, 0 changer transitions 136/136 dead transitions. [2023-11-29 04:28:41,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 136 transitions, 726 flow [2023-11-29 04:28:41,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:28:41,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 04:28:41,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 335 transitions. [2023-11-29 04:28:41,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.768348623853211 [2023-11-29 04:28:41,275 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 335 transitions. [2023-11-29 04:28:41,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 335 transitions. [2023-11-29 04:28:41,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:28:41,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 335 transitions. [2023-11-29 04:28:41,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:41,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:41,278 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:41,278 INFO L175 Difference]: Start difference. First operand has 122 places, 137 transitions, 692 flow. Second operand 4 states and 335 transitions. [2023-11-29 04:28:41,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 136 transitions, 726 flow [2023-11-29 04:28:41,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 136 transitions, 723 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:28:41,299 INFO L231 Difference]: Finished difference. Result has 123 places, 0 transitions, 0 flow [2023-11-29 04:28:41,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=123, PETRI_TRANSITIONS=0} [2023-11-29 04:28:41,300 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 30 predicate places. [2023-11-29 04:28:41,300 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 0 transitions, 0 flow [2023-11-29 04:28:41,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.75) internal successors, (327), 4 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:41,303 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2023-11-29 04:28:41,303 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2023-11-29 04:28:41,303 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2023-11-29 04:28:41,303 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2023-11-29 04:28:41,304 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2023-11-29 04:28:41,304 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2023-11-29 04:28:41,304 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2023-11-29 04:28:41,304 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2023-11-29 04:28:41,304 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2023-11-29 04:28:41,304 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2023-11-29 04:28:41,304 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (4 of 15 remaining) [2023-11-29 04:28:41,305 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining) [2023-11-29 04:28:41,305 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining) [2023-11-29 04:28:41,305 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 15 remaining) [2023-11-29 04:28:41,305 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 15 remaining) [2023-11-29 04:28:41,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 04:28:41,306 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:28:41,311 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 04:28:41,311 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:28:41,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 04:28:41 BasicIcfg [2023-11-29 04:28:41,317 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 04:28:41,317 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:28:41,317 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:28:41,318 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:28:41,318 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:28:32" (3/4) ... [2023-11-29 04:28:41,320 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 04:28:41,322 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thr2 [2023-11-29 04:28:41,323 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2023-11-29 04:28:41,327 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 36 nodes and edges [2023-11-29 04:28:41,327 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-11-29 04:28:41,327 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-29 04:28:41,328 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 04:28:41,407 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ae6ca4-a954-4508-bd77-cfe6b6b26f0d/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 04:28:41,407 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ae6ca4-a954-4508-bd77-cfe6b6b26f0d/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 04:28:41,407 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:28:41,408 INFO L158 Benchmark]: Toolchain (without parser) took 9627.20ms. Allocated memory was 151.0MB in the beginning and 625.0MB in the end (delta: 474.0MB). Free memory was 102.5MB in the beginning and 270.8MB in the end (delta: -168.3MB). Peak memory consumption was 307.7MB. Max. memory is 16.1GB. [2023-11-29 04:28:41,408 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 151.0MB. Free memory is still 121.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:28:41,409 INFO L158 Benchmark]: CACSL2BoogieTranslator took 502.60ms. Allocated memory is still 151.0MB. Free memory was 102.2MB in the beginning and 81.6MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 04:28:41,409 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.14ms. Allocated memory is still 151.0MB. Free memory was 81.6MB in the beginning and 79.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:28:41,410 INFO L158 Benchmark]: Boogie Preprocessor took 52.67ms. Allocated memory is still 151.0MB. Free memory was 79.2MB in the beginning and 76.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:28:41,410 INFO L158 Benchmark]: RCFGBuilder took 524.54ms. Allocated memory is still 151.0MB. Free memory was 76.5MB in the beginning and 52.9MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-29 04:28:41,411 INFO L158 Benchmark]: TraceAbstraction took 8398.08ms. Allocated memory was 151.0MB in the beginning and 625.0MB in the end (delta: 474.0MB). Free memory was 52.3MB in the beginning and 275.0MB in the end (delta: -222.7MB). Peak memory consumption was 339.1MB. Max. memory is 16.1GB. [2023-11-29 04:28:41,411 INFO L158 Benchmark]: Witness Printer took 90.18ms. Allocated memory is still 625.0MB. Free memory was 275.0MB in the beginning and 270.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 04:28:41,413 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.24ms. Allocated memory is still 151.0MB. Free memory is still 121.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 502.60ms. Allocated memory is still 151.0MB. Free memory was 102.2MB in the beginning and 81.6MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.14ms. Allocated memory is still 151.0MB. Free memory was 81.6MB in the beginning and 79.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.67ms. Allocated memory is still 151.0MB. Free memory was 79.2MB in the beginning and 76.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 524.54ms. Allocated memory is still 151.0MB. Free memory was 76.5MB in the beginning and 52.9MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8398.08ms. Allocated memory was 151.0MB in the beginning and 625.0MB in the end (delta: 474.0MB). Free memory was 52.3MB in the beginning and 275.0MB in the end (delta: -222.7MB). Peak memory consumption was 339.1MB. Max. memory is 16.1GB. * Witness Printer took 90.18ms. Allocated memory is still 625.0MB. Free memory was 275.0MB in the beginning and 270.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 843]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 158 locations, 15 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: 8.2s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 574 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 407 mSDsluCounter, 101 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1045 IncrementalHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 60 mSDtfsCounter, 1045 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=692occurred in iteration=12, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 291 NumberOfCodeBlocks, 291 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 1058 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 11 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-29 04:28:41,433 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81ae6ca4-a954-4508-bd77-cfe6b6b26f0d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE