./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix031.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme --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 c5191c614040da54c6fe77b0fb4d91d943009a345a9252a69568f58113a0aaaf --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 10:40:50,697 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 10:40:50,829 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-26 10:40:50,836 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 10:40:50,837 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 10:40:50,870 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 10:40:50,871 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 10:40:50,872 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 10:40:50,873 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 10:40:50,873 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 10:40:50,874 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 10:40:50,875 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 10:40:50,876 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 10:40:50,877 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 10:40:50,877 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 10:40:50,878 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 10:40:50,879 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 10:40:50,880 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 10:40:50,880 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 10:40:50,881 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 10:40:50,882 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-26 10:40:50,883 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-26 10:40:50,884 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-26 10:40:50,884 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 10:40:50,885 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 10:40:50,886 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 10:40:50,886 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 10:40:50,887 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 10:40:50,888 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 10:40:50,888 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 10:40:50,889 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 10:40:50,889 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 10:40:50,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:40:50,891 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 10:40:50,891 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 10:40:50,892 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 10:40:50,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 10:40:50,893 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 10:40:50,893 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 10:40:50,894 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 10:40:50,894 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 10:40:50,895 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_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme 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 -> c5191c614040da54c6fe77b0fb4d91d943009a345a9252a69568f58113a0aaaf [2023-11-26 10:40:51,176 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 10:40:51,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 10:40:51,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 10:40:51,218 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 10:40:51,218 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 10:40:51,220 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-wmm/mix031.oepc.i [2023-11-26 10:40:54,909 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 10:40:55,374 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 10:40:55,375 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/sv-benchmarks/c/pthread-wmm/mix031.oepc.i [2023-11-26 10:40:55,408 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/data/632253009/774c0e1874994ab3977af223ea4ebfac/FLAG03a57bb6e [2023-11-26 10:40:55,423 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/data/632253009/774c0e1874994ab3977af223ea4ebfac [2023-11-26 10:40:55,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 10:40:55,428 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 10:40:55,429 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 10:40:55,430 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 10:40:55,441 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 10:40:55,442 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:40:55" (1/1) ... [2023-11-26 10:40:55,443 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3995e7f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:40:55, skipping insertion in model container [2023-11-26 10:40:55,444 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:40:55" (1/1) ... [2023-11-26 10:40:55,508 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 10:40:55,939 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:40:55,960 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 10:40:56,078 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:40:56,141 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 10:40:56,141 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 10:40:56,151 INFO L206 MainTranslator]: Completed translation [2023-11-26 10:40:56,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:40:56 WrapperNode [2023-11-26 10:40:56,153 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 10:40:56,154 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 10:40:56,155 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 10:40:56,156 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 10:40:56,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:40:56" (1/1) ... [2023-11-26 10:40:56,203 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:40:56" (1/1) ... [2023-11-26 10:40:56,259 INFO L138 Inliner]: procedures = 175, calls = 50, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 128 [2023-11-26 10:40:56,261 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 10:40:56,262 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 10:40:56,262 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 10:40:56,262 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 10:40:56,274 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:40:56" (1/1) ... [2023-11-26 10:40:56,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:40:56" (1/1) ... [2023-11-26 10:40:56,277 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:40:56" (1/1) ... [2023-11-26 10:40:56,296 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2023-11-26 10:40:56,296 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:40:56" (1/1) ... [2023-11-26 10:40:56,297 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:40:56" (1/1) ... [2023-11-26 10:40:56,307 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:40:56" (1/1) ... [2023-11-26 10:40:56,309 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:40:56" (1/1) ... [2023-11-26 10:40:56,313 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:40:56" (1/1) ... [2023-11-26 10:40:56,315 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:40:56" (1/1) ... [2023-11-26 10:40:56,320 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 10:40:56,321 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 10:40:56,321 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 10:40:56,322 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 10:40:56,323 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:40:56" (1/1) ... [2023-11-26 10:40:56,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:40:56,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:40:56,394 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 10:40:56,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 10:40:56,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 10:40:56,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 10:40:56,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 10:40:56,442 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 10:40:56,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 10:40:56,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 10:40:56,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 10:40:56,443 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-26 10:40:56,444 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-26 10:40:56,444 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-26 10:40:56,444 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-26 10:40:56,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 10:40:56,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 10:40:56,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-26 10:40:56,446 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 10:40:56,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 10:40:56,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 10:40:56,449 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 10:40:56,614 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 10:40:56,617 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 10:40:57,064 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 10:40:57,275 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 10:40:57,275 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 10:40:57,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:40:57 BoogieIcfgContainer [2023-11-26 10:40:57,276 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 10:40:57,279 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 10:40:57,279 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 10:40:57,283 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 10:40:57,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 10:40:55" (1/3) ... [2023-11-26 10:40:57,284 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7115a40b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:40:57, skipping insertion in model container [2023-11-26 10:40:57,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:40:56" (2/3) ... [2023-11-26 10:40:57,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7115a40b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:40:57, skipping insertion in model container [2023-11-26 10:40:57,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:40:57" (3/3) ... [2023-11-26 10:40:57,287 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031.oepc.i [2023-11-26 10:40:57,328 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 10:40:57,329 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-26 10:40:57,329 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 10:40:57,385 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 10:40:57,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 45 transitions, 98 flow [2023-11-26 10:40:57,487 INFO L124 PetriNetUnfolderBase]: 2/43 cut-off events. [2023-11-26 10:40:57,488 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:40:57,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 43 events. 2/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 81 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 40. Up to 2 conditions per place. [2023-11-26 10:40:57,494 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 45 transitions, 98 flow [2023-11-26 10:40:57,499 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 43 transitions, 92 flow [2023-11-26 10:40:57,517 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:40:57,524 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;@2ab2e98a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:40:57,525 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-26 10:40:57,528 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 10:40:57,529 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-26 10:40:57,529 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:40:57,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:40:57,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 10:40:57,531 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:40:57,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:40:57,537 INFO L85 PathProgramCache]: Analyzing trace with hash 11997, now seen corresponding path program 1 times [2023-11-26 10:40:57,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:40:57,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317660399] [2023-11-26 10:40:57,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:40:57,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:40:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:40:57,903 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-26 10:40:57,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:40:57,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317660399] [2023-11-26 10:40:57,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317660399] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:40:57,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:40:57,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 10:40:57,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027642488] [2023-11-26 10:40:57,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:40:57,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:40:57,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:40:57,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:40:57,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:40:57,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 45 [2023-11-26 10:40:57,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:40:57,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:40:57,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 45 [2023-11-26 10:40:57,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:40:58,308 INFO L124 PetriNetUnfolderBase]: 237/565 cut-off events. [2023-11-26 10:40:58,308 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-26 10:40:58,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 990 conditions, 565 events. 237/565 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3329 event pairs, 175 based on Foata normal form. 40/543 useless extension candidates. Maximal degree in co-relation 977. Up to 307 conditions per place. [2023-11-26 10:40:58,325 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 24 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2023-11-26 10:40:58,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 150 flow [2023-11-26 10:40:58,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:40:58,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:40:58,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2023-11-26 10:40:58,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2023-11-26 10:40:58,346 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 95 transitions. [2023-11-26 10:40:58,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 95 transitions. [2023-11-26 10:40:58,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:40:58,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 95 transitions. [2023-11-26 10:40:58,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:40:58,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:40:58,366 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:40:58,369 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 92 flow. Second operand 3 states and 95 transitions. [2023-11-26 10:40:58,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 150 flow [2023-11-26 10:40:58,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 46 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:40:58,388 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 86 flow [2023-11-26 10:40:58,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2023-11-26 10:40:58,398 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2023-11-26 10:40:58,398 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 86 flow [2023-11-26 10:40:58,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:40:58,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:40:58,399 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 10:40:58,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 10:40:58,399 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:40:58,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:40:58,400 INFO L85 PathProgramCache]: Analyzing trace with hash 11998, now seen corresponding path program 1 times [2023-11-26 10:40:58,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:40:58,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569860371] [2023-11-26 10:40:58,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:40:58,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:40:58,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:40:58,600 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-26 10:40:58,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:40:58,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569860371] [2023-11-26 10:40:58,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569860371] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:40:58,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:40:58,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 10:40:58,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204761410] [2023-11-26 10:40:58,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:40:58,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:40:58,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:40:58,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:40:58,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:40:58,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 45 [2023-11-26 10:40:58,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:40:58,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:40:58,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 45 [2023-11-26 10:40:58,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:40:58,881 INFO L124 PetriNetUnfolderBase]: 237/564 cut-off events. [2023-11-26 10:40:58,881 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-26 10:40:58,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1008 conditions, 564 events. 237/564 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3320 event pairs, 175 based on Foata normal form. 1/503 useless extension candidates. Maximal degree in co-relation 997. Up to 306 conditions per place. [2023-11-26 10:40:58,891 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 23 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-11-26 10:40:58,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 148 flow [2023-11-26 10:40:58,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:40:58,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:40:58,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2023-11-26 10:40:58,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2023-11-26 10:40:58,900 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 95 transitions. [2023-11-26 10:40:58,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 95 transitions. [2023-11-26 10:40:58,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:40:58,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 95 transitions. [2023-11-26 10:40:58,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:40:58,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:40:58,911 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:40:58,911 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 86 flow. Second operand 3 states and 95 transitions. [2023-11-26 10:40:58,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 148 flow [2023-11-26 10:40:58,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 45 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:40:58,916 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 84 flow [2023-11-26 10:40:58,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2023-11-26 10:40:58,918 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2023-11-26 10:40:58,918 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 84 flow [2023-11-26 10:40:58,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:40:58,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:40:58,919 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 10:40:58,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 10:40:58,920 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:40:58,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:40:58,921 INFO L85 PathProgramCache]: Analyzing trace with hash 357736692, now seen corresponding path program 1 times [2023-11-26 10:40:58,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:40:58,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023340264] [2023-11-26 10:40:58,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:40:58,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:40:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:40:59,122 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-26 10:40:59,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:40:59,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023340264] [2023-11-26 10:40:59,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023340264] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:40:59,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:40:59,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 10:40:59,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392236170] [2023-11-26 10:40:59,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:40:59,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:40:59,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:40:59,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:40:59,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:40:59,127 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 45 [2023-11-26 10:40:59,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:40:59,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:40:59,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 45 [2023-11-26 10:40:59,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:40:59,284 INFO L124 PetriNetUnfolderBase]: 183/415 cut-off events. [2023-11-26 10:40:59,285 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-26 10:40:59,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 765 conditions, 415 events. 183/415 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2150 event pairs, 69 based on Foata normal form. 0/409 useless extension candidates. Maximal degree in co-relation 754. Up to 265 conditions per place. [2023-11-26 10:40:59,289 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 25 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2023-11-26 10:40:59,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 49 transitions, 168 flow [2023-11-26 10:40:59,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:40:59,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:40:59,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2023-11-26 10:40:59,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7555555555555555 [2023-11-26 10:40:59,296 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 102 transitions. [2023-11-26 10:40:59,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 102 transitions. [2023-11-26 10:40:59,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:40:59,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 102 transitions. [2023-11-26 10:40:59,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-26 10:40:59,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:40:59,301 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:40:59,301 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 84 flow. Second operand 3 states and 102 transitions. [2023-11-26 10:40:59,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 49 transitions, 168 flow [2023-11-26 10:40:59,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 49 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:40:59,305 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 80 flow [2023-11-26 10:40:59,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2023-11-26 10:40:59,307 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2023-11-26 10:40:59,308 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 80 flow [2023-11-26 10:40:59,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:40:59,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:40:59,308 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 10:40:59,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 10:40:59,311 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:40:59,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:40:59,312 INFO L85 PathProgramCache]: Analyzing trace with hash 357736433, now seen corresponding path program 1 times [2023-11-26 10:40:59,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:40:59,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892671385] [2023-11-26 10:40:59,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:40:59,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:40:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:40:59,430 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-26 10:40:59,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:40:59,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892671385] [2023-11-26 10:40:59,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892671385] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:40:59,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:40:59,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:40:59,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997614399] [2023-11-26 10:40:59,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:40:59,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:40:59,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:40:59,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:40:59,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:40:59,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 45 [2023-11-26 10:40:59,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:40:59,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:40:59,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 45 [2023-11-26 10:40:59,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:40:59,640 INFO L124 PetriNetUnfolderBase]: 162/405 cut-off events. [2023-11-26 10:40:59,641 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-11-26 10:40:59,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 737 conditions, 405 events. 162/405 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2242 event pairs, 72 based on Foata normal form. 0/391 useless extension candidates. Maximal degree in co-relation 726. Up to 242 conditions per place. [2023-11-26 10:40:59,646 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 21 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-11-26 10:40:59,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 41 transitions, 138 flow [2023-11-26 10:40:59,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:40:59,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:40:59,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2023-11-26 10:40:59,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-26 10:40:59,649 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 90 transitions. [2023-11-26 10:40:59,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 90 transitions. [2023-11-26 10:40:59,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:40:59,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 90 transitions. [2023-11-26 10:40:59,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:40:59,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:40:59,654 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:40:59,654 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 80 flow. Second operand 3 states and 90 transitions. [2023-11-26 10:40:59,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 41 transitions, 138 flow [2023-11-26 10:40:59,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 41 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:40:59,658 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 78 flow [2023-11-26 10:40:59,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2023-11-26 10:40:59,661 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -6 predicate places. [2023-11-26 10:40:59,661 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 78 flow [2023-11-26 10:40:59,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:40:59,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:40:59,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 10:40:59,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 10:40:59,665 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:40:59,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:40:59,666 INFO L85 PathProgramCache]: Analyzing trace with hash 357736434, now seen corresponding path program 1 times [2023-11-26 10:40:59,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:40:59,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051477310] [2023-11-26 10:40:59,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:40:59,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:40:59,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:40:59,791 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-26 10:40:59,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:40:59,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051477310] [2023-11-26 10:40:59,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051477310] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:40:59,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:40:59,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:40:59,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283303649] [2023-11-26 10:40:59,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:40:59,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:40:59,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:40:59,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:40:59,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:40:59,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 45 [2023-11-26 10:40:59,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:40:59,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:40:59,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 45 [2023-11-26 10:40:59,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:40:59,964 INFO L124 PetriNetUnfolderBase]: 159/398 cut-off events. [2023-11-26 10:40:59,970 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-11-26 10:40:59,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 711 conditions, 398 events. 159/398 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2180 event pairs, 72 based on Foata normal form. 4/389 useless extension candidates. Maximal degree in co-relation 701. Up to 235 conditions per place. [2023-11-26 10:40:59,977 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 20 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2023-11-26 10:40:59,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 40 transitions, 132 flow [2023-11-26 10:40:59,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:40:59,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:40:59,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2023-11-26 10:40:59,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6814814814814815 [2023-11-26 10:40:59,980 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 92 transitions. [2023-11-26 10:40:59,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 92 transitions. [2023-11-26 10:40:59,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:40:59,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 92 transitions. [2023-11-26 10:40:59,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:40:59,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:40:59,983 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:40:59,983 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 78 flow. Second operand 3 states and 92 transitions. [2023-11-26 10:40:59,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 40 transitions, 132 flow [2023-11-26 10:40:59,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 40 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:40:59,985 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 76 flow [2023-11-26 10:40:59,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2023-11-26 10:40:59,989 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -7 predicate places. [2023-11-26 10:40:59,989 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 76 flow [2023-11-26 10:40:59,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:40:59,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:40:59,990 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:40:59,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 10:40:59,991 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:40:59,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:40:59,997 INFO L85 PathProgramCache]: Analyzing trace with hash 803024821, now seen corresponding path program 1 times [2023-11-26 10:40:59,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:40:59,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290908851] [2023-11-26 10:40:59,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:40:59,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:00,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-26 10:41:00,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:00,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290908851] [2023-11-26 10:41:00,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290908851] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:00,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:00,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:41:00,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343533765] [2023-11-26 10:41:00,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:00,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:41:00,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:00,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:41:00,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:41:00,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 45 [2023-11-26 10:41:00,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 76 flow. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:00,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:00,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 45 [2023-11-26 10:41:00,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:00,807 INFO L124 PetriNetUnfolderBase]: 204/458 cut-off events. [2023-11-26 10:41:00,808 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-11-26 10:41:00,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 849 conditions, 458 events. 204/458 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2470 event pairs, 140 based on Foata normal form. 20/465 useless extension candidates. Maximal degree in co-relation 838. Up to 297 conditions per place. [2023-11-26 10:41:00,813 INFO L140 encePairwiseOnDemand]: 41/45 looper letters, 18 selfloop transitions, 2 changer transitions 8/43 dead transitions. [2023-11-26 10:41:00,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 150 flow [2023-11-26 10:41:00,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:41:00,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 10:41:00,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2023-11-26 10:41:00,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5955555555555555 [2023-11-26 10:41:00,816 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 134 transitions. [2023-11-26 10:41:00,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 134 transitions. [2023-11-26 10:41:00,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:00,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 134 transitions. [2023-11-26 10:41:00,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:00,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 45.0) internal successors, (270), 6 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:00,821 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 45.0) internal successors, (270), 6 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:00,821 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 76 flow. Second operand 5 states and 134 transitions. [2023-11-26 10:41:00,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 150 flow [2023-11-26 10:41:00,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:41:00,825 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2023-11-26 10:41:00,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-11-26 10:41:00,829 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -6 predicate places. [2023-11-26 10:41:00,830 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2023-11-26 10:41:00,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:00,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:00,831 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:41:00,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 10:41:00,831 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:41:00,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:00,832 INFO L85 PathProgramCache]: Analyzing trace with hash 803026278, now seen corresponding path program 1 times [2023-11-26 10:41:00,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:00,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877809698] [2023-11-26 10:41:00,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:00,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:01,100 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-26 10:41:01,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:01,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877809698] [2023-11-26 10:41:01,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877809698] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:01,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:01,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 10:41:01,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736225700] [2023-11-26 10:41:01,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:01,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:41:01,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:01,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:41:01,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:41:01,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 45 [2023-11-26 10:41:01,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:01,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:01,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 45 [2023-11-26 10:41:01,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:01,329 INFO L124 PetriNetUnfolderBase]: 198/448 cut-off events. [2023-11-26 10:41:01,329 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-26 10:41:01,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 833 conditions, 448 events. 198/448 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2201 event pairs, 38 based on Foata normal form. 25/461 useless extension candidates. Maximal degree in co-relation 822. Up to 191 conditions per place. [2023-11-26 10:41:01,334 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 31 selfloop transitions, 4 changer transitions 1/50 dead transitions. [2023-11-26 10:41:01,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 50 transitions, 184 flow [2023-11-26 10:41:01,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:41:01,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 10:41:01,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2023-11-26 10:41:01,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6777777777777778 [2023-11-26 10:41:01,337 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 122 transitions. [2023-11-26 10:41:01,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 122 transitions. [2023-11-26 10:41:01,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:01,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 122 transitions. [2023-11-26 10:41:01,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:01,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:01,346 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:01,347 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 4 states and 122 transitions. [2023-11-26 10:41:01,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 50 transitions, 184 flow [2023-11-26 10:41:01,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:41:01,350 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 95 flow [2023-11-26 10:41:01,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=95, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2023-11-26 10:41:01,352 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2023-11-26 10:41:01,352 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 95 flow [2023-11-26 10:41:01,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:01,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:01,355 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-26 10:41:01,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 10:41:01,355 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:41:01,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:01,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1536552410, now seen corresponding path program 1 times [2023-11-26 10:41:01,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:01,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266090487] [2023-11-26 10:41:01,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:01,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:01,685 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-26 10:41:01,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:01,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266090487] [2023-11-26 10:41:01,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266090487] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:01,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:01,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:41:01,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572661519] [2023-11-26 10:41:01,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:01,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:41:01,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:01,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:41:01,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:41:01,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 45 [2023-11-26 10:41:01,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:01,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:01,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 45 [2023-11-26 10:41:01,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:01,875 INFO L124 PetriNetUnfolderBase]: 102/235 cut-off events. [2023-11-26 10:41:01,876 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2023-11-26 10:41:01,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 235 events. 102/235 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 801 event pairs, 26 based on Foata normal form. 16/242 useless extension candidates. Maximal degree in co-relation 524. Up to 86 conditions per place. [2023-11-26 10:41:01,878 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 26 selfloop transitions, 6 changer transitions 1/47 dead transitions. [2023-11-26 10:41:01,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 47 transitions, 193 flow [2023-11-26 10:41:01,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:41:01,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 10:41:01,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 140 transitions. [2023-11-26 10:41:01,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6222222222222222 [2023-11-26 10:41:01,881 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 140 transitions. [2023-11-26 10:41:01,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 140 transitions. [2023-11-26 10:41:01,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:01,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 140 transitions. [2023-11-26 10:41:01,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:01,883 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 45.0) internal successors, (270), 6 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:01,884 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 45.0) internal successors, (270), 6 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:01,884 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 95 flow. Second operand 5 states and 140 transitions. [2023-11-26 10:41:01,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 47 transitions, 193 flow [2023-11-26 10:41:01,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 47 transitions, 184 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-26 10:41:01,889 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 111 flow [2023-11-26 10:41:01,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2023-11-26 10:41:01,892 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2023-11-26 10:41:01,893 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 111 flow [2023-11-26 10:41:01,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:01,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:01,893 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-26 10:41:01,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 10:41:01,896 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:41:01,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:01,896 INFO L85 PathProgramCache]: Analyzing trace with hash -508072137, now seen corresponding path program 1 times [2023-11-26 10:41:01,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:01,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981566885] [2023-11-26 10:41:01,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:01,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:02,780 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-26 10:41:02,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:02,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981566885] [2023-11-26 10:41:02,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981566885] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:02,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:02,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 10:41:02,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393414786] [2023-11-26 10:41:02,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:02,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 10:41:02,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:02,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 10:41:02,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:41:02,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 45 [2023-11-26 10:41:02,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 111 flow. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:02,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:02,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 45 [2023-11-26 10:41:02,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:03,185 INFO L124 PetriNetUnfolderBase]: 172/400 cut-off events. [2023-11-26 10:41:03,186 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-26 10:41:03,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 914 conditions, 400 events. 172/400 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1725 event pairs, 45 based on Foata normal form. 4/393 useless extension candidates. Maximal degree in co-relation 899. Up to 135 conditions per place. [2023-11-26 10:41:03,189 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 31 selfloop transitions, 11 changer transitions 17/74 dead transitions. [2023-11-26 10:41:03,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 74 transitions, 330 flow [2023-11-26 10:41:03,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 10:41:03,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-26 10:41:03,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 240 transitions. [2023-11-26 10:41:03,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2023-11-26 10:41:03,192 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 240 transitions. [2023-11-26 10:41:03,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 240 transitions. [2023-11-26 10:41:03,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:03,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 240 transitions. [2023-11-26 10:41:03,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 26.666666666666668) internal successors, (240), 9 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:03,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 45.0) internal successors, (450), 10 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:03,195 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 45.0) internal successors, (450), 10 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:03,195 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 111 flow. Second operand 9 states and 240 transitions. [2023-11-26 10:41:03,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 74 transitions, 330 flow [2023-11-26 10:41:03,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 74 transitions, 290 flow, removed 11 selfloop flow, removed 6 redundant places. [2023-11-26 10:41:03,200 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 158 flow [2023-11-26 10:41:03,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=158, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2023-11-26 10:41:03,201 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 7 predicate places. [2023-11-26 10:41:03,201 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 158 flow [2023-11-26 10:41:03,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:03,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:03,202 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-26 10:41:03,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 10:41:03,202 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:41:03,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:03,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1448725665, now seen corresponding path program 2 times [2023-11-26 10:41:03,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:03,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777148341] [2023-11-26 10:41:03,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:03,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:03,528 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-26 10:41:03,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:03,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777148341] [2023-11-26 10:41:03,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777148341] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:03,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:03,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 10:41:03,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990743774] [2023-11-26 10:41:03,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:03,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:41:03,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:03,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:41:03,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:41:03,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 45 [2023-11-26 10:41:03,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 158 flow. Second operand has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:03,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:03,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 45 [2023-11-26 10:41:03,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:03,787 INFO L124 PetriNetUnfolderBase]: 170/434 cut-off events. [2023-11-26 10:41:03,788 INFO L125 PetriNetUnfolderBase]: For 108/110 co-relation queries the response was YES. [2023-11-26 10:41:03,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1015 conditions, 434 events. 170/434 cut-off events. For 108/110 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2054 event pairs, 58 based on Foata normal form. 6/427 useless extension candidates. Maximal degree in co-relation 997. Up to 147 conditions per place. [2023-11-26 10:41:03,791 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 18 selfloop transitions, 1 changer transitions 29/64 dead transitions. [2023-11-26 10:41:03,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 64 transitions, 318 flow [2023-11-26 10:41:03,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:41:03,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 10:41:03,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 164 transitions. [2023-11-26 10:41:03,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6074074074074074 [2023-11-26 10:41:03,794 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 164 transitions. [2023-11-26 10:41:03,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 164 transitions. [2023-11-26 10:41:03,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:03,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 164 transitions. [2023-11-26 10:41:03,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 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-26 10:41:03,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 45.0) internal successors, (315), 7 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:03,797 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 45.0) internal successors, (315), 7 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:03,797 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 158 flow. Second operand 6 states and 164 transitions. [2023-11-26 10:41:03,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 64 transitions, 318 flow [2023-11-26 10:41:03,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 64 transitions, 304 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-11-26 10:41:03,802 INFO L231 Difference]: Finished difference. Result has 58 places, 34 transitions, 114 flow [2023-11-26 10:41:03,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=114, PETRI_PLACES=58, PETRI_TRANSITIONS=34} [2023-11-26 10:41:03,803 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 10 predicate places. [2023-11-26 10:41:03,803 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 34 transitions, 114 flow [2023-11-26 10:41:03,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:03,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:03,804 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-26 10:41:03,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 10:41:03,805 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:41:03,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:03,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1726650549, now seen corresponding path program 3 times [2023-11-26 10:41:03,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:03,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682758347] [2023-11-26 10:41:03,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:03,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:03,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:41:03,876 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:41:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:41:04,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 10:41:04,017 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 10:41:04,018 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-26 10:41:04,020 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-26 10:41:04,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-26 10:41:04,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-26 10:41:04,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-26 10:41:04,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-26 10:41:04,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-26 10:41:04,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-26 10:41:04,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-26 10:41:04,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-26 10:41:04,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 10:41:04,023 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:41:04,032 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-26 10:41:04,032 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 10:41:04,102 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-26 10:41:04,108 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 10:41:04,117 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-26 10:41:04,118 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-26 10:41:04,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 10:41:04 BasicIcfg [2023-11-26 10:41:04,142 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 10:41:04,142 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 10:41:04,142 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 10:41:04,143 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 10:41:04,143 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:40:57" (3/4) ... [2023-11-26 10:41:04,148 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 10:41:04,149 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 10:41:04,150 INFO L158 Benchmark]: Toolchain (without parser) took 8722.70ms. Allocated memory was 161.5MB in the beginning and 257.9MB in the end (delta: 96.5MB). Free memory was 130.0MB in the beginning and 146.6MB in the end (delta: -16.6MB). Peak memory consumption was 81.5MB. Max. memory is 16.1GB. [2023-11-26 10:41:04,151 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 113.2MB. Free memory was 74.0MB in the beginning and 73.9MB in the end (delta: 118.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:41:04,151 INFO L158 Benchmark]: CACSL2BoogieTranslator took 724.30ms. Allocated memory is still 161.5MB. Free memory was 130.0MB in the beginning and 107.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-26 10:41:04,152 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.52ms. Allocated memory is still 161.5MB. Free memory was 107.0MB in the beginning and 104.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 10:41:04,152 INFO L158 Benchmark]: Boogie Preprocessor took 58.63ms. Allocated memory is still 161.5MB. Free memory was 104.4MB in the beginning and 100.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 10:41:04,155 INFO L158 Benchmark]: RCFGBuilder took 955.22ms. Allocated memory is still 161.5MB. Free memory was 100.8MB in the beginning and 56.1MB in the end (delta: 44.7MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2023-11-26 10:41:04,155 INFO L158 Benchmark]: TraceAbstraction took 6863.18ms. Allocated memory was 161.5MB in the beginning and 257.9MB in the end (delta: 96.5MB). Free memory was 55.4MB in the beginning and 147.6MB in the end (delta: -92.2MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2023-11-26 10:41:04,156 INFO L158 Benchmark]: Witness Printer took 7.26ms. Allocated memory is still 257.9MB. Free memory was 147.6MB in the beginning and 146.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:41:04,158 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.31ms. Allocated memory is still 113.2MB. Free memory was 74.0MB in the beginning and 73.9MB in the end (delta: 118.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 724.30ms. Allocated memory is still 161.5MB. Free memory was 130.0MB in the beginning and 107.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 106.52ms. Allocated memory is still 161.5MB. Free memory was 107.0MB in the beginning and 104.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.63ms. Allocated memory is still 161.5MB. Free memory was 104.4MB in the beginning and 100.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 955.22ms. Allocated memory is still 161.5MB. Free memory was 100.8MB in the beginning and 56.1MB in the end (delta: 44.7MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 6863.18ms. Allocated memory was 161.5MB in the beginning and 257.9MB in the end (delta: 96.5MB). Free memory was 55.4MB in the beginning and 147.6MB in the end (delta: -92.2MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * Witness Printer took 7.26ms. Allocated memory is still 257.9MB. Free memory was 147.6MB in the beginning and 146.6MB 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: 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p0_EBX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$read_delayed; [L728] 0 int *a$read_delayed_var; [L729] 0 int a$w_buff0; [L730] 0 _Bool a$w_buff0_used; [L731] 0 int a$w_buff1; [L732] 0 _Bool a$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L827] 0 pthread_t t833; [L828] FCALL, FORK 0 pthread_create(&t833, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t833={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L746] 1 a$w_buff1 = a$w_buff0 [L747] 1 a$w_buff0 = 1 [L748] 1 a$w_buff1_used = a$w_buff0_used [L749] 1 a$w_buff0_used = (_Bool)1 [L750] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L750] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L751] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L752] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L753] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L754] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L760] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L763] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L829] 0 pthread_t t834; [L830] FCALL, FORK 0 pthread_create(&t834, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t833={5:0}, t834={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L783] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L786] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 a$flush_delayed = weak$$choice2 [L792] 2 a$mem_tmp = a [L793] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L794] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L795] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L796] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L797] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L798] 2 a$r_buff0_thd2 = weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) [L799] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L800] 2 __unbuffered_p1_EBX = a [L801] 2 a = a$flush_delayed ? a$mem_tmp : a [L802] 2 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L805] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L806] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L807] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L808] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L809] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L812] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t833={5:0}, t834={3:0}, weak$$choice2=1, x=1, y=1, z=1] [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L837] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L838] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L839] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L840] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t833={5:0}, t834={3:0}, weak$$choice2=1, x=1, y=1, z=1] [L843] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t833={5:0}, t834={3:0}, weak$$choice2=1, x=1, y=1, z=1] [L845] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L17] 0 __assert_fail ("0", "mix031.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, 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: 825]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 828]: 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: 830]: 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 5 procedures, 65 locations, 10 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: 6.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 309 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 247 mSDsluCounter, 86 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 813 IncrementalHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 25 mSDtfsCounter, 813 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=9, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 158 NumberOfCodeBlocks, 158 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 119 ConstructedInterpolants, 0 QuantifiedInterpolants, 736 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-26 10:41:04,187 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme --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 c5191c614040da54c6fe77b0fb4d91d943009a345a9252a69568f58113a0aaaf --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 10:41:07,160 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 10:41:07,269 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-26 10:41:07,276 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 10:41:07,276 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 10:41:07,307 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 10:41:07,308 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 10:41:07,308 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 10:41:07,309 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 10:41:07,310 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 10:41:07,311 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 10:41:07,312 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 10:41:07,313 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 10:41:07,313 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 10:41:07,314 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 10:41:07,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 10:41:07,316 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 10:41:07,316 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 10:41:07,317 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 10:41:07,317 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 10:41:07,318 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-26 10:41:07,319 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-26 10:41:07,319 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-26 10:41:07,320 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 10:41:07,320 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 10:41:07,321 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-26 10:41:07,321 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-26 10:41:07,322 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 10:41:07,322 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 10:41:07,323 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 10:41:07,323 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 10:41:07,324 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 10:41:07,324 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 10:41:07,325 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 10:41:07,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:41:07,326 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 10:41:07,326 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 10:41:07,327 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-26 10:41:07,327 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-26 10:41:07,327 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 10:41:07,328 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 10:41:07,329 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 10:41:07,329 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 10:41:07,329 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-26 10:41:07,330 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_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme 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 -> c5191c614040da54c6fe77b0fb4d91d943009a345a9252a69568f58113a0aaaf [2023-11-26 10:41:07,763 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 10:41:07,787 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 10:41:07,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 10:41:07,792 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 10:41:07,792 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 10:41:07,794 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-wmm/mix031.oepc.i [2023-11-26 10:41:11,198 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 10:41:11,594 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 10:41:11,595 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/sv-benchmarks/c/pthread-wmm/mix031.oepc.i [2023-11-26 10:41:11,624 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/data/796b6cdd4/398d311fac9e45feb267e3396faada66/FLAG2560362b8 [2023-11-26 10:41:11,643 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/data/796b6cdd4/398d311fac9e45feb267e3396faada66 [2023-11-26 10:41:11,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 10:41:11,648 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 10:41:11,650 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 10:41:11,650 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 10:41:11,656 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 10:41:11,657 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:41:11" (1/1) ... [2023-11-26 10:41:11,658 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef4b6b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:11, skipping insertion in model container [2023-11-26 10:41:11,658 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:41:11" (1/1) ... [2023-11-26 10:41:11,714 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 10:41:12,294 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:41:12,320 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 10:41:12,383 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:41:12,449 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 10:41:12,449 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 10:41:12,457 INFO L206 MainTranslator]: Completed translation [2023-11-26 10:41:12,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:12 WrapperNode [2023-11-26 10:41:12,458 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 10:41:12,459 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 10:41:12,459 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 10:41:12,460 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 10:41:12,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:12" (1/1) ... [2023-11-26 10:41:12,505 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:12" (1/1) ... [2023-11-26 10:41:12,545 INFO L138 Inliner]: procedures = 178, calls = 50, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 129 [2023-11-26 10:41:12,545 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 10:41:12,546 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 10:41:12,547 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 10:41:12,547 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 10:41:12,562 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:12" (1/1) ... [2023-11-26 10:41:12,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:12" (1/1) ... [2023-11-26 10:41:12,569 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:12" (1/1) ... [2023-11-26 10:41:12,591 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2023-11-26 10:41:12,591 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:12" (1/1) ... [2023-11-26 10:41:12,592 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:12" (1/1) ... [2023-11-26 10:41:12,608 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:12" (1/1) ... [2023-11-26 10:41:12,610 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:12" (1/1) ... [2023-11-26 10:41:12,629 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:12" (1/1) ... [2023-11-26 10:41:12,646 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:12" (1/1) ... [2023-11-26 10:41:12,652 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 10:41:12,653 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 10:41:12,653 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 10:41:12,653 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 10:41:12,654 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:12" (1/1) ... [2023-11-26 10:41:12,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:41:12,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:41:12,723 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 10:41:12,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 10:41:12,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 10:41:12,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 10:41:12,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 10:41:12,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 10:41:12,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-26 10:41:12,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-26 10:41:12,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-26 10:41:12,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-26 10:41:12,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-26 10:41:12,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-26 10:41:12,787 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-26 10:41:12,787 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-26 10:41:12,787 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-26 10:41:12,787 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-26 10:41:12,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 10:41:12,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 10:41:12,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 10:41:12,790 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 10:41:12,980 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 10:41:12,982 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 10:41:13,390 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 10:41:13,711 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 10:41:13,712 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 10:41:13,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:41:13 BoogieIcfgContainer [2023-11-26 10:41:13,714 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 10:41:13,716 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 10:41:13,716 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 10:41:13,720 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 10:41:13,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 10:41:11" (1/3) ... [2023-11-26 10:41:13,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d82a5c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:41:13, skipping insertion in model container [2023-11-26 10:41:13,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:12" (2/3) ... [2023-11-26 10:41:13,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d82a5c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:41:13, skipping insertion in model container [2023-11-26 10:41:13,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:41:13" (3/3) ... [2023-11-26 10:41:13,725 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031.oepc.i [2023-11-26 10:41:13,748 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 10:41:13,748 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-26 10:41:13,749 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 10:41:13,829 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 10:41:13,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 45 transitions, 98 flow [2023-11-26 10:41:13,938 INFO L124 PetriNetUnfolderBase]: 2/43 cut-off events. [2023-11-26 10:41:13,938 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:41:13,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 43 events. 2/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 80 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 40. Up to 2 conditions per place. [2023-11-26 10:41:13,952 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 45 transitions, 98 flow [2023-11-26 10:41:13,957 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 43 transitions, 92 flow [2023-11-26 10:41:13,986 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:41:13,995 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;@1a747aca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:41:13,995 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-26 10:41:13,999 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 10:41:13,999 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-26 10:41:14,000 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:41:14,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:14,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 10:41:14,002 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:41:14,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:14,009 INFO L85 PathProgramCache]: Analyzing trace with hash 12061, now seen corresponding path program 1 times [2023-11-26 10:41:14,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 10:41:14,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276342789] [2023-11-26 10:41:14,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:14,031 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-26 10:41:14,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 10:41:14,036 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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-26 10:41:14,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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-26 10:41:14,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:14,182 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 10:41:14,191 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:41:14,274 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-26 10:41:14,288 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-26 10:41:14,288 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:41:14,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 10:41:14,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [276342789] [2023-11-26 10:41:14,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [276342789] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:14,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:14,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 10:41:14,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133886280] [2023-11-26 10:41:14,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:14,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:14,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 10:41:14,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:14,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:14,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 45 [2023-11-26 10:41:14,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:14,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:14,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 45 [2023-11-26 10:41:14,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:14,692 INFO L124 PetriNetUnfolderBase]: 237/565 cut-off events. [2023-11-26 10:41:14,692 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-26 10:41:14,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 990 conditions, 565 events. 237/565 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3368 event pairs, 175 based on Foata normal form. 40/542 useless extension candidates. Maximal degree in co-relation 977. Up to 307 conditions per place. [2023-11-26 10:41:14,702 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 24 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2023-11-26 10:41:14,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 150 flow [2023-11-26 10:41:14,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:14,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:14,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2023-11-26 10:41:14,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2023-11-26 10:41:14,719 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 95 transitions. [2023-11-26 10:41:14,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 95 transitions. [2023-11-26 10:41:14,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:14,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 95 transitions. [2023-11-26 10:41:14,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:14,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:14,734 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:14,737 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 92 flow. Second operand 3 states and 95 transitions. [2023-11-26 10:41:14,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 150 flow [2023-11-26 10:41:14,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 46 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:41:14,746 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 86 flow [2023-11-26 10:41:14,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2023-11-26 10:41:14,753 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2023-11-26 10:41:14,753 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 86 flow [2023-11-26 10:41:14,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:14,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:14,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 10:41:14,767 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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-26 10:41:14,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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-26 10:41:14,958 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:41:14,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:14,960 INFO L85 PathProgramCache]: Analyzing trace with hash 12062, now seen corresponding path program 1 times [2023-11-26 10:41:14,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 10:41:14,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [153467911] [2023-11-26 10:41:14,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:14,962 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-26 10:41:14,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 10:41:14,964 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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-26 10:41:14,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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-26 10:41:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:15,080 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 10:41:15,082 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:41:15,101 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-26 10:41:15,114 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-26 10:41:15,115 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:41:15,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 10:41:15,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [153467911] [2023-11-26 10:41:15,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [153467911] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:15,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:15,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 10:41:15,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203783158] [2023-11-26 10:41:15,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:15,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:15,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 10:41:15,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:15,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:15,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 45 [2023-11-26 10:41:15,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:15,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:15,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 45 [2023-11-26 10:41:15,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:15,415 INFO L124 PetriNetUnfolderBase]: 237/564 cut-off events. [2023-11-26 10:41:15,415 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-26 10:41:15,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1008 conditions, 564 events. 237/564 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3381 event pairs, 175 based on Foata normal form. 1/502 useless extension candidates. Maximal degree in co-relation 997. Up to 306 conditions per place. [2023-11-26 10:41:15,423 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 23 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-11-26 10:41:15,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 148 flow [2023-11-26 10:41:15,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:15,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:15,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2023-11-26 10:41:15,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2023-11-26 10:41:15,425 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 95 transitions. [2023-11-26 10:41:15,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 95 transitions. [2023-11-26 10:41:15,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:15,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 95 transitions. [2023-11-26 10:41:15,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:15,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:15,429 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:15,429 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 86 flow. Second operand 3 states and 95 transitions. [2023-11-26 10:41:15,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 148 flow [2023-11-26 10:41:15,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 45 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:41:15,432 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 84 flow [2023-11-26 10:41:15,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2023-11-26 10:41:15,434 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2023-11-26 10:41:15,434 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 84 flow [2023-11-26 10:41:15,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:15,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:15,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 10:41:15,443 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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)] Forceful destruction successful, exit code 0 [2023-11-26 10:41:15,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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-26 10:41:15,637 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:41:15,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:15,638 INFO L85 PathProgramCache]: Analyzing trace with hash 359646965, now seen corresponding path program 1 times [2023-11-26 10:41:15,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 10:41:15,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1593581905] [2023-11-26 10:41:15,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:15,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-26 10:41:15,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 10:41:15,644 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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-26 10:41:15,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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-26 10:41:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:15,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 10:41:15,780 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:41:15,788 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-26 10:41:15,796 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-26 10:41:15,797 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:41:15,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 10:41:15,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1593581905] [2023-11-26 10:41:15,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1593581905] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:15,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:15,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:41:15,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940332745] [2023-11-26 10:41:15,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:15,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:15,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 10:41:15,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:15,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:15,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 45 [2023-11-26 10:41:15,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:15,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:15,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 45 [2023-11-26 10:41:15,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:16,039 INFO L124 PetriNetUnfolderBase]: 241/563 cut-off events. [2023-11-26 10:41:16,039 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-26 10:41:16,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1016 conditions, 563 events. 241/563 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3386 event pairs, 107 based on Foata normal form. 0/511 useless extension candidates. Maximal degree in co-relation 1005. Up to 309 conditions per place. [2023-11-26 10:41:16,046 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 24 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2023-11-26 10:41:16,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 148 flow [2023-11-26 10:41:16,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:16,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:16,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2023-11-26 10:41:16,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6888888888888889 [2023-11-26 10:41:16,053 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 93 transitions. [2023-11-26 10:41:16,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 93 transitions. [2023-11-26 10:41:16,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:16,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 93 transitions. [2023-11-26 10:41:16,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:16,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:16,059 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:16,060 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 84 flow. Second operand 3 states and 93 transitions. [2023-11-26 10:41:16,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 148 flow [2023-11-26 10:41:16,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 44 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:41:16,065 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 82 flow [2023-11-26 10:41:16,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2023-11-26 10:41:16,067 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2023-11-26 10:41:16,068 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 82 flow [2023-11-26 10:41:16,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:16,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:16,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 10:41:16,078 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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)] Forceful destruction successful, exit code 0 [2023-11-26 10:41:16,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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-26 10:41:16,271 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:41:16,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:16,272 INFO L85 PathProgramCache]: Analyzing trace with hash 359646966, now seen corresponding path program 1 times [2023-11-26 10:41:16,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 10:41:16,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062996028] [2023-11-26 10:41:16,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:16,273 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-26 10:41:16,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 10:41:16,276 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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-26 10:41:16,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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-26 10:41:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:16,386 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 10:41:16,388 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:41:16,400 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-26 10:41:16,413 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-26 10:41:16,413 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:41:16,414 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 10:41:16,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1062996028] [2023-11-26 10:41:16,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1062996028] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:16,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:16,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:41:16,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823823543] [2023-11-26 10:41:16,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:16,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:16,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 10:41:16,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:16,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:16,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 45 [2023-11-26 10:41:16,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:16,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:16,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 45 [2023-11-26 10:41:16,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:16,648 INFO L124 PetriNetUnfolderBase]: 237/554 cut-off events. [2023-11-26 10:41:16,648 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-11-26 10:41:16,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1002 conditions, 554 events. 237/554 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3304 event pairs, 107 based on Foata normal form. 5/509 useless extension candidates. Maximal degree in co-relation 992. Up to 300 conditions per place. [2023-11-26 10:41:16,653 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 23 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-11-26 10:41:16,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 144 flow [2023-11-26 10:41:16,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:16,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:16,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2023-11-26 10:41:16,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2023-11-26 10:41:16,655 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 95 transitions. [2023-11-26 10:41:16,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 95 transitions. [2023-11-26 10:41:16,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:16,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 95 transitions. [2023-11-26 10:41:16,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:16,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:16,657 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:16,658 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 82 flow. Second operand 3 states and 95 transitions. [2023-11-26 10:41:16,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 144 flow [2023-11-26 10:41:16,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:41:16,660 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 80 flow [2023-11-26 10:41:16,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2023-11-26 10:41:16,661 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2023-11-26 10:41:16,661 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 80 flow [2023-11-26 10:41:16,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:16,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:16,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 10:41:16,670 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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)] Forceful destruction successful, exit code 0 [2023-11-26 10:41:16,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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-26 10:41:16,865 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:41:16,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:16,865 INFO L85 PathProgramCache]: Analyzing trace with hash 359647224, now seen corresponding path program 1 times [2023-11-26 10:41:16,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 10:41:16,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1029315616] [2023-11-26 10:41:16,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:16,866 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-26 10:41:16,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 10:41:16,867 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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-26 10:41:16,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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-26 10:41:16,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:16,963 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-26 10:41:16,965 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:41:16,978 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-26 10:41:16,978 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:41:16,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 10:41:16,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1029315616] [2023-11-26 10:41:16,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1029315616] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:16,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:16,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 10:41:16,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512635530] [2023-11-26 10:41:16,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:16,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:16,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 10:41:16,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:16,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:16,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 45 [2023-11-26 10:41:16,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:16,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:16,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 45 [2023-11-26 10:41:16,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:17,150 INFO L124 PetriNetUnfolderBase]: 183/413 cut-off events. [2023-11-26 10:41:17,151 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-11-26 10:41:17,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 413 events. 183/413 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2134 event pairs, 69 based on Foata normal form. 0/409 useless extension candidates. Maximal degree in co-relation 756. Up to 265 conditions per place. [2023-11-26 10:41:17,155 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 25 selfloop transitions, 2 changer transitions 2/47 dead transitions. [2023-11-26 10:41:17,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 47 transitions, 166 flow [2023-11-26 10:41:17,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:17,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:17,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2023-11-26 10:41:17,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7555555555555555 [2023-11-26 10:41:17,158 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 102 transitions. [2023-11-26 10:41:17,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 102 transitions. [2023-11-26 10:41:17,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:17,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 102 transitions. [2023-11-26 10:41:17,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-26 10:41:17,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:17,160 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:17,160 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 80 flow. Second operand 3 states and 102 transitions. [2023-11-26 10:41:17,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 47 transitions, 166 flow [2023-11-26 10:41:17,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 47 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:41:17,163 INFO L231 Difference]: Finished difference. Result has 42 places, 34 transitions, 76 flow [2023-11-26 10:41:17,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2023-11-26 10:41:17,166 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -6 predicate places. [2023-11-26 10:41:17,166 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 76 flow [2023-11-26 10:41:17,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:17,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:17,167 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:41:17,181 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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)] Forceful destruction successful, exit code 0 [2023-11-26 10:41:17,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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-26 10:41:17,370 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:41:17,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:17,371 INFO L85 PathProgramCache]: Analyzing trace with hash 2547899, now seen corresponding path program 1 times [2023-11-26 10:41:17,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 10:41:17,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [199938907] [2023-11-26 10:41:17,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:17,372 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-26 10:41:17,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 10:41:17,373 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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-26 10:41:17,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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-26 10:41:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:17,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 10:41:17,488 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:41:17,537 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-26 10:41:17,537 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:41:17,538 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 10:41:17,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [199938907] [2023-11-26 10:41:17,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [199938907] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:17,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:17,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 10:41:17,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926889481] [2023-11-26 10:41:17,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:17,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:41:17,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 10:41:17,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:41:17,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:41:17,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 45 [2023-11-26 10:41:17,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:17,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:17,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 45 [2023-11-26 10:41:17,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:17,767 INFO L124 PetriNetUnfolderBase]: 220/502 cut-off events. [2023-11-26 10:41:17,767 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2023-11-26 10:41:17,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 949 conditions, 502 events. 220/502 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2603 event pairs, 38 based on Foata normal form. 25/514 useless extension candidates. Maximal degree in co-relation 938. Up to 229 conditions per place. [2023-11-26 10:41:17,771 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 32 selfloop transitions, 4 changer transitions 1/52 dead transitions. [2023-11-26 10:41:17,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 192 flow [2023-11-26 10:41:17,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:41:17,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 10:41:17,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2023-11-26 10:41:17,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6833333333333333 [2023-11-26 10:41:17,773 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 123 transitions. [2023-11-26 10:41:17,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 123 transitions. [2023-11-26 10:41:17,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:17,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 123 transitions. [2023-11-26 10:41:17,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:17,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:17,777 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:17,777 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 76 flow. Second operand 4 states and 123 transitions. [2023-11-26 10:41:17,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 192 flow [2023-11-26 10:41:17,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:41:17,782 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 98 flow [2023-11-26 10:41:17,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=98, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2023-11-26 10:41:17,787 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2023-11-26 10:41:17,787 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 98 flow [2023-11-26 10:41:17,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:17,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:17,788 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-26 10:41:17,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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-26 10:41:17,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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-26 10:41:17,992 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:41:17,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:17,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1532477989, now seen corresponding path program 1 times [2023-11-26 10:41:17,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 10:41:17,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [644747552] [2023-11-26 10:41:17,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:17,993 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-26 10:41:17,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 10:41:17,995 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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-26 10:41:17,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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-26 10:41:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:18,120 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 10:41:18,122 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:41:18,177 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-26 10:41:18,177 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:41:18,178 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 10:41:18,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [644747552] [2023-11-26 10:41:18,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [644747552] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:18,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:18,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:41:18,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641552559] [2023-11-26 10:41:18,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:18,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:41:18,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 10:41:18,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:41:18,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:41:18,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 45 [2023-11-26 10:41:18,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:18,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:18,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 45 [2023-11-26 10:41:18,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:18,342 INFO L124 PetriNetUnfolderBase]: 106/247 cut-off events. [2023-11-26 10:41:18,342 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2023-11-26 10:41:18,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 552 conditions, 247 events. 106/247 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 865 event pairs, 26 based on Foata normal form. 16/253 useless extension candidates. Maximal degree in co-relation 539. Up to 86 conditions per place. [2023-11-26 10:41:18,344 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 27 selfloop transitions, 6 changer transitions 1/49 dead transitions. [2023-11-26 10:41:18,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 49 transitions, 197 flow [2023-11-26 10:41:18,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:41:18,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 10:41:18,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2023-11-26 10:41:18,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6266666666666667 [2023-11-26 10:41:18,346 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 141 transitions. [2023-11-26 10:41:18,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 141 transitions. [2023-11-26 10:41:18,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:18,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 141 transitions. [2023-11-26 10:41:18,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:18,349 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 45.0) internal successors, (270), 6 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:18,349 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 45.0) internal successors, (270), 6 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:18,349 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 98 flow. Second operand 5 states and 141 transitions. [2023-11-26 10:41:18,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 49 transitions, 197 flow [2023-11-26 10:41:18,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 49 transitions, 188 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-26 10:41:18,352 INFO L231 Difference]: Finished difference. Result has 48 places, 36 transitions, 114 flow [2023-11-26 10:41:18,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2023-11-26 10:41:18,353 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 0 predicate places. [2023-11-26 10:41:18,353 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 114 flow [2023-11-26 10:41:18,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:18,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:18,354 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-26 10:41:18,358 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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-26 10:41:18,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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-26 10:41:18,559 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:41:18,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:18,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1692066636, now seen corresponding path program 1 times [2023-11-26 10:41:18,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 10:41:18,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234951029] [2023-11-26 10:41:18,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:18,560 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-26 10:41:18,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 10:41:18,561 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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-26 10:41:18,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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-26 10:41:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:18,754 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-26 10:41:18,760 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:41:19,209 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t834~0#1.base_43| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t833~0#1.base_39| (_ BitVec 32))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t833~0#1.base_39|) (_ bv0 1)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t833~0#1.base_39| (_ bv1 1)) |v_ULTIMATE.start_main_~#t834~0#1.base_43|) (_ bv0 1)) (= (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t833~0#1.base_39| (_ bv0 1)) |v_ULTIMATE.start_main_~#t834~0#1.base_43| (_ bv0 1)) |c_#valid|))) is different from true [2023-11-26 10:41:19,210 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-26 10:41:19,210 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:41:19,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 10:41:19,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234951029] [2023-11-26 10:41:19,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [234951029] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:19,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:19,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 10:41:19,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765604420] [2023-11-26 10:41:19,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:19,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:41:19,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 10:41:19,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:41:19,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-11-26 10:41:19,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2023-11-26 10:41:19,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 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-26 10:41:19,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:19,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2023-11-26 10:41:19,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:19,363 INFO L124 PetriNetUnfolderBase]: 66/197 cut-off events. [2023-11-26 10:41:19,363 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2023-11-26 10:41:19,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 414 conditions, 197 events. 66/197 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 690 event pairs, 56 based on Foata normal form. 4/192 useless extension candidates. Maximal degree in co-relation 398. Up to 117 conditions per place. [2023-11-26 10:41:19,365 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 21 selfloop transitions, 5 changer transitions 0/43 dead transitions. [2023-11-26 10:41:19,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 43 transitions, 180 flow [2023-11-26 10:41:19,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:41:19,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 10:41:19,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2023-11-26 10:41:19,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49777777777777776 [2023-11-26 10:41:19,367 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 112 transitions. [2023-11-26 10:41:19,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 112 transitions. [2023-11-26 10:41:19,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:19,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 112 transitions. [2023-11-26 10:41:19,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:19,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 45.0) internal successors, (270), 6 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:19,370 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 45.0) internal successors, (270), 6 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:19,370 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 114 flow. Second operand 5 states and 112 transitions. [2023-11-26 10:41:19,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 43 transitions, 180 flow [2023-11-26 10:41:19,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 43 transitions, 152 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-11-26 10:41:19,373 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 109 flow [2023-11-26 10:41:19,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=109, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2023-11-26 10:41:19,374 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2023-11-26 10:41:19,374 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 109 flow [2023-11-26 10:41:19,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 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-26 10:41:19,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:19,375 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-26 10:41:19,386 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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)] Forceful destruction successful, exit code 0 [2023-11-26 10:41:19,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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-26 10:41:19,579 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:41:19,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:19,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1188197321, now seen corresponding path program 1 times [2023-11-26 10:41:19,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 10:41:19,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1404275837] [2023-11-26 10:41:19,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:19,581 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-26 10:41:19,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 10:41:19,583 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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-26 10:41:19,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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-26 10:41:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:19,732 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-26 10:41:19,735 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:41:20,086 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-26 10:41:20,087 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:41:20,087 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 10:41:20,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1404275837] [2023-11-26 10:41:20,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1404275837] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:20,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:20,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 10:41:20,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878181779] [2023-11-26 10:41:20,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:20,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 10:41:20,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 10:41:20,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 10:41:20,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-26 10:41:20,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 45 [2023-11-26 10:41:20,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 109 flow. Second operand has 8 states, 8 states have (on average 24.75) internal successors, (198), 8 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:20,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:20,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 45 [2023-11-26 10:41:20,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:20,487 INFO L124 PetriNetUnfolderBase]: 101/288 cut-off events. [2023-11-26 10:41:20,487 INFO L125 PetriNetUnfolderBase]: For 91/95 co-relation queries the response was YES. [2023-11-26 10:41:20,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 640 conditions, 288 events. 101/288 cut-off events. For 91/95 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1160 event pairs, 17 based on Foata normal form. 4/283 useless extension candidates. Maximal degree in co-relation 627. Up to 91 conditions per place. [2023-11-26 10:41:20,490 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 40 selfloop transitions, 9 changer transitions 0/68 dead transitions. [2023-11-26 10:41:20,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 68 transitions, 306 flow [2023-11-26 10:41:20,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 10:41:20,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-26 10:41:20,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 253 transitions. [2023-11-26 10:41:20,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6246913580246913 [2023-11-26 10:41:20,493 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 253 transitions. [2023-11-26 10:41:20,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 253 transitions. [2023-11-26 10:41:20,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:20,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 253 transitions. [2023-11-26 10:41:20,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 28.11111111111111) internal successors, (253), 9 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:20,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 45.0) internal successors, (450), 10 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:20,497 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 45.0) internal successors, (450), 10 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:20,497 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 109 flow. Second operand 9 states and 253 transitions. [2023-11-26 10:41:20,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 68 transitions, 306 flow [2023-11-26 10:41:20,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 68 transitions, 292 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-26 10:41:20,501 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 152 flow [2023-11-26 10:41:20,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=152, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2023-11-26 10:41:20,502 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 8 predicate places. [2023-11-26 10:41:20,502 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 152 flow [2023-11-26 10:41:20,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.75) internal successors, (198), 8 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:20,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:20,502 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-26 10:41:20,512 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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)] Forceful destruction successful, exit code 0 [2023-11-26 10:41:20,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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-26 10:41:20,706 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:41:20,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:20,706 INFO L85 PathProgramCache]: Analyzing trace with hash 280617609, now seen corresponding path program 2 times [2023-11-26 10:41:20,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 10:41:20,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1174847385] [2023-11-26 10:41:20,707 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-26 10:41:20,707 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-26 10:41:20,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 10:41:20,709 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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-26 10:41:20,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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-26 10:41:20,857 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-26 10:41:20,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 10:41:20,862 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-26 10:41:20,864 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:41:20,944 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-26 10:41:20,944 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:41:20,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 10:41:20,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1174847385] [2023-11-26 10:41:20,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1174847385] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:20,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:20,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 10:41:20,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203936358] [2023-11-26 10:41:20,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:20,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:41:20,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 10:41:20,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:41:20,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:41:20,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 45 [2023-11-26 10:41:20,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:20,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:20,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 45 [2023-11-26 10:41:20,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:21,222 INFO L124 PetriNetUnfolderBase]: 206/527 cut-off events. [2023-11-26 10:41:21,222 INFO L125 PetriNetUnfolderBase]: For 284/292 co-relation queries the response was YES. [2023-11-26 10:41:21,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1352 conditions, 527 events. 206/527 cut-off events. For 284/292 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2599 event pairs, 74 based on Foata normal form. 4/517 useless extension candidates. Maximal degree in co-relation 1335. Up to 206 conditions per place. [2023-11-26 10:41:21,228 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 45 selfloop transitions, 8 changer transitions 0/70 dead transitions. [2023-11-26 10:41:21,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 70 transitions, 371 flow [2023-11-26 10:41:21,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:41:21,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 10:41:21,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 166 transitions. [2023-11-26 10:41:21,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6148148148148148 [2023-11-26 10:41:21,231 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 166 transitions. [2023-11-26 10:41:21,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 166 transitions. [2023-11-26 10:41:21,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:21,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 166 transitions. [2023-11-26 10:41:21,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:21,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 45.0) internal successors, (315), 7 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:21,234 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 45.0) internal successors, (315), 7 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:21,234 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 152 flow. Second operand 6 states and 166 transitions. [2023-11-26 10:41:21,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 70 transitions, 371 flow [2023-11-26 10:41:21,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 70 transitions, 360 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-26 10:41:21,251 INFO L231 Difference]: Finished difference. Result has 62 places, 50 transitions, 229 flow [2023-11-26 10:41:21,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=229, PETRI_PLACES=62, PETRI_TRANSITIONS=50} [2023-11-26 10:41:21,253 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 14 predicate places. [2023-11-26 10:41:21,254 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 229 flow [2023-11-26 10:41:21,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:21,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:21,254 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-26 10:41:21,260 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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-26 10:41:21,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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-26 10:41:21,458 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:41:21,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:21,458 INFO L85 PathProgramCache]: Analyzing trace with hash 168288717, now seen corresponding path program 3 times [2023-11-26 10:41:21,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 10:41:21,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [474929112] [2023-11-26 10:41:21,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-26 10:41:21,459 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-26 10:41:21,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 10:41:21,461 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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-26 10:41:21,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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-26 10:41:21,611 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-26 10:41:21,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-26 10:41:21,612 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:41:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:41:21,770 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-26 10:41:21,771 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 10:41:21,772 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-26 10:41:21,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-26 10:41:21,774 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-26 10:41:21,774 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-26 10:41:21,774 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-26 10:41:21,774 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-26 10:41:21,774 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-26 10:41:21,775 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-26 10:41:21,775 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-26 10:41:21,775 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-26 10:41:21,784 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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)] Forceful destruction successful, exit code 0 [2023-11-26 10:41:21,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/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-26 10:41:21,980 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:41:21,985 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-26 10:41:21,986 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 10:41:22,061 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-26 10:41:22,071 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 10:41:22,097 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-26 10:41:22,098 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-26 10:41:22,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 10:41:22 BasicIcfg [2023-11-26 10:41:22,127 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 10:41:22,128 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 10:41:22,128 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 10:41:22,128 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 10:41:22,129 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:41:13" (3/4) ... [2023-11-26 10:41:22,131 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 10:41:22,132 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 10:41:22,135 INFO L158 Benchmark]: Toolchain (without parser) took 10485.06ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 82.9MB in the beginning and 65.4MB in the end (delta: 17.5MB). Peak memory consumption was 68.4MB. Max. memory is 16.1GB. [2023-11-26 10:41:22,136 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 75.5MB. Free memory is still 52.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:41:22,136 INFO L158 Benchmark]: CACSL2BoogieTranslator took 808.62ms. Allocated memory is still 109.1MB. Free memory was 82.7MB in the beginning and 82.3MB in the end (delta: 385.2kB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2023-11-26 10:41:22,136 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.58ms. Allocated memory is still 109.1MB. Free memory was 82.3MB in the beginning and 79.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 10:41:22,137 INFO L158 Benchmark]: Boogie Preprocessor took 105.78ms. Allocated memory is still 109.1MB. Free memory was 79.8MB in the beginning and 76.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 10:41:22,137 INFO L158 Benchmark]: RCFGBuilder took 1060.78ms. Allocated memory is still 109.1MB. Free memory was 76.5MB in the beginning and 56.2MB in the end (delta: 20.3MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2023-11-26 10:41:22,138 INFO L158 Benchmark]: TraceAbstraction took 8411.20ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 55.3MB in the beginning and 66.4MB in the end (delta: -11.1MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. [2023-11-26 10:41:22,138 INFO L158 Benchmark]: Witness Printer took 4.60ms. Allocated memory is still 159.4MB. Free memory was 66.4MB in the beginning and 65.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:41:22,141 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.36ms. Allocated memory is still 75.5MB. Free memory is still 52.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 808.62ms. Allocated memory is still 109.1MB. Free memory was 82.7MB in the beginning and 82.3MB in the end (delta: 385.2kB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.58ms. Allocated memory is still 109.1MB. Free memory was 82.3MB in the beginning and 79.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 105.78ms. Allocated memory is still 109.1MB. Free memory was 79.8MB in the beginning and 76.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1060.78ms. Allocated memory is still 109.1MB. Free memory was 76.5MB in the beginning and 56.2MB in the end (delta: 20.3MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. * TraceAbstraction took 8411.20ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 55.3MB in the beginning and 66.4MB in the end (delta: -11.1MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. * Witness Printer took 4.60ms. Allocated memory is still 159.4MB. Free memory was 66.4MB in the beginning and 65.4MB 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: 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p0_EBX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$read_delayed; [L728] 0 int *a$read_delayed_var; [L729] 0 int a$w_buff0; [L730] 0 _Bool a$w_buff0_used; [L731] 0 int a$w_buff1; [L732] 0 _Bool a$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L827] 0 pthread_t t833; [L828] FCALL, FORK 0 pthread_create(&t833, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t833={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L746] 1 a$w_buff1 = a$w_buff0 [L747] 1 a$w_buff0 = 1 [L748] 1 a$w_buff1_used = a$w_buff0_used [L749] 1 a$w_buff0_used = (_Bool)1 [L750] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L750] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L751] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L752] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L753] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L754] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L760] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L763] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L829] 0 pthread_t t834; [L830] FCALL, FORK 0 pthread_create(&t834, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t833={3:0}, t834={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L783] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L786] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 a$flush_delayed = weak$$choice2 [L792] 2 a$mem_tmp = a [L793] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L794] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L795] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L796] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L797] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L798] 2 a$r_buff0_thd2 = weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) [L799] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L800] 2 __unbuffered_p1_EBX = a [L801] 2 a = a$flush_delayed ? a$mem_tmp : a [L802] 2 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L805] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L806] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L807] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L808] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L809] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L812] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t833={3:0}, t834={7:0}, weak$$choice2=0, x=1, y=1, z=1] [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L837] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L838] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L839] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L840] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t833={3:0}, t834={7:0}, weak$$choice2=0, x=1, y=1, z=1] [L843] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t833={3:0}, t834={7:0}, weak$$choice2=0, x=1, y=1, z=1] [L845] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L17] 0 __assert_fail ("0", "mix031.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, 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: 825]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 828]: 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: 830]: 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 5 procedures, 65 locations, 10 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 258 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 215 mSDsluCounter, 51 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 37 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 726 IncrementalHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 13 mSDtfsCounter, 726 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229occurred in iteration=10, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 172 NumberOfCodeBlocks, 172 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 133 ConstructedInterpolants, 1 QuantifiedInterpolants, 979 SizeOfPredicates, 9 NumberOfNonLiveVariables, 961 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-26 10:41:22,180 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d84c997e-baf0-40d0-b07a-865d700ffd47/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample