./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix032.opt.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_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/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_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix032.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/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_ec990e9d-2518-4374-aa81-4d9cebda7224/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 0032fd1b0879d5a3b3f4ef67d0327f489d9a349f94447e8a77b1324c1477f2bb --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 07:00:52,347 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 07:00:52,408 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 07:00:52,412 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 07:00:52,412 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 07:00:52,435 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 07:00:52,436 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 07:00:52,436 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 07:00:52,436 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 07:00:52,437 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 07:00:52,438 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 07:00:52,438 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 07:00:52,439 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 07:00:52,439 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 07:00:52,440 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 07:00:52,440 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 07:00:52,441 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 07:00:52,441 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 07:00:52,442 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 07:00:52,442 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 07:00:52,443 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 07:00:52,444 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 07:00:52,444 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 07:00:52,444 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 07:00:52,445 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 07:00:52,445 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 07:00:52,446 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 07:00:52,446 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 07:00:52,446 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 07:00:52,447 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 07:00:52,447 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 07:00:52,447 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 07:00:52,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 07:00:52,448 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 07:00:52,448 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 07:00:52,448 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 07:00:52,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 07:00:52,449 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 07:00:52,449 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 07:00:52,449 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 07:00:52,449 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 07:00:52,450 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_ec990e9d-2518-4374-aa81-4d9cebda7224/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_ec990e9d-2518-4374-aa81-4d9cebda7224/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 -> 0032fd1b0879d5a3b3f4ef67d0327f489d9a349f94447e8a77b1324c1477f2bb [2023-11-29 07:00:52,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 07:00:52,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 07:00:52,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 07:00:52,698 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 07:00:52,699 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 07:00:52,700 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix032.opt.i [2023-11-29 07:00:55,453 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 07:00:55,712 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 07:00:55,712 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/sv-benchmarks/c/pthread-wmm/mix032.opt.i [2023-11-29 07:00:55,729 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/data/4fff8a2d6/538e546c4bc64aa29f8414f9b6562c63/FLAGe661c869a [2023-11-29 07:00:55,740 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/data/4fff8a2d6/538e546c4bc64aa29f8414f9b6562c63 [2023-11-29 07:00:55,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 07:00:55,744 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 07:00:55,745 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 07:00:55,746 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 07:00:55,755 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 07:00:55,755 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:00:55" (1/1) ... [2023-11-29 07:00:55,756 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@183bfaf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:00:55, skipping insertion in model container [2023-11-29 07:00:55,757 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:00:55" (1/1) ... [2023-11-29 07:00:55,800 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 07:00:56,096 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 07:00:56,108 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 07:00:56,160 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 07:00:56,187 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 07:00:56,187 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 07:00:56,192 INFO L206 MainTranslator]: Completed translation [2023-11-29 07:00:56,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:00:56 WrapperNode [2023-11-29 07:00:56,193 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 07:00:56,194 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 07:00:56,194 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 07:00:56,194 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 07:00:56,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:00:56" (1/1) ... [2023-11-29 07:00:56,216 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:00:56" (1/1) ... [2023-11-29 07:00:56,240 INFO L138 Inliner]: procedures = 176, calls = 63, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 144 [2023-11-29 07:00:56,240 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 07:00:56,241 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 07:00:56,241 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 07:00:56,241 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 07:00:56,251 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:00:56" (1/1) ... [2023-11-29 07:00:56,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:00:56" (1/1) ... [2023-11-29 07:00:56,254 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:00:56" (1/1) ... [2023-11-29 07:00:56,278 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-29 07:00:56,278 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:00:56" (1/1) ... [2023-11-29 07:00:56,279 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:00:56" (1/1) ... [2023-11-29 07:00:56,288 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:00:56" (1/1) ... [2023-11-29 07:00:56,290 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:00:56" (1/1) ... [2023-11-29 07:00:56,293 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:00:56" (1/1) ... [2023-11-29 07:00:56,295 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:00:56" (1/1) ... [2023-11-29 07:00:56,300 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 07:00:56,301 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 07:00:56,301 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 07:00:56,301 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 07:00:56,302 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:00:56" (1/1) ... [2023-11-29 07:00:56,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 07:00:56,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:00:56,336 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 07:00:56,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 07:00:56,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 07:00:56,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 07:00:56,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 07:00:56,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 07:00:56,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 07:00:56,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 07:00:56,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 07:00:56,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 07:00:56,367 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 07:00:56,367 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 07:00:56,367 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 07:00:56,368 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 07:00:56,368 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 07:00:56,368 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 07:00:56,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 07:00:56,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 07:00:56,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 07:00:56,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 07:00:56,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 07:00:56,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 07:00:56,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 07:00:56,371 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 07:00:56,515 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 07:00:56,517 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 07:00:56,787 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 07:00:56,984 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 07:00:56,984 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 07:00:56,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:00:56 BoogieIcfgContainer [2023-11-29 07:00:56,985 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 07:00:56,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 07:00:56,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 07:00:56,991 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 07:00:56,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 07:00:55" (1/3) ... [2023-11-29 07:00:56,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d17aec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:00:56, skipping insertion in model container [2023-11-29 07:00:56,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:00:56" (2/3) ... [2023-11-29 07:00:56,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d17aec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:00:56, skipping insertion in model container [2023-11-29 07:00:56,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:00:56" (3/3) ... [2023-11-29 07:00:56,993 INFO L112 eAbstractionObserver]: Analyzing ICFG mix032.opt.i [2023-11-29 07:00:57,008 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 07:00:57,008 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-29 07:00:57,008 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 07:00:57,054 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 07:00:57,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 57 transitions, 126 flow [2023-11-29 07:00:57,113 INFO L124 PetriNetUnfolderBase]: 2/54 cut-off events. [2023-11-29 07:00:57,113 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 07:00:57,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 54 events. 2/54 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 107 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2023-11-29 07:00:57,118 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 57 transitions, 126 flow [2023-11-29 07:00:57,121 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 54 transitions, 117 flow [2023-11-29 07:00:57,130 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 07:00:57,137 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;@375c10fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 07:00:57,137 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-29 07:00:57,140 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 07:00:57,141 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 07:00:57,141 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 07:00:57,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:00:57,141 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 07:00:57,142 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 07:00:57,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:00:57,147 INFO L85 PathProgramCache]: Analyzing trace with hash 12240, now seen corresponding path program 1 times [2023-11-29 07:00:57,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:00:57,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317992109] [2023-11-29 07:00:57,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:00:57,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:00:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:57,387 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 07:00:57,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:00:57,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317992109] [2023-11-29 07:00:57,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317992109] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:00:57,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:00:57,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 07:00:57,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519103307] [2023-11-29 07:00:57,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:00:57,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:00:57,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:00:57,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:00:57,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:00:57,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 57 [2023-11-29 07:00:57,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 07:00:57,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:00:57,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 57 [2023-11-29 07:00:57,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:00:57,789 INFO L124 PetriNetUnfolderBase]: 459/969 cut-off events. [2023-11-29 07:00:57,790 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-29 07:00:57,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1709 conditions, 969 events. 459/969 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 6903 event pairs, 341 based on Foata normal form. 60/938 useless extension candidates. Maximal degree in co-relation 1695. Up to 539 conditions per place. [2023-11-29 07:00:57,805 INFO L140 encePairwiseOnDemand]: 52/57 looper letters, 26 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-11-29 07:00:57,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 57 transitions, 179 flow [2023-11-29 07:00:57,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:00:57,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:00:57,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2023-11-29 07:00:57,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7426900584795322 [2023-11-29 07:00:57,834 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 127 transitions. [2023-11-29 07:00:57,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 127 transitions. [2023-11-29 07:00:57,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:00:57,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 127 transitions. [2023-11-29 07:00:57,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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 07:00:57,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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 07:00:57,849 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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 07:00:57,851 INFO L175 Difference]: Start difference. First operand has 62 places, 54 transitions, 117 flow. Second operand 3 states and 127 transitions. [2023-11-29 07:00:57,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 57 transitions, 179 flow [2023-11-29 07:00:57,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 57 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 07:00:57,859 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 110 flow [2023-11-29 07:00:57,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2023-11-29 07:00:57,864 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2023-11-29 07:00:57,864 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 110 flow [2023-11-29 07:00:57,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 07:00:57,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:00:57,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 07:00:57,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 07:00:57,865 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 07:00:57,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:00:57,866 INFO L85 PathProgramCache]: Analyzing trace with hash 12241, now seen corresponding path program 1 times [2023-11-29 07:00:57,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:00:57,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34722179] [2023-11-29 07:00:57,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:00:57,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:00:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:57,972 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 07:00:57,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:00:57,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34722179] [2023-11-29 07:00:57,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34722179] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:00:57,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:00:57,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 07:00:57,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710602737] [2023-11-29 07:00:57,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:00:57,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:00:57,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:00:57,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:00:57,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:00:57,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 57 [2023-11-29 07:00:57,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:00:57,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:00:57,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 57 [2023-11-29 07:00:57,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:00:58,208 INFO L124 PetriNetUnfolderBase]: 459/968 cut-off events. [2023-11-29 07:00:58,209 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-29 07:00:58,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1736 conditions, 968 events. 459/968 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 6887 event pairs, 341 based on Foata normal form. 1/878 useless extension candidates. Maximal degree in co-relation 1725. Up to 538 conditions per place. [2023-11-29 07:00:58,220 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 25 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-11-29 07:00:58,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 56 transitions, 176 flow [2023-11-29 07:00:58,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:00:58,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:00:58,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2023-11-29 07:00:58,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7426900584795322 [2023-11-29 07:00:58,223 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 127 transitions. [2023-11-29 07:00:58,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 127 transitions. [2023-11-29 07:00:58,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:00:58,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 127 transitions. [2023-11-29 07:00:58,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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 07:00:58,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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 07:00:58,226 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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 07:00:58,226 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 110 flow. Second operand 3 states and 127 transitions. [2023-11-29 07:00:58,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 56 transitions, 176 flow [2023-11-29 07:00:58,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 56 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:00:58,230 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 108 flow [2023-11-29 07:00:58,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2023-11-29 07:00:58,232 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2023-11-29 07:00:58,232 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 108 flow [2023-11-29 07:00:58,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:00:58,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:00:58,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 07:00:58,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 07:00:58,233 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 07:00:58,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:00:58,233 INFO L85 PathProgramCache]: Analyzing trace with hash 365022133, now seen corresponding path program 1 times [2023-11-29 07:00:58,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:00:58,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042832180] [2023-11-29 07:00:58,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:00:58,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:00:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:58,293 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 07:00:58,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:00:58,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042832180] [2023-11-29 07:00:58,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042832180] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:00:58,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:00:58,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:00:58,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801202072] [2023-11-29 07:00:58,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:00:58,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:00:58,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:00:58,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:00:58,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:00:58,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 57 [2023-11-29 07:00:58,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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 07:00:58,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:00:58,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 57 [2023-11-29 07:00:58,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:00:58,513 INFO L124 PetriNetUnfolderBase]: 460/966 cut-off events. [2023-11-29 07:00:58,513 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-29 07:00:58,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1737 conditions, 966 events. 460/966 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 6911 event pairs, 341 based on Foata normal form. 0/879 useless extension candidates. Maximal degree in co-relation 1726. Up to 538 conditions per place. [2023-11-29 07:00:58,522 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 26 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-29 07:00:58,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 55 transitions, 176 flow [2023-11-29 07:00:58,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:00:58,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:00:58,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2023-11-29 07:00:58,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7309941520467836 [2023-11-29 07:00:58,524 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 125 transitions. [2023-11-29 07:00:58,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 125 transitions. [2023-11-29 07:00:58,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:00:58,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 125 transitions. [2023-11-29 07:00:58,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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 07:00:58,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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 07:00:58,527 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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 07:00:58,527 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 108 flow. Second operand 3 states and 125 transitions. [2023-11-29 07:00:58,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 55 transitions, 176 flow [2023-11-29 07:00:58,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 55 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:00:58,530 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 106 flow [2023-11-29 07:00:58,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2023-11-29 07:00:58,531 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -5 predicate places. [2023-11-29 07:00:58,531 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 106 flow [2023-11-29 07:00:58,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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 07:00:58,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:00:58,531 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 07:00:58,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 07:00:58,532 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 07:00:58,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:00:58,532 INFO L85 PathProgramCache]: Analyzing trace with hash 365022134, now seen corresponding path program 1 times [2023-11-29 07:00:58,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:00:58,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243956719] [2023-11-29 07:00:58,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:00:58,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:00:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:58,613 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 07:00:58,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:00:58,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243956719] [2023-11-29 07:00:58,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243956719] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:00:58,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:00:58,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:00:58,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594169876] [2023-11-29 07:00:58,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:00:58,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:00:58,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:00:58,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:00:58,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:00:58,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 57 [2023-11-29 07:00:58,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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 07:00:58,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:00:58,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 57 [2023-11-29 07:00:58,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:00:58,784 INFO L124 PetriNetUnfolderBase]: 459/964 cut-off events. [2023-11-29 07:00:58,784 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-11-29 07:00:58,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1733 conditions, 964 events. 459/964 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 6830 event pairs, 274 based on Foata normal form. 2/880 useless extension candidates. Maximal degree in co-relation 1723. Up to 535 conditions per place. [2023-11-29 07:00:58,791 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 25 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-11-29 07:00:58,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 54 transitions, 172 flow [2023-11-29 07:00:58,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:00:58,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:00:58,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2023-11-29 07:00:58,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7426900584795322 [2023-11-29 07:00:58,793 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 127 transitions. [2023-11-29 07:00:58,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 127 transitions. [2023-11-29 07:00:58,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:00:58,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 127 transitions. [2023-11-29 07:00:58,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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 07:00:58,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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 07:00:58,796 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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 07:00:58,796 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 106 flow. Second operand 3 states and 127 transitions. [2023-11-29 07:00:58,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 54 transitions, 172 flow [2023-11-29 07:00:58,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 54 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:00:58,798 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 104 flow [2023-11-29 07:00:58,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-11-29 07:00:58,799 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2023-11-29 07:00:58,800 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 104 flow [2023-11-29 07:00:58,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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 07:00:58,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:00:58,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:00:58,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 07:00:58,801 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 07:00:58,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:00:58,801 INFO L85 PathProgramCache]: Analyzing trace with hash -482451071, now seen corresponding path program 1 times [2023-11-29 07:00:58,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:00:58,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004627253] [2023-11-29 07:00:58,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:00:58,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:00:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:58,850 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 07:00:58,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:00:58,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004627253] [2023-11-29 07:00:58,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004627253] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:00:58,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:00:58,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:00:58,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567929736] [2023-11-29 07:00:58,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:00:58,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:00:58,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:00:58,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:00:58,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:00:58,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 57 [2023-11-29 07:00:58,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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 07:00:58,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:00:58,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 57 [2023-11-29 07:00:58,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:00:59,020 INFO L124 PetriNetUnfolderBase]: 466/942 cut-off events. [2023-11-29 07:00:59,020 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-11-29 07:00:59,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1724 conditions, 942 events. 466/942 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6321 event pairs, 353 based on Foata normal form. 0/875 useless extension candidates. Maximal degree in co-relation 1714. Up to 536 conditions per place. [2023-11-29 07:00:59,026 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 26 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-29 07:00:59,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 53 transitions, 172 flow [2023-11-29 07:00:59,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:00:59,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:00:59,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2023-11-29 07:00:59,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7309941520467836 [2023-11-29 07:00:59,028 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 125 transitions. [2023-11-29 07:00:59,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 125 transitions. [2023-11-29 07:00:59,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:00:59,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 125 transitions. [2023-11-29 07:00:59,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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 07:00:59,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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 07:00:59,030 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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 07:00:59,030 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 104 flow. Second operand 3 states and 125 transitions. [2023-11-29 07:00:59,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 53 transitions, 172 flow [2023-11-29 07:00:59,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:00:59,033 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-29 07:00:59,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-11-29 07:00:59,034 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -7 predicate places. [2023-11-29 07:00:59,034 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-29 07:00:59,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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 07:00:59,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:00:59,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:00:59,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 07:00:59,035 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 07:00:59,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:00:59,035 INFO L85 PathProgramCache]: Analyzing trace with hash -482451070, now seen corresponding path program 1 times [2023-11-29 07:00:59,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:00:59,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014319808] [2023-11-29 07:00:59,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:00:59,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:00:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:59,103 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 07:00:59,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:00:59,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014319808] [2023-11-29 07:00:59,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014319808] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:00:59,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:00:59,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:00:59,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127663263] [2023-11-29 07:00:59,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:00:59,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:00:59,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:00:59,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:00:59,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:00:59,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 57 [2023-11-29 07:00:59,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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 07:00:59,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:00:59,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 57 [2023-11-29 07:00:59,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:00:59,265 INFO L124 PetriNetUnfolderBase]: 459/924 cut-off events. [2023-11-29 07:00:59,265 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-11-29 07:00:59,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1697 conditions, 924 events. 459/924 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6079 event pairs, 346 based on Foata normal form. 6/868 useless extension candidates. Maximal degree in co-relation 1687. Up to 523 conditions per place. [2023-11-29 07:00:59,271 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 25 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-11-29 07:00:59,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 52 transitions, 168 flow [2023-11-29 07:00:59,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:00:59,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:00:59,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2023-11-29 07:00:59,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7426900584795322 [2023-11-29 07:00:59,273 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 127 transitions. [2023-11-29 07:00:59,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 127 transitions. [2023-11-29 07:00:59,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:00:59,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 127 transitions. [2023-11-29 07:00:59,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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 07:00:59,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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 07:00:59,275 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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 07:00:59,275 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 127 transitions. [2023-11-29 07:00:59,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 52 transitions, 168 flow [2023-11-29 07:00:59,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 52 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:00:59,277 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-29 07:00:59,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-11-29 07:00:59,278 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -8 predicate places. [2023-11-29 07:00:59,279 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-29 07:00:59,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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 07:00:59,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:00:59,279 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:00:59,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 07:00:59,280 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 07:00:59,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:00:59,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1738905732, now seen corresponding path program 1 times [2023-11-29 07:00:59,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:00:59,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611817689] [2023-11-29 07:00:59,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:00:59,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:00:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:59,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 07:00:59,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:00:59,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611817689] [2023-11-29 07:00:59,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611817689] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:00:59,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:00:59,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 07:00:59,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963613608] [2023-11-29 07:00:59,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:00:59,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:00:59,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:00:59,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:00:59,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:00:59,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 57 [2023-11-29 07:00:59,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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 07:00:59,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:00:59,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 57 [2023-11-29 07:00:59,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:00:59,597 INFO L124 PetriNetUnfolderBase]: 361/830 cut-off events. [2023-11-29 07:00:59,597 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2023-11-29 07:00:59,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1451 conditions, 830 events. 361/830 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5752 event pairs, 67 based on Foata normal form. 0/821 useless extension candidates. Maximal degree in co-relation 1441. Up to 439 conditions per place. [2023-11-29 07:00:59,604 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 25 selfloop transitions, 2 changer transitions 2/54 dead transitions. [2023-11-29 07:00:59,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 54 transitions, 178 flow [2023-11-29 07:00:59,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:00:59,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:00:59,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2023-11-29 07:00:59,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7719298245614035 [2023-11-29 07:00:59,606 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 132 transitions. [2023-11-29 07:00:59,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 132 transitions. [2023-11-29 07:00:59,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:00:59,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 132 transitions. [2023-11-29 07:00:59,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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 07:00:59,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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 07:00:59,608 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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 07:00:59,608 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 132 transitions. [2023-11-29 07:00:59,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 54 transitions, 178 flow [2023-11-29 07:00:59,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 54 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:00:59,610 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 96 flow [2023-11-29 07:00:59,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2023-11-29 07:00:59,611 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -9 predicate places. [2023-11-29 07:00:59,611 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 96 flow [2023-11-29 07:00:59,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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 07:00:59,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:00:59,612 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:00:59,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 07:00:59,612 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 07:00:59,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:00:59,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1030142885, now seen corresponding path program 1 times [2023-11-29 07:00:59,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:00:59,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748003385] [2023-11-29 07:00:59,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:00:59,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:00:59,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:00,105 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 07:01:00,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:01:00,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748003385] [2023-11-29 07:01:00,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748003385] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:01:00,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:01:00,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 07:01:00,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091608327] [2023-11-29 07:01:00,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:01:00,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 07:01:00,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:01:00,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 07:01:00,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 07:01:00,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 57 [2023-11-29 07:01:00,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 96 flow. Second operand has 9 states, 9 states have (on average 31.666666666666668) internal successors, (285), 9 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 07:01:00,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:01:00,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 57 [2023-11-29 07:01:00,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:01:00,666 INFO L124 PetriNetUnfolderBase]: 401/798 cut-off events. [2023-11-29 07:01:00,666 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2023-11-29 07:01:00,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1493 conditions, 798 events. 401/798 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5250 event pairs, 34 based on Foata normal form. 30/818 useless extension candidates. Maximal degree in co-relation 1481. Up to 324 conditions per place. [2023-11-29 07:01:00,673 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 28 selfloop transitions, 4 changer transitions 9/62 dead transitions. [2023-11-29 07:01:00,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 62 transitions, 218 flow [2023-11-29 07:01:00,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 07:01:00,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 07:01:00,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 252 transitions. [2023-11-29 07:01:00,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.631578947368421 [2023-11-29 07:01:00,675 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 252 transitions. [2023-11-29 07:01:00,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 252 transitions. [2023-11-29 07:01:00,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:01:00,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 252 transitions. [2023-11-29 07:01:00,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 36.0) internal successors, (252), 7 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 07:01:00,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 57.0) internal successors, (456), 8 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:01:00,678 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 57.0) internal successors, (456), 8 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:01:00,678 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 96 flow. Second operand 7 states and 252 transitions. [2023-11-29 07:01:00,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 62 transitions, 218 flow [2023-11-29 07:01:00,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 62 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:01:00,680 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 96 flow [2023-11-29 07:01:00,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=96, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2023-11-29 07:01:00,681 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -7 predicate places. [2023-11-29 07:01:00,682 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 96 flow [2023-11-29 07:01:00,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 31.666666666666668) internal successors, (285), 9 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 07:01:00,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:01:00,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:01:00,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 07:01:00,682 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 07:01:00,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:01:00,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1030144134, now seen corresponding path program 1 times [2023-11-29 07:01:00,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:01:00,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221060037] [2023-11-29 07:01:00,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:01:00,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:01:00,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:00,879 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 07:01:00,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:01:00,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221060037] [2023-11-29 07:01:00,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221060037] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:01:00,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:01:00,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 07:01:00,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570810949] [2023-11-29 07:01:00,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:01:00,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 07:01:00,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:01:00,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 07:01:00,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 07:01:00,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 57 [2023-11-29 07:01:00,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 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 07:01:00,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:01:00,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 57 [2023-11-29 07:01:00,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:01:01,436 INFO L124 PetriNetUnfolderBase]: 1655/2798 cut-off events. [2023-11-29 07:01:01,436 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2023-11-29 07:01:01,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5447 conditions, 2798 events. 1655/2798 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 18537 event pairs, 652 based on Foata normal form. 0/2717 useless extension candidates. Maximal degree in co-relation 5436. Up to 1597 conditions per place. [2023-11-29 07:01:01,454 INFO L140 encePairwiseOnDemand]: 49/57 looper letters, 29 selfloop transitions, 4 changer transitions 44/95 dead transitions. [2023-11-29 07:01:01,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 95 transitions, 378 flow [2023-11-29 07:01:01,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 07:01:01,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 07:01:01,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 303 transitions. [2023-11-29 07:01:01,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6644736842105263 [2023-11-29 07:01:01,456 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 303 transitions. [2023-11-29 07:01:01,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 303 transitions. [2023-11-29 07:01:01,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:01:01,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 303 transitions. [2023-11-29 07:01:01,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 37.875) internal successors, (303), 8 states have internal predecessors, (303), 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 07:01:01,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 57.0) internal successors, (513), 9 states have internal predecessors, (513), 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 07:01:01,459 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 57.0) internal successors, (513), 9 states have internal predecessors, (513), 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 07:01:01,460 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 96 flow. Second operand 8 states and 303 transitions. [2023-11-29 07:01:01,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 95 transitions, 378 flow [2023-11-29 07:01:01,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 95 transitions, 361 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 07:01:01,462 INFO L231 Difference]: Finished difference. Result has 61 places, 43 transitions, 134 flow [2023-11-29 07:01:01,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=134, PETRI_PLACES=61, PETRI_TRANSITIONS=43} [2023-11-29 07:01:01,463 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -1 predicate places. [2023-11-29 07:01:01,463 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 43 transitions, 134 flow [2023-11-29 07:01:01,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 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 07:01:01,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:01:01,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:01:01,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 07:01:01,464 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 07:01:01,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:01:01,464 INFO L85 PathProgramCache]: Analyzing trace with hash -2123580856, now seen corresponding path program 1 times [2023-11-29 07:01:01,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:01:01,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790175808] [2023-11-29 07:01:01,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:01:01,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:01:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:01,647 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 07:01:01,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:01:01,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790175808] [2023-11-29 07:01:01,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790175808] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:01:01,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:01:01,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 07:01:01,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720470908] [2023-11-29 07:01:01,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:01:01,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:01:01,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:01:01,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:01:01,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:01:01,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 57 [2023-11-29 07:01:01,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 43 transitions, 134 flow. Second operand has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 6 states have internal predecessors, (181), 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 07:01:01,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:01:01,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 57 [2023-11-29 07:01:01,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:01:02,062 INFO L124 PetriNetUnfolderBase]: 1173/2029 cut-off events. [2023-11-29 07:01:02,062 INFO L125 PetriNetUnfolderBase]: For 2069/2069 co-relation queries the response was YES. [2023-11-29 07:01:02,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5470 conditions, 2029 events. 1173/2029 cut-off events. For 2069/2069 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 12677 event pairs, 277 based on Foata normal form. 66/2069 useless extension candidates. Maximal degree in co-relation 5454. Up to 1065 conditions per place. [2023-11-29 07:01:02,075 INFO L140 encePairwiseOnDemand]: 52/57 looper letters, 30 selfloop transitions, 3 changer transitions 33/84 dead transitions. [2023-11-29 07:01:02,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 84 transitions, 432 flow [2023-11-29 07:01:02,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 07:01:02,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 07:01:02,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 261 transitions. [2023-11-29 07:01:02,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6541353383458647 [2023-11-29 07:01:02,077 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 261 transitions. [2023-11-29 07:01:02,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 261 transitions. [2023-11-29 07:01:02,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:01:02,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 261 transitions. [2023-11-29 07:01:02,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 37.285714285714285) internal successors, (261), 7 states have internal predecessors, (261), 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 07:01:02,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 57.0) internal successors, (456), 8 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:01:02,080 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 57.0) internal successors, (456), 8 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:01:02,080 INFO L175 Difference]: Start difference. First operand has 61 places, 43 transitions, 134 flow. Second operand 7 states and 261 transitions. [2023-11-29 07:01:02,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 84 transitions, 432 flow [2023-11-29 07:01:02,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 84 transitions, 420 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-11-29 07:01:02,089 INFO L231 Difference]: Finished difference. Result has 63 places, 43 transitions, 145 flow [2023-11-29 07:01:02,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=145, PETRI_PLACES=63, PETRI_TRANSITIONS=43} [2023-11-29 07:01:02,090 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 1 predicate places. [2023-11-29 07:01:02,090 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 43 transitions, 145 flow [2023-11-29 07:01:02,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 6 states have internal predecessors, (181), 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 07:01:02,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:01:02,090 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] [2023-11-29 07:01:02,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 07:01:02,091 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 07:01:02,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:01:02,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1668216515, now seen corresponding path program 1 times [2023-11-29 07:01:02,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:01:02,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976776514] [2023-11-29 07:01:02,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:01:02,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:01:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:02,259 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 07:01:02,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:01:02,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976776514] [2023-11-29 07:01:02,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976776514] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:01:02,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:01:02,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 07:01:02,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551101966] [2023-11-29 07:01:02,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:01:02,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:01:02,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:01:02,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:01:02,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:01:02,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 57 [2023-11-29 07:01:02,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 43 transitions, 145 flow. Second operand has 6 states, 6 states have (on average 30.333333333333332) internal successors, (182), 6 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:01:02,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:01:02,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 57 [2023-11-29 07:01:02,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:01:02,602 INFO L124 PetriNetUnfolderBase]: 1012/1838 cut-off events. [2023-11-29 07:01:02,602 INFO L125 PetriNetUnfolderBase]: For 2299/2299 co-relation queries the response was YES. [2023-11-29 07:01:02,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4938 conditions, 1838 events. 1012/1838 cut-off events. For 2299/2299 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 11643 event pairs, 214 based on Foata normal form. 48/1870 useless extension candidates. Maximal degree in co-relation 4918. Up to 1084 conditions per place. [2023-11-29 07:01:02,615 INFO L140 encePairwiseOnDemand]: 52/57 looper letters, 34 selfloop transitions, 3 changer transitions 29/84 dead transitions. [2023-11-29 07:01:02,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 84 transitions, 429 flow [2023-11-29 07:01:02,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 07:01:02,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 07:01:02,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 261 transitions. [2023-11-29 07:01:02,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6541353383458647 [2023-11-29 07:01:02,617 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 261 transitions. [2023-11-29 07:01:02,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 261 transitions. [2023-11-29 07:01:02,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:01:02,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 261 transitions. [2023-11-29 07:01:02,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 37.285714285714285) internal successors, (261), 7 states have internal predecessors, (261), 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 07:01:02,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 57.0) internal successors, (456), 8 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:01:02,620 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 57.0) internal successors, (456), 8 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:01:02,620 INFO L175 Difference]: Start difference. First operand has 63 places, 43 transitions, 145 flow. Second operand 7 states and 261 transitions. [2023-11-29 07:01:02,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 84 transitions, 429 flow [2023-11-29 07:01:02,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 84 transitions, 405 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-11-29 07:01:02,628 INFO L231 Difference]: Finished difference. Result has 64 places, 43 transitions, 150 flow [2023-11-29 07:01:02,628 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=150, PETRI_PLACES=64, PETRI_TRANSITIONS=43} [2023-11-29 07:01:02,628 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 2 predicate places. [2023-11-29 07:01:02,629 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 43 transitions, 150 flow [2023-11-29 07:01:02,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.333333333333332) internal successors, (182), 6 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:01:02,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:01:02,629 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:01:02,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 07:01:02,629 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 07:01:02,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:01:02,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1793547573, now seen corresponding path program 1 times [2023-11-29 07:01:02,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:01:02,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893545454] [2023-11-29 07:01:02,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:01:02,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:01:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:02,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 07:01:02,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:01:02,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893545454] [2023-11-29 07:01:02,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893545454] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:01:02,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:01:02,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 07:01:02,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695476315] [2023-11-29 07:01:02,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:01:02,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 07:01:02,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:01:02,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 07:01:02,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 07:01:02,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 57 [2023-11-29 07:01:02,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 43 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 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 07:01:02,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:01:02,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 57 [2023-11-29 07:01:02,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:01:03,002 INFO L124 PetriNetUnfolderBase]: 1170/2021 cut-off events. [2023-11-29 07:01:03,002 INFO L125 PetriNetUnfolderBase]: For 844/870 co-relation queries the response was YES. [2023-11-29 07:01:03,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4535 conditions, 2021 events. 1170/2021 cut-off events. For 844/870 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 12382 event pairs, 178 based on Foata normal form. 90/2059 useless extension candidates. Maximal degree in co-relation 4514. Up to 1028 conditions per place. [2023-11-29 07:01:03,015 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 37 selfloop transitions, 5 changer transitions 0/64 dead transitions. [2023-11-29 07:01:03,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 64 transitions, 280 flow [2023-11-29 07:01:03,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 07:01:03,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 07:01:03,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 164 transitions. [2023-11-29 07:01:03,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7192982456140351 [2023-11-29 07:01:03,017 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 164 transitions. [2023-11-29 07:01:03,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 164 transitions. [2023-11-29 07:01:03,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:01:03,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 164 transitions. [2023-11-29 07:01:03,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 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 07:01:03,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 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 07:01:03,019 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 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 07:01:03,019 INFO L175 Difference]: Start difference. First operand has 64 places, 43 transitions, 150 flow. Second operand 4 states and 164 transitions. [2023-11-29 07:01:03,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 64 transitions, 280 flow [2023-11-29 07:01:03,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 64 transitions, 266 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-11-29 07:01:03,023 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 174 flow [2023-11-29 07:01:03,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=174, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2023-11-29 07:01:03,024 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2023-11-29 07:01:03,024 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 174 flow [2023-11-29 07:01:03,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 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 07:01:03,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:01:03,024 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] [2023-11-29 07:01:03,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 07:01:03,024 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 07:01:03,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:01:03,025 INFO L85 PathProgramCache]: Analyzing trace with hash 249469205, now seen corresponding path program 1 times [2023-11-29 07:01:03,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:01:03,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159343177] [2023-11-29 07:01:03,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:01:03,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:01:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:03,173 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 07:01:03,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:01:03,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159343177] [2023-11-29 07:01:03,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159343177] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:01:03,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:01:03,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 07:01:03,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392119176] [2023-11-29 07:01:03,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:01:03,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 07:01:03,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:01:03,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 07:01:03,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 07:01:03,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 57 [2023-11-29 07:01:03,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 174 flow. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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 07:01:03,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:01:03,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 57 [2023-11-29 07:01:03,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:01:03,531 INFO L124 PetriNetUnfolderBase]: 904/1601 cut-off events. [2023-11-29 07:01:03,531 INFO L125 PetriNetUnfolderBase]: For 664/674 co-relation queries the response was YES. [2023-11-29 07:01:03,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3982 conditions, 1601 events. 904/1601 cut-off events. For 664/674 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9142 event pairs, 117 based on Foata normal form. 78/1629 useless extension candidates. Maximal degree in co-relation 3963. Up to 513 conditions per place. [2023-11-29 07:01:03,546 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 47 selfloop transitions, 8 changer transitions 0/77 dead transitions. [2023-11-29 07:01:03,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 77 transitions, 365 flow [2023-11-29 07:01:03,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 07:01:03,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 07:01:03,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 207 transitions. [2023-11-29 07:01:03,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263157894736842 [2023-11-29 07:01:03,548 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 207 transitions. [2023-11-29 07:01:03,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 207 transitions. [2023-11-29 07:01:03,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:01:03,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 207 transitions. [2023-11-29 07:01:03,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 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 07:01:03,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 57.0) internal successors, (342), 6 states have internal predecessors, (342), 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 07:01:03,551 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 57.0) internal successors, (342), 6 states have internal predecessors, (342), 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 07:01:03,551 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 174 flow. Second operand 5 states and 207 transitions. [2023-11-29 07:01:03,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 77 transitions, 365 flow [2023-11-29 07:01:03,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 77 transitions, 362 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 07:01:03,555 INFO L231 Difference]: Finished difference. Result has 64 places, 51 transitions, 226 flow [2023-11-29 07:01:03,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=226, PETRI_PLACES=64, PETRI_TRANSITIONS=51} [2023-11-29 07:01:03,556 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 2 predicate places. [2023-11-29 07:01:03,556 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 226 flow [2023-11-29 07:01:03,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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 07:01:03,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:01:03,557 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:01:03,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 07:01:03,557 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 07:01:03,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:01:03,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1903567012, now seen corresponding path program 1 times [2023-11-29 07:01:03,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:01:03,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6785514] [2023-11-29 07:01:03,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:01:03,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:01:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:03,784 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 07:01:03,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:01:03,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6785514] [2023-11-29 07:01:03,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6785514] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:01:03,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:01:03,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 07:01:03,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897023349] [2023-11-29 07:01:03,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:01:03,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:01:03,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:01:03,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:01:03,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:01:03,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 57 [2023-11-29 07:01:03,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 226 flow. Second operand has 6 states, 6 states have (on average 32.833333333333336) internal successors, (197), 6 states have internal predecessors, (197), 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 07:01:03,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:01:03,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 57 [2023-11-29 07:01:03,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:01:04,080 INFO L124 PetriNetUnfolderBase]: 684/1205 cut-off events. [2023-11-29 07:01:04,080 INFO L125 PetriNetUnfolderBase]: For 1449/1451 co-relation queries the response was YES. [2023-11-29 07:01:04,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3450 conditions, 1205 events. 684/1205 cut-off events. For 1449/1451 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6498 event pairs, 105 based on Foata normal form. 40/1195 useless extension candidates. Maximal degree in co-relation 3428. Up to 454 conditions per place. [2023-11-29 07:01:04,089 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 43 selfloop transitions, 11 changer transitions 0/76 dead transitions. [2023-11-29 07:01:04,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 76 transitions, 395 flow [2023-11-29 07:01:04,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 07:01:04,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 07:01:04,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 236 transitions. [2023-11-29 07:01:04,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6900584795321637 [2023-11-29 07:01:04,092 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 236 transitions. [2023-11-29 07:01:04,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 236 transitions. [2023-11-29 07:01:04,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:01:04,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 236 transitions. [2023-11-29 07:01:04,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 39.333333333333336) internal successors, (236), 6 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 07:01:04,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 57.0) internal successors, (399), 7 states have internal predecessors, (399), 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 07:01:04,095 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 57.0) internal successors, (399), 7 states have internal predecessors, (399), 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 07:01:04,095 INFO L175 Difference]: Start difference. First operand has 64 places, 51 transitions, 226 flow. Second operand 6 states and 236 transitions. [2023-11-29 07:01:04,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 76 transitions, 395 flow [2023-11-29 07:01:04,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 76 transitions, 366 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-11-29 07:01:04,099 INFO L231 Difference]: Finished difference. Result has 67 places, 52 transitions, 242 flow [2023-11-29 07:01:04,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=242, PETRI_PLACES=67, PETRI_TRANSITIONS=52} [2023-11-29 07:01:04,100 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 5 predicate places. [2023-11-29 07:01:04,100 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 52 transitions, 242 flow [2023-11-29 07:01:04,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.833333333333336) internal successors, (197), 6 states have internal predecessors, (197), 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 07:01:04,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:01:04,100 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] [2023-11-29 07:01:04,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 07:01:04,101 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 07:01:04,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:01:04,101 INFO L85 PathProgramCache]: Analyzing trace with hash 232940119, now seen corresponding path program 1 times [2023-11-29 07:01:04,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:01:04,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376438206] [2023-11-29 07:01:04,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:01:04,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:01:04,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:04,386 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 07:01:04,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:01:04,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376438206] [2023-11-29 07:01:04,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376438206] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:01:04,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:01:04,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 07:01:04,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367897240] [2023-11-29 07:01:04,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:01:04,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:01:04,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:01:04,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:01:04,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:01:04,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 57 [2023-11-29 07:01:04,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 52 transitions, 242 flow. Second operand has 6 states, 6 states have (on average 30.333333333333332) internal successors, (182), 6 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:01:04,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:01:04,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 57 [2023-11-29 07:01:04,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:01:04,749 INFO L124 PetriNetUnfolderBase]: 958/1872 cut-off events. [2023-11-29 07:01:04,749 INFO L125 PetriNetUnfolderBase]: For 2980/3282 co-relation queries the response was YES. [2023-11-29 07:01:04,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5384 conditions, 1872 events. 958/1872 cut-off events. For 2980/3282 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 11757 event pairs, 216 based on Foata normal form. 43/1776 useless extension candidates. Maximal degree in co-relation 5362. Up to 922 conditions per place. [2023-11-29 07:01:04,759 INFO L140 encePairwiseOnDemand]: 47/57 looper letters, 47 selfloop transitions, 12 changer transitions 10/95 dead transitions. [2023-11-29 07:01:04,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 95 transitions, 518 flow [2023-11-29 07:01:04,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 07:01:04,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 07:01:04,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 257 transitions. [2023-11-29 07:01:04,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6441102756892231 [2023-11-29 07:01:04,761 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 257 transitions. [2023-11-29 07:01:04,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 257 transitions. [2023-11-29 07:01:04,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:01:04,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 257 transitions. [2023-11-29 07:01:04,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 36.714285714285715) internal successors, (257), 7 states have internal predecessors, (257), 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 07:01:04,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 57.0) internal successors, (456), 8 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:01:04,764 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 57.0) internal successors, (456), 8 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:01:04,764 INFO L175 Difference]: Start difference. First operand has 67 places, 52 transitions, 242 flow. Second operand 7 states and 257 transitions. [2023-11-29 07:01:04,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 95 transitions, 518 flow [2023-11-29 07:01:04,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 95 transitions, 466 flow, removed 20 selfloop flow, removed 5 redundant places. [2023-11-29 07:01:04,774 INFO L231 Difference]: Finished difference. Result has 72 places, 59 transitions, 283 flow [2023-11-29 07:01:04,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=283, PETRI_PLACES=72, PETRI_TRANSITIONS=59} [2023-11-29 07:01:04,774 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 10 predicate places. [2023-11-29 07:01:04,775 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 59 transitions, 283 flow [2023-11-29 07:01:04,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.333333333333332) internal successors, (182), 6 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:01:04,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:01:04,775 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] [2023-11-29 07:01:04,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 07:01:04,775 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 07:01:04,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:01:04,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1607387473, now seen corresponding path program 2 times [2023-11-29 07:01:04,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:01:04,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753270126] [2023-11-29 07:01:04,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:01:04,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:01:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:05,000 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 07:01:05,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:01:05,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753270126] [2023-11-29 07:01:05,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753270126] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:01:05,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:01:05,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 07:01:05,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179804910] [2023-11-29 07:01:05,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:01:05,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 07:01:05,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:01:05,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 07:01:05,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 07:01:05,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 57 [2023-11-29 07:01:05,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 59 transitions, 283 flow. Second operand has 7 states, 7 states have (on average 29.857142857142858) internal successors, (209), 7 states have internal predecessors, (209), 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 07:01:05,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:01:05,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 57 [2023-11-29 07:01:05,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:01:05,416 INFO L124 PetriNetUnfolderBase]: 1253/2442 cut-off events. [2023-11-29 07:01:05,416 INFO L125 PetriNetUnfolderBase]: For 2582/2934 co-relation queries the response was YES. [2023-11-29 07:01:05,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6840 conditions, 2442 events. 1253/2442 cut-off events. For 2582/2934 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 16718 event pairs, 298 based on Foata normal form. 61/2280 useless extension candidates. Maximal degree in co-relation 6816. Up to 844 conditions per place. [2023-11-29 07:01:05,426 INFO L140 encePairwiseOnDemand]: 48/57 looper letters, 31 selfloop transitions, 4 changer transitions 38/99 dead transitions. [2023-11-29 07:01:05,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 99 transitions, 554 flow [2023-11-29 07:01:05,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 07:01:05,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 07:01:05,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 287 transitions. [2023-11-29 07:01:05,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6293859649122807 [2023-11-29 07:01:05,428 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 287 transitions. [2023-11-29 07:01:05,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 287 transitions. [2023-11-29 07:01:05,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:01:05,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 287 transitions. [2023-11-29 07:01:05,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 35.875) internal successors, (287), 8 states have internal predecessors, (287), 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 07:01:05,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 57.0) internal successors, (513), 9 states have internal predecessors, (513), 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 07:01:05,431 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 57.0) internal successors, (513), 9 states have internal predecessors, (513), 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 07:01:05,431 INFO L175 Difference]: Start difference. First operand has 72 places, 59 transitions, 283 flow. Second operand 8 states and 287 transitions. [2023-11-29 07:01:05,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 99 transitions, 554 flow [2023-11-29 07:01:05,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 99 transitions, 548 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-29 07:01:05,443 INFO L231 Difference]: Finished difference. Result has 78 places, 51 transitions, 235 flow [2023-11-29 07:01:05,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=235, PETRI_PLACES=78, PETRI_TRANSITIONS=51} [2023-11-29 07:01:05,443 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 16 predicate places. [2023-11-29 07:01:05,443 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 51 transitions, 235 flow [2023-11-29 07:01:05,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.857142857142858) internal successors, (209), 7 states have internal predecessors, (209), 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 07:01:05,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:01:05,444 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] [2023-11-29 07:01:05,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 07:01:05,444 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 07:01:05,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:01:05,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1432037779, now seen corresponding path program 3 times [2023-11-29 07:01:05,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:01:05,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406680413] [2023-11-29 07:01:05,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:01:05,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:01:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:05,683 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 07:01:05,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:01:05,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406680413] [2023-11-29 07:01:05,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406680413] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:01:05,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:01:05,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 07:01:05,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019187342] [2023-11-29 07:01:05,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:01:05,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:01:05,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:01:05,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:01:05,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:01:05,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 57 [2023-11-29 07:01:05,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 51 transitions, 235 flow. Second operand has 6 states, 6 states have (on average 30.333333333333332) internal successors, (182), 6 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:01:05,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:01:05,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 57 [2023-11-29 07:01:05,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:01:06,083 INFO L124 PetriNetUnfolderBase]: 891/1913 cut-off events. [2023-11-29 07:01:06,083 INFO L125 PetriNetUnfolderBase]: For 1882/2012 co-relation queries the response was YES. [2023-11-29 07:01:06,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5184 conditions, 1913 events. 891/1913 cut-off events. For 1882/2012 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 13197 event pairs, 214 based on Foata normal form. 25/1768 useless extension candidates. Maximal degree in co-relation 5157. Up to 740 conditions per place. [2023-11-29 07:01:06,095 INFO L140 encePairwiseOnDemand]: 48/57 looper letters, 37 selfloop transitions, 9 changer transitions 12/84 dead transitions. [2023-11-29 07:01:06,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 84 transitions, 461 flow [2023-11-29 07:01:06,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 07:01:06,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 07:01:06,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 246 transitions. [2023-11-29 07:01:06,097 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6165413533834586 [2023-11-29 07:01:06,097 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 246 transitions. [2023-11-29 07:01:06,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 246 transitions. [2023-11-29 07:01:06,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:01:06,098 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 246 transitions. [2023-11-29 07:01:06,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 35.142857142857146) internal successors, (246), 7 states have internal predecessors, (246), 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 07:01:06,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 57.0) internal successors, (456), 8 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:01:06,100 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 57.0) internal successors, (456), 8 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:01:06,100 INFO L175 Difference]: Start difference. First operand has 78 places, 51 transitions, 235 flow. Second operand 7 states and 246 transitions. [2023-11-29 07:01:06,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 84 transitions, 461 flow [2023-11-29 07:01:06,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 84 transitions, 434 flow, removed 7 selfloop flow, removed 6 redundant places. [2023-11-29 07:01:06,115 INFO L231 Difference]: Finished difference. Result has 77 places, 56 transitions, 285 flow [2023-11-29 07:01:06,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=285, PETRI_PLACES=77, PETRI_TRANSITIONS=56} [2023-11-29 07:01:06,115 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 15 predicate places. [2023-11-29 07:01:06,115 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 56 transitions, 285 flow [2023-11-29 07:01:06,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.333333333333332) internal successors, (182), 6 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:01:06,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:01:06,116 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] [2023-11-29 07:01:06,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 07:01:06,116 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 07:01:06,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:01:06,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1903320593, now seen corresponding path program 4 times [2023-11-29 07:01:06,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:01:06,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118553120] [2023-11-29 07:01:06,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:01:06,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:01:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:06,361 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 07:01:06,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:01:06,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118553120] [2023-11-29 07:01:06,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118553120] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:01:06,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:01:06,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 07:01:06,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532099885] [2023-11-29 07:01:06,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:01:06,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:01:06,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:01:06,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:01:06,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:01:06,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 57 [2023-11-29 07:01:06,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 56 transitions, 285 flow. Second operand has 6 states, 6 states have (on average 32.833333333333336) internal successors, (197), 6 states have internal predecessors, (197), 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 07:01:06,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:01:06,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 57 [2023-11-29 07:01:06,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:01:06,736 INFO L124 PetriNetUnfolderBase]: 933/2099 cut-off events. [2023-11-29 07:01:06,736 INFO L125 PetriNetUnfolderBase]: For 2826/3105 co-relation queries the response was YES. [2023-11-29 07:01:06,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5846 conditions, 2099 events. 933/2099 cut-off events. For 2826/3105 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 15721 event pairs, 269 based on Foata normal form. 46/1889 useless extension candidates. Maximal degree in co-relation 5819. Up to 783 conditions per place. [2023-11-29 07:01:06,745 INFO L140 encePairwiseOnDemand]: 52/57 looper letters, 23 selfloop transitions, 1 changer transitions 29/82 dead transitions. [2023-11-29 07:01:06,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 82 transitions, 459 flow [2023-11-29 07:01:06,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 07:01:06,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 07:01:06,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 228 transitions. [2023-11-29 07:01:06,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-29 07:01:06,747 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 228 transitions. [2023-11-29 07:01:06,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 228 transitions. [2023-11-29 07:01:06,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:01:06,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 228 transitions. [2023-11-29 07:01:06,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 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 07:01:06,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 57.0) internal successors, (399), 7 states have internal predecessors, (399), 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 07:01:06,749 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 57.0) internal successors, (399), 7 states have internal predecessors, (399), 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 07:01:06,749 INFO L175 Difference]: Start difference. First operand has 77 places, 56 transitions, 285 flow. Second operand 6 states and 228 transitions. [2023-11-29 07:01:06,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 82 transitions, 459 flow [2023-11-29 07:01:06,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 82 transitions, 447 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-11-29 07:01:06,762 INFO L231 Difference]: Finished difference. Result has 81 places, 49 transitions, 228 flow [2023-11-29 07:01:06,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=228, PETRI_PLACES=81, PETRI_TRANSITIONS=49} [2023-11-29 07:01:06,763 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 19 predicate places. [2023-11-29 07:01:06,763 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 49 transitions, 228 flow [2023-11-29 07:01:06,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.833333333333336) internal successors, (197), 6 states have internal predecessors, (197), 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 07:01:06,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:01:06,763 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] [2023-11-29 07:01:06,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 07:01:06,764 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 07:01:06,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:01:06,764 INFO L85 PathProgramCache]: Analyzing trace with hash -226211579, now seen corresponding path program 5 times [2023-11-29 07:01:06,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:01:06,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985246004] [2023-11-29 07:01:06,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:01:06,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:01:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:07,090 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 07:01:07,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:01:07,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985246004] [2023-11-29 07:01:07,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985246004] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:01:07,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:01:07,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 07:01:07,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679933211] [2023-11-29 07:01:07,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:01:07,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 07:01:07,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:01:07,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 07:01:07,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 07:01:07,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 57 [2023-11-29 07:01:07,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 49 transitions, 228 flow. Second operand has 7 states, 7 states have (on average 34.142857142857146) internal successors, (239), 7 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:01:07,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:01:07,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 57 [2023-11-29 07:01:07,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:01:07,339 INFO L124 PetriNetUnfolderBase]: 393/922 cut-off events. [2023-11-29 07:01:07,339 INFO L125 PetriNetUnfolderBase]: For 905/1040 co-relation queries the response was YES. [2023-11-29 07:01:07,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2473 conditions, 922 events. 393/922 cut-off events. For 905/1040 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5556 event pairs, 146 based on Foata normal form. 14/830 useless extension candidates. Maximal degree in co-relation 2444. Up to 327 conditions per place. [2023-11-29 07:01:07,342 INFO L140 encePairwiseOnDemand]: 50/57 looper letters, 18 selfloop transitions, 2 changer transitions 22/73 dead transitions. [2023-11-29 07:01:07,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 73 transitions, 382 flow [2023-11-29 07:01:07,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 07:01:07,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 07:01:07,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 299 transitions. [2023-11-29 07:01:07,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6557017543859649 [2023-11-29 07:01:07,344 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 299 transitions. [2023-11-29 07:01:07,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 299 transitions. [2023-11-29 07:01:07,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:01:07,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 299 transitions. [2023-11-29 07:01:07,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 37.375) internal successors, (299), 8 states have internal predecessors, (299), 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 07:01:07,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 57.0) internal successors, (513), 9 states have internal predecessors, (513), 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 07:01:07,347 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 57.0) internal successors, (513), 9 states have internal predecessors, (513), 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 07:01:07,347 INFO L175 Difference]: Start difference. First operand has 81 places, 49 transitions, 228 flow. Second operand 8 states and 299 transitions. [2023-11-29 07:01:07,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 73 transitions, 382 flow [2023-11-29 07:01:07,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 73 transitions, 349 flow, removed 14 selfloop flow, removed 8 redundant places. [2023-11-29 07:01:07,352 INFO L231 Difference]: Finished difference. Result has 81 places, 49 transitions, 221 flow [2023-11-29 07:01:07,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=221, PETRI_PLACES=81, PETRI_TRANSITIONS=49} [2023-11-29 07:01:07,352 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 19 predicate places. [2023-11-29 07:01:07,352 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 49 transitions, 221 flow [2023-11-29 07:01:07,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.142857142857146) internal successors, (239), 7 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:01:07,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:01:07,353 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] [2023-11-29 07:01:07,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 07:01:07,353 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 07:01:07,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:01:07,353 INFO L85 PathProgramCache]: Analyzing trace with hash 2078751829, now seen corresponding path program 6 times [2023-11-29 07:01:07,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:01:07,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561002378] [2023-11-29 07:01:07,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:01:07,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:01:07,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 07:01:07,382 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 07:01:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 07:01:07,445 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 07:01:07,445 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 07:01:07,446 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-29 07:01:07,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-29 07:01:07,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-29 07:01:07,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-29 07:01:07,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-29 07:01:07,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-29 07:01:07,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-29 07:01:07,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-29 07:01:07,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-29 07:01:07,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-29 07:01:07,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-29 07:01:07,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-29 07:01:07,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-29 07:01:07,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 07:01:07,449 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:01:07,454 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 07:01:07,454 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 07:01:07,501 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 07:01:07,503 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 07:01:07,504 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 07:01:07,518 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 07:01:07,519 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 07:01:07,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 07:01:07 BasicIcfg [2023-11-29 07:01:07,531 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 07:01:07,532 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 07:01:07,532 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 07:01:07,532 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 07:01:07,532 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:00:56" (3/4) ... [2023-11-29 07:01:07,533 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 07:01:07,534 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 07:01:07,535 INFO L158 Benchmark]: Toolchain (without parser) took 11790.73ms. Allocated memory was 174.1MB in the beginning and 408.9MB in the end (delta: 234.9MB). Free memory was 137.8MB in the beginning and 247.0MB in the end (delta: -109.1MB). Peak memory consumption was 127.4MB. Max. memory is 16.1GB. [2023-11-29 07:01:07,535 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 174.1MB. Free memory was 139.4MB in the beginning and 139.3MB in the end (delta: 16.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 07:01:07,535 INFO L158 Benchmark]: CACSL2BoogieTranslator took 447.79ms. Allocated memory is still 174.1MB. Free memory was 137.8MB in the beginning and 114.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 07:01:07,535 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.69ms. Allocated memory is still 174.1MB. Free memory was 114.8MB in the beginning and 112.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 07:01:07,536 INFO L158 Benchmark]: Boogie Preprocessor took 58.72ms. Allocated memory is still 174.1MB. Free memory was 112.0MB in the beginning and 108.5MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 07:01:07,536 INFO L158 Benchmark]: RCFGBuilder took 684.69ms. Allocated memory was 174.1MB in the beginning and 234.9MB in the end (delta: 60.8MB). Free memory was 108.5MB in the beginning and 190.2MB in the end (delta: -81.8MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. [2023-11-29 07:01:07,536 INFO L158 Benchmark]: TraceAbstraction took 10543.33ms. Allocated memory was 234.9MB in the beginning and 408.9MB in the end (delta: 174.1MB). Free memory was 189.2MB in the beginning and 248.0MB in the end (delta: -58.8MB). Peak memory consumption was 116.3MB. Max. memory is 16.1GB. [2023-11-29 07:01:07,536 INFO L158 Benchmark]: Witness Printer took 2.57ms. Allocated memory is still 408.9MB. Free memory was 248.0MB in the beginning and 247.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 07:01:07,538 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.16ms. Allocated memory is still 174.1MB. Free memory was 139.4MB in the beginning and 139.3MB in the end (delta: 16.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 447.79ms. Allocated memory is still 174.1MB. Free memory was 137.8MB in the beginning and 114.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.69ms. Allocated memory is still 174.1MB. Free memory was 114.8MB in the beginning and 112.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.72ms. Allocated memory is still 174.1MB. Free memory was 112.0MB in the beginning and 108.5MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 684.69ms. Allocated memory was 174.1MB in the beginning and 234.9MB in the end (delta: 60.8MB). Free memory was 108.5MB in the beginning and 190.2MB in the end (delta: -81.8MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10543.33ms. Allocated memory was 234.9MB in the beginning and 408.9MB in the end (delta: 174.1MB). Free memory was 189.2MB in the beginning and 248.0MB in the end (delta: -58.8MB). Peak memory consumption was 116.3MB. Max. memory is 16.1GB. * Witness Printer took 2.57ms. Allocated memory is still 408.9MB. Free memory was 248.0MB in the beginning and 247.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L723] 0 int b = 0; [L724] 0 _Bool main$tmp_guard0; [L725] 0 _Bool main$tmp_guard1; [L727] 0 int x = 0; [L729] 0 int y = 0; [L731] 0 int z = 0; [L732] 0 _Bool z$flush_delayed; [L733] 0 int z$mem_tmp; [L734] 0 _Bool z$r_buff0_thd0; [L735] 0 _Bool z$r_buff0_thd1; [L736] 0 _Bool z$r_buff0_thd2; [L737] 0 _Bool z$r_buff0_thd3; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$read_delayed; [L743] 0 int *z$read_delayed_var; [L744] 0 int z$w_buff0; [L745] 0 _Bool z$w_buff0_used; [L746] 0 int z$w_buff1; [L747] 0 _Bool z$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L845] 0 pthread_t t852; [L846] FCALL, FORK 0 pthread_create(&t852, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t852={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L847] 0 pthread_t t853; [L848] FCALL, FORK 0 pthread_create(&t853, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t852={5:0}, t853={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L849] 0 pthread_t t854; [L850] FCALL, FORK 0 pthread_create(&t854, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t852={5:0}, t853={6:0}, t854={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L802] 3 z$w_buff1 = z$w_buff0 [L803] 3 z$w_buff0 = 1 [L804] 3 z$w_buff1_used = z$w_buff0_used [L805] 3 z$w_buff0_used = (_Bool)1 [L806] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L806] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L814] 3 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L817] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L820] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L768] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L778] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L779] 2 z$flush_delayed = weak$$choice2 [L780] 2 z$mem_tmp = z [L781] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L782] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L783] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L784] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L785] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L787] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] 2 __unbuffered_p1_EBX = z [L789] 2 z = z$flush_delayed ? z$mem_tmp : z [L790] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L823] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L824] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L825] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L826] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L827] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L830] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L852] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t852={5:0}, t853={6:0}, t854={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L854] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L854] RET 0 assume_abort_if_not(main$tmp_guard0) [L856] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t852={5:0}, t853={6:0}, t854={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L863] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t852={5:0}, t853={6:0}, t854={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L865] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix032.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 843]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 85 locations, 13 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: 10.4s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 847 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 709 mSDsluCounter, 256 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 190 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2150 IncrementalHoareTripleChecker+Invalid, 2185 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 66 mSDtfsCounter, 2150 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=285occurred in iteration=17, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 429 NumberOfCodeBlocks, 429 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 373 ConstructedInterpolants, 0 QuantifiedInterpolants, 2248 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 07:01:07,565 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/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_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix032.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/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 0032fd1b0879d5a3b3f4ef67d0327f489d9a349f94447e8a77b1324c1477f2bb --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 07:01:09,524 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 07:01:09,601 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 07:01:09,607 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 07:01:09,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 07:01:09,635 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 07:01:09,635 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 07:01:09,636 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 07:01:09,637 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 07:01:09,637 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 07:01:09,638 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 07:01:09,638 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 07:01:09,639 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 07:01:09,640 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 07:01:09,640 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 07:01:09,641 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 07:01:09,641 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 07:01:09,642 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 07:01:09,643 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 07:01:09,643 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 07:01:09,644 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 07:01:09,644 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 07:01:09,645 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 07:01:09,645 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 07:01:09,646 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 07:01:09,646 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 07:01:09,646 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 07:01:09,647 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 07:01:09,647 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 07:01:09,647 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 07:01:09,648 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 07:01:09,648 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 07:01:09,649 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 07:01:09,649 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 07:01:09,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 07:01:09,649 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 07:01:09,650 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 07:01:09,650 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 07:01:09,650 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 07:01:09,650 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 07:01:09,651 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 07:01:09,651 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 07:01:09,651 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 07:01:09,651 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 07:01:09,652 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_ec990e9d-2518-4374-aa81-4d9cebda7224/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_ec990e9d-2518-4374-aa81-4d9cebda7224/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 -> 0032fd1b0879d5a3b3f4ef67d0327f489d9a349f94447e8a77b1324c1477f2bb [2023-11-29 07:01:09,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 07:01:09,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 07:01:09,936 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 07:01:09,937 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 07:01:09,937 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 07:01:09,939 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix032.opt.i [2023-11-29 07:01:12,757 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 07:01:12,994 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 07:01:12,995 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/sv-benchmarks/c/pthread-wmm/mix032.opt.i [2023-11-29 07:01:13,013 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/data/8c33223dc/d00f2d6b7d844991b797c3fcfc354117/FLAG136d10638 [2023-11-29 07:01:13,024 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/data/8c33223dc/d00f2d6b7d844991b797c3fcfc354117 [2023-11-29 07:01:13,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 07:01:13,028 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 07:01:13,029 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 07:01:13,029 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 07:01:13,033 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 07:01:13,033 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:01:13" (1/1) ... [2023-11-29 07:01:13,034 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76a85ae4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:13, skipping insertion in model container [2023-11-29 07:01:13,034 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:01:13" (1/1) ... [2023-11-29 07:01:13,081 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 07:01:13,392 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 07:01:13,406 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 07:01:13,454 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 07:01:13,497 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 07:01:13,498 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 07:01:13,503 INFO L206 MainTranslator]: Completed translation [2023-11-29 07:01:13,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:13 WrapperNode [2023-11-29 07:01:13,504 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 07:01:13,505 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 07:01:13,505 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 07:01:13,505 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 07:01:13,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:13" (1/1) ... [2023-11-29 07:01:13,531 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:13" (1/1) ... [2023-11-29 07:01:13,556 INFO L138 Inliner]: procedures = 179, calls = 63, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 145 [2023-11-29 07:01:13,557 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 07:01:13,558 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 07:01:13,558 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 07:01:13,558 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 07:01:13,567 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:13" (1/1) ... [2023-11-29 07:01:13,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:13" (1/1) ... [2023-11-29 07:01:13,570 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:13" (1/1) ... [2023-11-29 07:01:13,588 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-29 07:01:13,588 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:13" (1/1) ... [2023-11-29 07:01:13,589 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:13" (1/1) ... [2023-11-29 07:01:13,600 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:13" (1/1) ... [2023-11-29 07:01:13,602 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:13" (1/1) ... [2023-11-29 07:01:13,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:13" (1/1) ... [2023-11-29 07:01:13,608 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:13" (1/1) ... [2023-11-29 07:01:13,612 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 07:01:13,613 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 07:01:13,614 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 07:01:13,614 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 07:01:13,615 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:13" (1/1) ... [2023-11-29 07:01:13,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 07:01:13,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:01:13,640 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 07:01:13,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 07:01:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 07:01:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 07:01:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 07:01:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 07:01:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 07:01:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 07:01:13,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 07:01:13,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 07:01:13,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 07:01:13,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 07:01:13,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 07:01:13,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 07:01:13,681 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 07:01:13,681 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 07:01:13,682 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 07:01:13,682 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 07:01:13,682 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 07:01:13,682 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 07:01:13,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 07:01:13,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 07:01:13,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 07:01:13,685 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 07:01:13,833 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 07:01:13,836 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 07:01:14,136 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 07:01:14,318 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 07:01:14,318 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 07:01:14,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:01:14 BoogieIcfgContainer [2023-11-29 07:01:14,319 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 07:01:14,322 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 07:01:14,322 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 07:01:14,325 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 07:01:14,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 07:01:13" (1/3) ... [2023-11-29 07:01:14,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eece298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:01:14, skipping insertion in model container [2023-11-29 07:01:14,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:13" (2/3) ... [2023-11-29 07:01:14,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eece298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:01:14, skipping insertion in model container [2023-11-29 07:01:14,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:01:14" (3/3) ... [2023-11-29 07:01:14,327 INFO L112 eAbstractionObserver]: Analyzing ICFG mix032.opt.i [2023-11-29 07:01:14,345 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 07:01:14,346 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-29 07:01:14,346 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 07:01:14,396 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 07:01:14,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 57 transitions, 126 flow [2023-11-29 07:01:14,476 INFO L124 PetriNetUnfolderBase]: 2/54 cut-off events. [2023-11-29 07:01:14,477 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 07:01:14,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 54 events. 2/54 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 107 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2023-11-29 07:01:14,480 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 57 transitions, 126 flow [2023-11-29 07:01:14,485 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 54 transitions, 117 flow [2023-11-29 07:01:14,495 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 07:01:14,501 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;@4ca48b02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 07:01:14,501 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-29 07:01:14,504 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 07:01:14,505 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 07:01:14,505 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 07:01:14,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:01:14,506 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 07:01:14,506 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 07:01:14,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:01:14,512 INFO L85 PathProgramCache]: Analyzing trace with hash 12304, now seen corresponding path program 1 times [2023-11-29 07:01:14,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:01:14,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1750027942] [2023-11-29 07:01:14,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:01:14,525 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:01:14,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:01:14,527 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:01:14,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 07:01:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:14,634 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 07:01:14,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:01:14,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 07:01:14,701 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 07:01:14,701 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:01:14,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:01:14,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1750027942] [2023-11-29 07:01:14,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1750027942] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:01:14,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:01:14,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 07:01:14,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011205982] [2023-11-29 07:01:14,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:01:14,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:01:14,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:01:14,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:01:14,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:01:14,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 57 [2023-11-29 07:01:14,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 07:01:14,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:01:14,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 57 [2023-11-29 07:01:14,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:01:15,072 INFO L124 PetriNetUnfolderBase]: 459/969 cut-off events. [2023-11-29 07:01:15,072 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-29 07:01:15,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1709 conditions, 969 events. 459/969 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 6903 event pairs, 341 based on Foata normal form. 60/938 useless extension candidates. Maximal degree in co-relation 1695. Up to 539 conditions per place. [2023-11-29 07:01:15,087 INFO L140 encePairwiseOnDemand]: 52/57 looper letters, 26 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-11-29 07:01:15,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 57 transitions, 179 flow [2023-11-29 07:01:15,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:01:15,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:01:15,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2023-11-29 07:01:15,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7426900584795322 [2023-11-29 07:01:15,101 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 127 transitions. [2023-11-29 07:01:15,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 127 transitions. [2023-11-29 07:01:15,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:01:15,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 127 transitions. [2023-11-29 07:01:15,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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 07:01:15,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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 07:01:15,111 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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 07:01:15,113 INFO L175 Difference]: Start difference. First operand has 62 places, 54 transitions, 117 flow. Second operand 3 states and 127 transitions. [2023-11-29 07:01:15,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 57 transitions, 179 flow [2023-11-29 07:01:15,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 57 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 07:01:15,119 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 110 flow [2023-11-29 07:01:15,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2023-11-29 07:01:15,124 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2023-11-29 07:01:15,125 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 110 flow [2023-11-29 07:01:15,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 07:01:15,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:01:15,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 07:01:15,131 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 07:01:15,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:01:15,326 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 07:01:15,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:01:15,327 INFO L85 PathProgramCache]: Analyzing trace with hash 12305, now seen corresponding path program 1 times [2023-11-29 07:01:15,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:01:15,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2055359801] [2023-11-29 07:01:15,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:01:15,328 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:01:15,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:01:15,329 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:01:15,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 07:01:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:15,401 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 07:01:15,402 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:01:15,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 07:01:15,421 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 07:01:15,421 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:01:15,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:01:15,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2055359801] [2023-11-29 07:01:15,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2055359801] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:01:15,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:01:15,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 07:01:15,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748121993] [2023-11-29 07:01:15,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:01:15,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:01:15,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:01:15,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:01:15,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:01:15,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 57 [2023-11-29 07:01:15,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:01:15,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:01:15,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 57 [2023-11-29 07:01:15,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:01:15,708 INFO L124 PetriNetUnfolderBase]: 459/968 cut-off events. [2023-11-29 07:01:15,708 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-29 07:01:15,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1736 conditions, 968 events. 459/968 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 6887 event pairs, 341 based on Foata normal form. 1/878 useless extension candidates. Maximal degree in co-relation 1725. Up to 538 conditions per place. [2023-11-29 07:01:15,718 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 25 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-11-29 07:01:15,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 56 transitions, 176 flow [2023-11-29 07:01:15,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:01:15,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:01:15,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2023-11-29 07:01:15,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7426900584795322 [2023-11-29 07:01:15,722 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 127 transitions. [2023-11-29 07:01:15,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 127 transitions. [2023-11-29 07:01:15,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:01:15,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 127 transitions. [2023-11-29 07:01:15,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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 07:01:15,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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 07:01:15,725 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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 07:01:15,725 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 110 flow. Second operand 3 states and 127 transitions. [2023-11-29 07:01:15,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 56 transitions, 176 flow [2023-11-29 07:01:15,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 56 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:01:15,730 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 108 flow [2023-11-29 07:01:15,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2023-11-29 07:01:15,731 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2023-11-29 07:01:15,731 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 108 flow [2023-11-29 07:01:15,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:01:15,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:01:15,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 07:01:15,734 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 07:01:15,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:01:15,933 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 07:01:15,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:01:15,933 INFO L85 PathProgramCache]: Analyzing trace with hash 366930743, now seen corresponding path program 1 times [2023-11-29 07:01:15,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:01:15,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1067534920] [2023-11-29 07:01:15,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:01:15,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:01:15,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:01:15,936 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:01:15,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 07:01:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:16,030 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 07:01:16,032 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:01:16,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 07:01:16,042 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 07:01:16,042 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:01:16,042 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:01:16,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1067534920] [2023-11-29 07:01:16,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1067534920] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:01:16,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:01:16,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:01:16,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867060215] [2023-11-29 07:01:16,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:01:16,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:01:16,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:01:16,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:01:16,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:01:16,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 57 [2023-11-29 07:01:16,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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 07:01:16,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:01:16,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 57 [2023-11-29 07:01:16,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:01:16,249 INFO L124 PetriNetUnfolderBase]: 460/966 cut-off events. [2023-11-29 07:01:16,250 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-29 07:01:16,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1737 conditions, 966 events. 460/966 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 6911 event pairs, 341 based on Foata normal form. 0/879 useless extension candidates. Maximal degree in co-relation 1726. Up to 538 conditions per place. [2023-11-29 07:01:16,257 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 26 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-29 07:01:16,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 55 transitions, 176 flow [2023-11-29 07:01:16,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:01:16,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:01:16,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2023-11-29 07:01:16,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7309941520467836 [2023-11-29 07:01:16,259 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 125 transitions. [2023-11-29 07:01:16,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 125 transitions. [2023-11-29 07:01:16,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:01:16,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 125 transitions. [2023-11-29 07:01:16,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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 07:01:16,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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 07:01:16,262 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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 07:01:16,262 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 108 flow. Second operand 3 states and 125 transitions. [2023-11-29 07:01:16,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 55 transitions, 176 flow [2023-11-29 07:01:16,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 55 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:01:16,265 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 106 flow [2023-11-29 07:01:16,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2023-11-29 07:01:16,266 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -5 predicate places. [2023-11-29 07:01:16,266 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 106 flow [2023-11-29 07:01:16,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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 07:01:16,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:01:16,267 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 07:01:16,269 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 07:01:16,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:01:16,468 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 07:01:16,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:01:16,468 INFO L85 PathProgramCache]: Analyzing trace with hash 366930744, now seen corresponding path program 1 times [2023-11-29 07:01:16,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:01:16,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1833800225] [2023-11-29 07:01:16,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:01:16,469 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:01:16,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:01:16,470 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:01:16,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 07:01:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:16,560 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 07:01:16,561 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:01:16,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 07:01:16,581 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 07:01:16,581 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:01:16,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:01:16,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1833800225] [2023-11-29 07:01:16,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1833800225] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:01:16,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:01:16,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:01:16,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288856594] [2023-11-29 07:01:16,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:01:16,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:01:16,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:01:16,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:01:16,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:01:16,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 57 [2023-11-29 07:01:16,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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 07:01:16,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:01:16,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 57 [2023-11-29 07:01:16,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:01:16,825 INFO L124 PetriNetUnfolderBase]: 459/963 cut-off events. [2023-11-29 07:01:16,825 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-11-29 07:01:16,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1732 conditions, 963 events. 459/963 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 6871 event pairs, 340 based on Foata normal form. 2/879 useless extension candidates. Maximal degree in co-relation 1722. Up to 535 conditions per place. [2023-11-29 07:01:16,834 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 25 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-11-29 07:01:16,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 54 transitions, 172 flow [2023-11-29 07:01:16,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:01:16,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:01:16,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2023-11-29 07:01:16,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7426900584795322 [2023-11-29 07:01:16,836 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 127 transitions. [2023-11-29 07:01:16,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 127 transitions. [2023-11-29 07:01:16,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:01:16,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 127 transitions. [2023-11-29 07:01:16,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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 07:01:16,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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 07:01:16,839 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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 07:01:16,839 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 106 flow. Second operand 3 states and 127 transitions. [2023-11-29 07:01:16,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 54 transitions, 172 flow [2023-11-29 07:01:16,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 54 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:01:16,842 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 104 flow [2023-11-29 07:01:16,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-11-29 07:01:16,843 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2023-11-29 07:01:16,843 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 104 flow [2023-11-29 07:01:16,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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 07:01:16,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:01:16,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:01:16,846 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 07:01:17,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:01:17,047 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 07:01:17,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:01:17,048 INFO L85 PathProgramCache]: Analyzing trace with hash 542376577, now seen corresponding path program 1 times [2023-11-29 07:01:17,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:01:17,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [801721136] [2023-11-29 07:01:17,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:01:17,048 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:01:17,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:01:17,049 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:01:17,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 07:01:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:17,144 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 07:01:17,146 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:01:17,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 07:01:17,157 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 07:01:17,157 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:01:17,157 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:01:17,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [801721136] [2023-11-29 07:01:17,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [801721136] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:01:17,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:01:17,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:01:17,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574655338] [2023-11-29 07:01:17,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:01:17,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:01:17,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:01:17,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:01:17,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:01:17,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 57 [2023-11-29 07:01:17,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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 07:01:17,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:01:17,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 57 [2023-11-29 07:01:17,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:01:17,360 INFO L124 PetriNetUnfolderBase]: 466/965 cut-off events. [2023-11-29 07:01:17,360 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-11-29 07:01:17,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1747 conditions, 965 events. 466/965 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 6870 event pairs, 194 based on Foata normal form. 0/890 useless extension candidates. Maximal degree in co-relation 1737. Up to 536 conditions per place. [2023-11-29 07:01:17,366 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 26 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-29 07:01:17,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 53 transitions, 172 flow [2023-11-29 07:01:17,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:01:17,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:01:17,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2023-11-29 07:01:17,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7309941520467836 [2023-11-29 07:01:17,368 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 125 transitions. [2023-11-29 07:01:17,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 125 transitions. [2023-11-29 07:01:17,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:01:17,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 125 transitions. [2023-11-29 07:01:17,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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 07:01:17,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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 07:01:17,370 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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 07:01:17,371 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 104 flow. Second operand 3 states and 125 transitions. [2023-11-29 07:01:17,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 53 transitions, 172 flow [2023-11-29 07:01:17,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:01:17,373 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-29 07:01:17,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-11-29 07:01:17,374 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -7 predicate places. [2023-11-29 07:01:17,374 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-29 07:01:17,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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 07:01:17,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:01:17,375 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:01:17,377 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-29 07:01:17,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:01:17,577 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 07:01:17,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:01:17,578 INFO L85 PathProgramCache]: Analyzing trace with hash 542376578, now seen corresponding path program 1 times [2023-11-29 07:01:17,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:01:17,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1872251066] [2023-11-29 07:01:17,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:01:17,578 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:01:17,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:01:17,579 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:01:17,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 07:01:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:17,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 07:01:17,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:01:17,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 07:01:17,696 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 07:01:17,697 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:01:17,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:01:17,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1872251066] [2023-11-29 07:01:17,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1872251066] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:01:17,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:01:17,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:01:17,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688760570] [2023-11-29 07:01:17,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:01:17,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:01:17,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:01:17,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:01:17,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:01:17,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 57 [2023-11-29 07:01:17,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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 07:01:17,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:01:17,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 57 [2023-11-29 07:01:17,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:01:17,935 INFO L124 PetriNetUnfolderBase]: 459/952 cut-off events. [2023-11-29 07:01:17,935 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-11-29 07:01:17,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1725 conditions, 952 events. 459/952 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 6716 event pairs, 194 based on Foata normal form. 6/888 useless extension candidates. Maximal degree in co-relation 1715. Up to 523 conditions per place. [2023-11-29 07:01:17,943 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 25 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-11-29 07:01:17,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 52 transitions, 168 flow [2023-11-29 07:01:17,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:01:17,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:01:17,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2023-11-29 07:01:17,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7426900584795322 [2023-11-29 07:01:17,945 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 127 transitions. [2023-11-29 07:01:17,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 127 transitions. [2023-11-29 07:01:17,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:01:17,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 127 transitions. [2023-11-29 07:01:17,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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 07:01:17,947 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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 07:01:17,947 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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 07:01:17,947 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 127 transitions. [2023-11-29 07:01:17,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 52 transitions, 168 flow [2023-11-29 07:01:17,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 52 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:01:17,950 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-29 07:01:17,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-11-29 07:01:17,951 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -8 predicate places. [2023-11-29 07:01:17,951 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-29 07:01:17,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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 07:01:17,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:01:17,952 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:01:17,954 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 07:01:18,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:01:18,155 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 07:01:18,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:01:18,155 INFO L85 PathProgramCache]: Analyzing trace with hash 274017854, now seen corresponding path program 1 times [2023-11-29 07:01:18,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:01:18,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1026987194] [2023-11-29 07:01:18,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:01:18,156 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:01:18,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:01:18,157 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:01:18,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 07:01:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:18,236 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 07:01:18,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:01:18,257 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 07:01:18,258 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:01:18,258 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:01:18,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1026987194] [2023-11-29 07:01:18,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1026987194] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:01:18,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:01:18,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 07:01:18,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498218025] [2023-11-29 07:01:18,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:01:18,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:01:18,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:01:18,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:01:18,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:01:18,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 57 [2023-11-29 07:01:18,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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 07:01:18,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:01:18,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 57 [2023-11-29 07:01:18,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:01:18,408 INFO L124 PetriNetUnfolderBase]: 361/830 cut-off events. [2023-11-29 07:01:18,409 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2023-11-29 07:01:18,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1451 conditions, 830 events. 361/830 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5769 event pairs, 67 based on Foata normal form. 0/821 useless extension candidates. Maximal degree in co-relation 1441. Up to 439 conditions per place. [2023-11-29 07:01:18,415 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 25 selfloop transitions, 2 changer transitions 2/54 dead transitions. [2023-11-29 07:01:18,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 54 transitions, 178 flow [2023-11-29 07:01:18,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:01:18,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:01:18,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2023-11-29 07:01:18,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7719298245614035 [2023-11-29 07:01:18,432 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 132 transitions. [2023-11-29 07:01:18,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 132 transitions. [2023-11-29 07:01:18,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:01:18,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 132 transitions. [2023-11-29 07:01:18,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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 07:01:18,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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 07:01:18,434 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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 07:01:18,434 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 132 transitions. [2023-11-29 07:01:18,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 54 transitions, 178 flow [2023-11-29 07:01:18,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 54 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:01:18,436 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 96 flow [2023-11-29 07:01:18,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2023-11-29 07:01:18,437 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -9 predicate places. [2023-11-29 07:01:18,437 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 96 flow [2023-11-29 07:01:18,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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 07:01:18,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:01:18,437 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:01:18,441 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 07:01:18,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:01:18,638 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 07:01:18,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:01:18,638 INFO L85 PathProgramCache]: Analyzing trace with hash 114851301, now seen corresponding path program 1 times [2023-11-29 07:01:18,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:01:18,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1233552803] [2023-11-29 07:01:18,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:01:18,639 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:01:18,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:01:18,640 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:01:18,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 07:01:18,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:18,749 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 07:01:18,750 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:01:18,786 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 07:01:18,786 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:01:18,787 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:01:18,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1233552803] [2023-11-29 07:01:18,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1233552803] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:01:18,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:01:18,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 07:01:18,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223543707] [2023-11-29 07:01:18,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:01:18,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 07:01:18,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:01:18,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 07:01:18,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 07:01:18,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 57 [2023-11-29 07:01:18,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 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 07:01:18,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:01:18,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 57 [2023-11-29 07:01:18,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:01:19,132 INFO L124 PetriNetUnfolderBase]: 1014/1840 cut-off events. [2023-11-29 07:01:19,133 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2023-11-29 07:01:19,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3521 conditions, 1840 events. 1014/1840 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 12174 event pairs, 94 based on Foata normal form. 60/1888 useless extension candidates. Maximal degree in co-relation 3510. Up to 1015 conditions per place. [2023-11-29 07:01:19,147 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 37 selfloop transitions, 5 changer transitions 1/64 dead transitions. [2023-11-29 07:01:19,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 64 transitions, 232 flow [2023-11-29 07:01:19,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 07:01:19,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 07:01:19,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2023-11-29 07:01:19,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7236842105263158 [2023-11-29 07:01:19,149 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 165 transitions. [2023-11-29 07:01:19,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 165 transitions. [2023-11-29 07:01:19,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:01:19,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 165 transitions. [2023-11-29 07:01:19,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 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 07:01:19,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 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 07:01:19,152 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 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 07:01:19,152 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 96 flow. Second operand 4 states and 165 transitions. [2023-11-29 07:01:19,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 64 transitions, 232 flow [2023-11-29 07:01:19,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 64 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:01:19,155 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 126 flow [2023-11-29 07:01:19,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-11-29 07:01:19,155 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -7 predicate places. [2023-11-29 07:01:19,156 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 126 flow [2023-11-29 07:01:19,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 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 07:01:19,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:01:19,156 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] [2023-11-29 07:01:19,159 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-29 07:01:19,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:01:19,359 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 07:01:19,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:01:19,360 INFO L85 PathProgramCache]: Analyzing trace with hash 91924256, now seen corresponding path program 1 times [2023-11-29 07:01:19,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:01:19,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1373863227] [2023-11-29 07:01:19,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:01:19,360 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:01:19,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:01:19,361 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:01:19,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 07:01:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:19,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 07:01:19,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:01:19,519 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 07:01:19,519 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:01:19,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:01:19,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1373863227] [2023-11-29 07:01:19,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1373863227] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:01:19,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:01:19,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 07:01:19,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170351032] [2023-11-29 07:01:19,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:01:19,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 07:01:19,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:01:19,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 07:01:19,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 07:01:19,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 57 [2023-11-29 07:01:19,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:01:19,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:01:19,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 57 [2023-11-29 07:01:19,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:01:19,819 INFO L124 PetriNetUnfolderBase]: 688/1266 cut-off events. [2023-11-29 07:01:19,819 INFO L125 PetriNetUnfolderBase]: For 329/329 co-relation queries the response was YES. [2023-11-29 07:01:19,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2809 conditions, 1266 events. 688/1266 cut-off events. For 329/329 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7494 event pairs, 34 based on Foata normal form. 54/1310 useless extension candidates. Maximal degree in co-relation 2796. Up to 553 conditions per place. [2023-11-29 07:01:19,828 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 46 selfloop transitions, 8 changer transitions 1/76 dead transitions. [2023-11-29 07:01:19,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 76 transitions, 317 flow [2023-11-29 07:01:19,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 07:01:19,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 07:01:19,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 207 transitions. [2023-11-29 07:01:19,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263157894736842 [2023-11-29 07:01:19,830 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 207 transitions. [2023-11-29 07:01:19,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 207 transitions. [2023-11-29 07:01:19,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:01:19,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 207 transitions. [2023-11-29 07:01:19,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 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 07:01:19,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 57.0) internal successors, (342), 6 states have internal predecessors, (342), 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 07:01:19,833 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 57.0) internal successors, (342), 6 states have internal predecessors, (342), 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 07:01:19,833 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 126 flow. Second operand 5 states and 207 transitions. [2023-11-29 07:01:19,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 76 transitions, 317 flow [2023-11-29 07:01:19,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 76 transitions, 307 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 07:01:19,836 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 166 flow [2023-11-29 07:01:19,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2023-11-29 07:01:19,837 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2023-11-29 07:01:19,838 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 166 flow [2023-11-29 07:01:19,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:01:19,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:01:19,838 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] [2023-11-29 07:01:19,843 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-29 07:01:20,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:01:20,043 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 07:01:20,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:01:20,044 INFO L85 PathProgramCache]: Analyzing trace with hash 885247398, now seen corresponding path program 1 times [2023-11-29 07:01:20,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:01:20,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1083541759] [2023-11-29 07:01:20,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:01:20,044 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:01:20,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:01:20,045 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:01:20,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 07:01:20,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:20,167 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 07:01:20,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:01:20,229 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 07:01:20,230 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:01:20,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:01:20,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1083541759] [2023-11-29 07:01:20,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1083541759] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:01:20,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:01:20,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 07:01:20,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875700298] [2023-11-29 07:01:20,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:01:20,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:01:20,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:01:20,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:01:20,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:01:20,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 57 [2023-11-29 07:01:20,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 166 flow. Second operand has 6 states, 6 states have (on average 32.5) internal successors, (195), 6 states have internal predecessors, (195), 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 07:01:20,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:01:20,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 57 [2023-11-29 07:01:20,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:01:20,461 INFO L124 PetriNetUnfolderBase]: 369/661 cut-off events. [2023-11-29 07:01:20,461 INFO L125 PetriNetUnfolderBase]: For 574/574 co-relation queries the response was YES. [2023-11-29 07:01:20,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1719 conditions, 661 events. 369/661 cut-off events. For 574/574 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2974 event pairs, 23 based on Foata normal form. 32/683 useless extension candidates. Maximal degree in co-relation 1704. Up to 228 conditions per place. [2023-11-29 07:01:20,465 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 41 selfloop transitions, 11 changer transitions 1/74 dead transitions. [2023-11-29 07:01:20,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 74 transitions, 332 flow [2023-11-29 07:01:20,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 07:01:20,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 07:01:20,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 235 transitions. [2023-11-29 07:01:20,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6871345029239766 [2023-11-29 07:01:20,466 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 235 transitions. [2023-11-29 07:01:20,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 235 transitions. [2023-11-29 07:01:20,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:01:20,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 235 transitions. [2023-11-29 07:01:20,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 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 07:01:20,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 57.0) internal successors, (399), 7 states have internal predecessors, (399), 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 07:01:20,468 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 57.0) internal successors, (399), 7 states have internal predecessors, (399), 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 07:01:20,468 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 166 flow. Second operand 6 states and 235 transitions. [2023-11-29 07:01:20,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 74 transitions, 332 flow [2023-11-29 07:01:20,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 74 transitions, 307 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-29 07:01:20,473 INFO L231 Difference]: Finished difference. Result has 62 places, 49 transitions, 180 flow [2023-11-29 07:01:20,473 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=180, PETRI_PLACES=62, PETRI_TRANSITIONS=49} [2023-11-29 07:01:20,473 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 0 predicate places. [2023-11-29 07:01:20,474 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 49 transitions, 180 flow [2023-11-29 07:01:20,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.5) internal successors, (195), 6 states have internal predecessors, (195), 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 07:01:20,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:01:20,474 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] [2023-11-29 07:01:20,477 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-29 07:01:20,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:01:20,675 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 07:01:20,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:01:20,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1306182994, now seen corresponding path program 1 times [2023-11-29 07:01:20,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:01:20,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1398731885] [2023-11-29 07:01:20,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:01:20,676 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:01:20,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:01:20,677 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:01:20,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 07:01:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:20,825 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 07:01:20,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:01:21,390 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t854~0#1.base_41| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t852~0#1.base_53| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t853~0#1.base_49| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t852~0#1.base_53| (_ bv1 1)))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t852~0#1.base_53|) (_ bv0 1)) (= (_ bv0 1) (select (store .cse0 |v_ULTIMATE.start_main_~#t853~0#1.base_49| (_ bv1 1)) |v_ULTIMATE.start_main_~#t854~0#1.base_41|)) (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_~#t853~0#1.base_49|)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t852~0#1.base_53| (_ bv0 1)) |v_ULTIMATE.start_main_~#t853~0#1.base_49| (_ bv0 1)) |v_ULTIMATE.start_main_~#t854~0#1.base_41| (_ bv0 1)))))) is different from true [2023-11-29 07:01:21,391 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 07:01:21,392 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:01:21,392 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:01:21,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1398731885] [2023-11-29 07:01:21,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1398731885] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:01:21,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:01:21,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 07:01:21,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879110615] [2023-11-29 07:01:21,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:01:21,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:01:21,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:01:21,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:01:21,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2023-11-29 07:01:21,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 57 [2023-11-29 07:01:21,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 49 transitions, 180 flow. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 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 07:01:21,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:01:21,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 57 [2023-11-29 07:01:21,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:01:21,613 INFO L124 PetriNetUnfolderBase]: 194/433 cut-off events. [2023-11-29 07:01:21,613 INFO L125 PetriNetUnfolderBase]: For 121/126 co-relation queries the response was YES. [2023-11-29 07:01:21,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 919 conditions, 433 events. 194/433 cut-off events. For 121/126 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2029 event pairs, 152 based on Foata normal form. 8/402 useless extension candidates. Maximal degree in co-relation 902. Up to 270 conditions per place. [2023-11-29 07:01:21,616 INFO L140 encePairwiseOnDemand]: 49/57 looper letters, 25 selfloop transitions, 7 changer transitions 0/59 dead transitions. [2023-11-29 07:01:21,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 59 transitions, 264 flow [2023-11-29 07:01:21,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 07:01:21,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 07:01:21,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 177 transitions. [2023-11-29 07:01:21,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5175438596491229 [2023-11-29 07:01:21,618 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 177 transitions. [2023-11-29 07:01:21,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 177 transitions. [2023-11-29 07:01:21,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:01:21,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 177 transitions. [2023-11-29 07:01:21,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 29.5) internal successors, (177), 6 states have internal predecessors, (177), 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 07:01:21,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 57.0) internal successors, (399), 7 states have internal predecessors, (399), 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 07:01:21,621 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 57.0) internal successors, (399), 7 states have internal predecessors, (399), 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 07:01:21,621 INFO L175 Difference]: Start difference. First operand has 62 places, 49 transitions, 180 flow. Second operand 6 states and 177 transitions. [2023-11-29 07:01:21,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 59 transitions, 264 flow [2023-11-29 07:01:21,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 59 transitions, 208 flow, removed 10 selfloop flow, removed 8 redundant places. [2023-11-29 07:01:21,623 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 156 flow [2023-11-29 07:01:21,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=156, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2023-11-29 07:01:21,624 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -2 predicate places. [2023-11-29 07:01:21,624 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 156 flow [2023-11-29 07:01:21,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 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 07:01:21,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:01:21,624 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] [2023-11-29 07:01:21,627 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-29 07:01:21,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:01:21,825 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 07:01:21,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:01:21,825 INFO L85 PathProgramCache]: Analyzing trace with hash -92174519, now seen corresponding path program 1 times [2023-11-29 07:01:21,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:01:21,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [879454963] [2023-11-29 07:01:21,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:01:21,826 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:01:21,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:01:21,827 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:01:21,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-29 07:01:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:21,933 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 07:01:21,936 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:01:22,006 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 07:01:22,006 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:01:22,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:01:22,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [879454963] [2023-11-29 07:01:22,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [879454963] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:01:22,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:01:22,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 07:01:22,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746181260] [2023-11-29 07:01:22,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:01:22,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:01:22,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:01:22,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:01:22,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:01:22,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 57 [2023-11-29 07:01:22,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 33.833333333333336) internal successors, (203), 6 states have internal predecessors, (203), 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 07:01:22,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:01:22,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 57 [2023-11-29 07:01:22,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:01:22,330 INFO L124 PetriNetUnfolderBase]: 547/1162 cut-off events. [2023-11-29 07:01:22,330 INFO L125 PetriNetUnfolderBase]: For 346/400 co-relation queries the response was YES. [2023-11-29 07:01:22,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2634 conditions, 1162 events. 547/1162 cut-off events. For 346/400 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 6627 event pairs, 128 based on Foata normal form. 8/1115 useless extension candidates. Maximal degree in co-relation 2621. Up to 412 conditions per place. [2023-11-29 07:01:22,336 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 50 selfloop transitions, 5 changer transitions 0/83 dead transitions. [2023-11-29 07:01:22,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 83 transitions, 370 flow [2023-11-29 07:01:22,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 07:01:22,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 07:01:22,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 236 transitions. [2023-11-29 07:01:22,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6900584795321637 [2023-11-29 07:01:22,338 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 236 transitions. [2023-11-29 07:01:22,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 236 transitions. [2023-11-29 07:01:22,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:01:22,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 236 transitions. [2023-11-29 07:01:22,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 39.333333333333336) internal successors, (236), 6 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 07:01:22,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 57.0) internal successors, (399), 7 states have internal predecessors, (399), 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 07:01:22,341 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 57.0) internal successors, (399), 7 states have internal predecessors, (399), 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 07:01:22,341 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 156 flow. Second operand 6 states and 236 transitions. [2023-11-29 07:01:22,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 83 transitions, 370 flow [2023-11-29 07:01:22,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 83 transitions, 352 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 07:01:22,343 INFO L231 Difference]: Finished difference. Result has 65 places, 56 transitions, 185 flow [2023-11-29 07:01:22,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=185, PETRI_PLACES=65, PETRI_TRANSITIONS=56} [2023-11-29 07:01:22,344 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 3 predicate places. [2023-11-29 07:01:22,344 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 56 transitions, 185 flow [2023-11-29 07:01:22,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.833333333333336) internal successors, (203), 6 states have internal predecessors, (203), 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 07:01:22,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:01:22,345 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] [2023-11-29 07:01:22,348 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-11-29 07:01:22,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:01:22,548 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 07:01:22,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:01:22,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1815677013, now seen corresponding path program 2 times [2023-11-29 07:01:22,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:01:22,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [354114940] [2023-11-29 07:01:22,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 07:01:22,549 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:01:22,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:01:22,550 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:01:22,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 07:01:22,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 07:01:22,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 07:01:22,688 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 07:01:22,690 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:01:22,770 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 07:01:22,770 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:01:22,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:01:22,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [354114940] [2023-11-29 07:01:22,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [354114940] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:01:22,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:01:22,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 07:01:22,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641171973] [2023-11-29 07:01:22,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:01:22,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:01:22,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:01:22,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:01:22,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:01:22,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 57 [2023-11-29 07:01:22,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 185 flow. Second operand has 6 states, 6 states have (on average 33.833333333333336) internal successors, (203), 6 states have internal predecessors, (203), 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 07:01:22,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:01:22,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 57 [2023-11-29 07:01:22,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:01:23,163 INFO L124 PetriNetUnfolderBase]: 842/1749 cut-off events. [2023-11-29 07:01:23,163 INFO L125 PetriNetUnfolderBase]: For 683/769 co-relation queries the response was YES. [2023-11-29 07:01:23,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4269 conditions, 1749 events. 842/1749 cut-off events. For 683/769 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10943 event pairs, 239 based on Foata normal form. 8/1664 useless extension candidates. Maximal degree in co-relation 4253. Up to 708 conditions per place. [2023-11-29 07:01:23,175 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 53 selfloop transitions, 8 changer transitions 0/90 dead transitions. [2023-11-29 07:01:23,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 90 transitions, 429 flow [2023-11-29 07:01:23,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 07:01:23,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 07:01:23,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 236 transitions. [2023-11-29 07:01:23,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6900584795321637 [2023-11-29 07:01:23,177 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 236 transitions. [2023-11-29 07:01:23,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 236 transitions. [2023-11-29 07:01:23,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:01:23,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 236 transitions. [2023-11-29 07:01:23,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 39.333333333333336) internal successors, (236), 6 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 07:01:23,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 57.0) internal successors, (399), 7 states have internal predecessors, (399), 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 07:01:23,180 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 57.0) internal successors, (399), 7 states have internal predecessors, (399), 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 07:01:23,180 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 185 flow. Second operand 6 states and 236 transitions. [2023-11-29 07:01:23,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 90 transitions, 429 flow [2023-11-29 07:01:23,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 90 transitions, 428 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 07:01:23,185 INFO L231 Difference]: Finished difference. Result has 73 places, 63 transitions, 267 flow [2023-11-29 07:01:23,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=267, PETRI_PLACES=73, PETRI_TRANSITIONS=63} [2023-11-29 07:01:23,186 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 11 predicate places. [2023-11-29 07:01:23,186 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 63 transitions, 267 flow [2023-11-29 07:01:23,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.833333333333336) internal successors, (203), 6 states have internal predecessors, (203), 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 07:01:23,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:01:23,186 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] [2023-11-29 07:01:23,189 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-29 07:01:23,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:01:23,387 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 07:01:23,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:01:23,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1904888027, now seen corresponding path program 3 times [2023-11-29 07:01:23,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:01:23,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [787753224] [2023-11-29 07:01:23,388 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 07:01:23,388 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:01:23,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:01:23,389 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:01:23,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-29 07:01:23,505 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-29 07:01:23,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 07:01:23,510 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 07:01:23,513 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:01:23,750 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 07:01:23,751 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:01:23,751 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:01:23,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [787753224] [2023-11-29 07:01:23,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [787753224] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:01:23,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:01:23,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 07:01:23,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451646088] [2023-11-29 07:01:23,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:01:23,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 07:01:23,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:01:23,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 07:01:23,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 07:01:23,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 57 [2023-11-29 07:01:23,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 63 transitions, 267 flow. Second operand has 8 states, 8 states have (on average 34.875) internal successors, (279), 8 states have internal predecessors, (279), 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 07:01:23,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:01:23,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 57 [2023-11-29 07:01:23,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:01:24,212 INFO L124 PetriNetUnfolderBase]: 1145/2414 cut-off events. [2023-11-29 07:01:24,212 INFO L125 PetriNetUnfolderBase]: For 1742/1754 co-relation queries the response was YES. [2023-11-29 07:01:24,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6397 conditions, 2414 events. 1145/2414 cut-off events. For 1742/1754 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 16129 event pairs, 264 based on Foata normal form. 8/2320 useless extension candidates. Maximal degree in co-relation 6377. Up to 1145 conditions per place. [2023-11-29 07:01:24,224 INFO L140 encePairwiseOnDemand]: 48/57 looper letters, 52 selfloop transitions, 18 changer transitions 0/102 dead transitions. [2023-11-29 07:01:24,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 102 transitions, 605 flow [2023-11-29 07:01:24,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 07:01:24,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 07:01:24,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 344 transitions. [2023-11-29 07:01:24,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6705653021442495 [2023-11-29 07:01:24,226 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 344 transitions. [2023-11-29 07:01:24,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 344 transitions. [2023-11-29 07:01:24,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:01:24,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 344 transitions. [2023-11-29 07:01:24,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 38.22222222222222) internal successors, (344), 9 states have internal predecessors, (344), 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 07:01:24,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 57.0) internal successors, (570), 10 states have internal predecessors, (570), 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 07:01:24,229 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 57.0) internal successors, (570), 10 states have internal predecessors, (570), 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 07:01:24,229 INFO L175 Difference]: Start difference. First operand has 73 places, 63 transitions, 267 flow. Second operand 9 states and 344 transitions. [2023-11-29 07:01:24,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 102 transitions, 605 flow [2023-11-29 07:01:24,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 102 transitions, 604 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 07:01:24,240 INFO L231 Difference]: Finished difference. Result has 84 places, 77 transitions, 466 flow [2023-11-29 07:01:24,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=466, PETRI_PLACES=84, PETRI_TRANSITIONS=77} [2023-11-29 07:01:24,241 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 22 predicate places. [2023-11-29 07:01:24,241 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 77 transitions, 466 flow [2023-11-29 07:01:24,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.875) internal successors, (279), 8 states have internal predecessors, (279), 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 07:01:24,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:01:24,241 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] [2023-11-29 07:01:24,245 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-29 07:01:24,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:01:24,443 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 07:01:24,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:01:24,443 INFO L85 PathProgramCache]: Analyzing trace with hash 475290189, now seen corresponding path program 4 times [2023-11-29 07:01:24,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:01:24,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [192307000] [2023-11-29 07:01:24,444 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 07:01:24,444 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:01:24,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:01:24,445 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:01:24,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-29 07:01:24,563 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 07:01:24,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 07:01:24,563 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 07:01:24,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 07:01:24,708 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-29 07:01:24,709 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 07:01:24,709 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-29 07:01:24,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-29 07:01:24,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-29 07:01:24,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-29 07:01:24,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-29 07:01:24,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-29 07:01:24,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-29 07:01:24,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-29 07:01:24,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-29 07:01:24,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-29 07:01:24,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-29 07:01:24,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-29 07:01:24,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-29 07:01:24,717 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-11-29 07:01:24,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:01:24,919 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:01:24,925 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 07:01:24,925 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 07:01:24,983 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 07:01:24,984 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 07:01:24,986 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 07:01:25,000 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 07:01:25,002 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 07:01:25,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 07:01:25 BasicIcfg [2023-11-29 07:01:25,014 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 07:01:25,014 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 07:01:25,014 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 07:01:25,014 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 07:01:25,015 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:01:14" (3/4) ... [2023-11-29 07:01:25,016 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 07:01:25,017 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 07:01:25,018 INFO L158 Benchmark]: Toolchain (without parser) took 11989.96ms. Allocated memory was 77.6MB in the beginning and 213.9MB in the end (delta: 136.3MB). Free memory was 52.6MB in the beginning and 163.2MB in the end (delta: -110.6MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2023-11-29 07:01:25,018 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 77.6MB. Free memory is still 54.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 07:01:25,019 INFO L158 Benchmark]: CACSL2BoogieTranslator took 475.16ms. Allocated memory was 77.6MB in the beginning and 121.6MB in the end (delta: 44.0MB). Free memory was 52.4MB in the beginning and 94.2MB in the end (delta: -41.8MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2023-11-29 07:01:25,019 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.35ms. Allocated memory is still 121.6MB. Free memory was 94.2MB in the beginning and 91.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 07:01:25,020 INFO L158 Benchmark]: Boogie Preprocessor took 55.08ms. Allocated memory is still 121.6MB. Free memory was 91.5MB in the beginning and 87.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 07:01:25,020 INFO L158 Benchmark]: RCFGBuilder took 705.86ms. Allocated memory is still 121.6MB. Free memory was 87.9MB in the beginning and 64.4MB in the end (delta: 23.5MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. [2023-11-29 07:01:25,020 INFO L158 Benchmark]: TraceAbstraction took 10692.28ms. Allocated memory was 121.6MB in the beginning and 213.9MB in the end (delta: 92.3MB). Free memory was 63.7MB in the beginning and 163.2MB in the end (delta: -99.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 07:01:25,021 INFO L158 Benchmark]: Witness Printer took 3.25ms. Allocated memory is still 213.9MB. Free memory is still 163.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 07:01:25,023 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 77.6MB. Free memory is still 54.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 475.16ms. Allocated memory was 77.6MB in the beginning and 121.6MB in the end (delta: 44.0MB). Free memory was 52.4MB in the beginning and 94.2MB in the end (delta: -41.8MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.35ms. Allocated memory is still 121.6MB. Free memory was 94.2MB in the beginning and 91.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.08ms. Allocated memory is still 121.6MB. Free memory was 91.5MB in the beginning and 87.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 705.86ms. Allocated memory is still 121.6MB. Free memory was 87.9MB in the beginning and 64.4MB in the end (delta: 23.5MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. * TraceAbstraction took 10692.28ms. Allocated memory was 121.6MB in the beginning and 213.9MB in the end (delta: 92.3MB). Free memory was 63.7MB in the beginning and 163.2MB in the end (delta: -99.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.25ms. Allocated memory is still 213.9MB. Free memory is still 163.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L723] 0 int b = 0; [L724] 0 _Bool main$tmp_guard0; [L725] 0 _Bool main$tmp_guard1; [L727] 0 int x = 0; [L729] 0 int y = 0; [L731] 0 int z = 0; [L732] 0 _Bool z$flush_delayed; [L733] 0 int z$mem_tmp; [L734] 0 _Bool z$r_buff0_thd0; [L735] 0 _Bool z$r_buff0_thd1; [L736] 0 _Bool z$r_buff0_thd2; [L737] 0 _Bool z$r_buff0_thd3; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$read_delayed; [L743] 0 int *z$read_delayed_var; [L744] 0 int z$w_buff0; [L745] 0 _Bool z$w_buff0_used; [L746] 0 int z$w_buff1; [L747] 0 _Bool z$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L845] 0 pthread_t t852; [L846] FCALL, FORK 0 pthread_create(&t852, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t852={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L847] 0 pthread_t t853; [L848] FCALL, FORK 0 pthread_create(&t853, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t852={7:0}, t853={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L849] 0 pthread_t t854; [L850] FCALL, FORK 0 pthread_create(&t854, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t852={7:0}, t853={5:0}, t854={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L802] 3 z$w_buff1 = z$w_buff0 [L803] 3 z$w_buff0 = 1 [L804] 3 z$w_buff1_used = z$w_buff0_used [L805] 3 z$w_buff0_used = (_Bool)1 [L806] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L806] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L814] 3 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L817] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L820] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L768] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L778] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L779] 2 z$flush_delayed = weak$$choice2 [L780] 2 z$mem_tmp = z [L781] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L782] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L783] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L784] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L785] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L787] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] 2 __unbuffered_p1_EBX = z [L789] 2 z = z$flush_delayed ? z$mem_tmp : z [L790] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L823] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L824] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L825] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L826] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L827] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L830] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L852] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t852={7:0}, t853={5:0}, t854={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L854] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L854] RET 0 assume_abort_if_not(main$tmp_guard0) [L856] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t852={7:0}, t853={5:0}, t854={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L863] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t852={7:0}, t853={5:0}, t854={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L865] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix032.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 843]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 85 locations, 13 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: 10.5s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 483 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 387 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 52 IncrementalHoareTripleChecker+Unchecked, 53 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1276 IncrementalHoareTripleChecker+Invalid, 1351 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 29 mSDtfsCounter, 1276 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 262 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=466occurred in iteration=14, InterpolantAutomatonStates: 63, 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.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 297 NumberOfCodeBlocks, 297 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 246 ConstructedInterpolants, 1 QuantifiedInterpolants, 1775 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1674 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 07:01:25,040 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec990e9d-2518-4374-aa81-4d9cebda7224/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample