./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix034_pso.opt_tso.opt.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_250f2167-dad3-4327-9309-4407e4bd30b8/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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_250f2167-dad3-4327-9309-4407e4bd30b8/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix034_pso.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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_250f2167-dad3-4327-9309-4407e4bd30b8/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 0d984378a3d93078f60e6a73f83b588890817628b7e21c558fe1824f195f48ce --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:54:08,198 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:54:08,325 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-26 11:54:08,336 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:54:08,337 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:54:08,375 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:54:08,377 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:54:08,378 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:54:08,379 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:54:08,384 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:54:08,385 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:54:08,386 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:54:08,387 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:54:08,389 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:54:08,389 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:54:08,390 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:54:08,390 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:54:08,391 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:54:08,391 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:54:08,392 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:54:08,393 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-26 11:54:08,393 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-26 11:54:08,394 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-26 11:54:08,394 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:54:08,395 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 11:54:08,395 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 11:54:08,396 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:54:08,396 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:54:08,397 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:54:08,398 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:54:08,399 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:54:08,400 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:54:08,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:54:08,400 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:54:08,401 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:54:08,401 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:54:08,402 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:54:08,402 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:54:08,402 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:54:08,403 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:54:08,403 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:54:08,403 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_250f2167-dad3-4327-9309-4407e4bd30b8/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_250f2167-dad3-4327-9309-4407e4bd30b8/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 -> 0d984378a3d93078f60e6a73f83b588890817628b7e21c558fe1824f195f48ce [2023-11-26 11:54:08,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:54:08,744 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:54:08,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:54:08,749 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:54:08,749 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:54:08,750 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-wmm/mix034_pso.opt_tso.opt.i [2023-11-26 11:54:11,837 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:54:12,129 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:54:12,130 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/sv-benchmarks/c/pthread-wmm/mix034_pso.opt_tso.opt.i [2023-11-26 11:54:12,148 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/bin/uautomizer-verify-VRDe98Ueme/data/8fcc2da8f/a2fff7d1a48e49a3a8f0fa0c9fc15c8b/FLAG6ee906e47 [2023-11-26 11:54:12,170 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/bin/uautomizer-verify-VRDe98Ueme/data/8fcc2da8f/a2fff7d1a48e49a3a8f0fa0c9fc15c8b [2023-11-26 11:54:12,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:54:12,174 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:54:12,176 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:54:12,176 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:54:12,183 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:54:12,184 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:54:12" (1/1) ... [2023-11-26 11:54:12,186 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@468a3907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:12, skipping insertion in model container [2023-11-26 11:54:12,186 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:54:12" (1/1) ... [2023-11-26 11:54:12,240 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:54:12,736 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:54:12,755 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:54:12,844 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:54:12,890 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 11:54:12,890 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 11:54:12,899 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:54:12,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:12 WrapperNode [2023-11-26 11:54:12,900 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:54:12,901 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:54:12,902 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:54:12,902 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:54:12,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:12" (1/1) ... [2023-11-26 11:54:12,936 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:12" (1/1) ... [2023-11-26 11:54:12,995 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 126 [2023-11-26 11:54:12,996 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:54:12,996 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:54:12,997 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:54:12,997 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:54:13,010 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:12" (1/1) ... [2023-11-26 11:54:13,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:12" (1/1) ... [2023-11-26 11:54:13,014 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:12" (1/1) ... [2023-11-26 11:54:13,034 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 11:54:13,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:12" (1/1) ... [2023-11-26 11:54:13,034 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:12" (1/1) ... [2023-11-26 11:54:13,053 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:12" (1/1) ... [2023-11-26 11:54:13,055 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:12" (1/1) ... [2023-11-26 11:54:13,058 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:12" (1/1) ... [2023-11-26 11:54:13,060 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:12" (1/1) ... [2023-11-26 11:54:13,065 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:54:13,066 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:54:13,066 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:54:13,066 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:54:13,067 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:12" (1/1) ... [2023-11-26 11:54:13,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:54:13,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:54:13,102 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:54:13,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:54:13,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 11:54:13,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 11:54:13,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 11:54:13,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 11:54:13,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:54:13,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 11:54:13,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 11:54:13,149 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-26 11:54:13,149 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-26 11:54:13,149 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-26 11:54:13,150 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-26 11:54:13,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 11:54:13,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 11:54:13,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-26 11:54:13,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 11:54:13,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:54:13,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:54:13,152 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 11:54:13,329 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:54:13,331 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:54:13,631 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:54:13,900 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:54:13,900 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 11:54:13,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:54:13 BoogieIcfgContainer [2023-11-26 11:54:13,902 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:54:13,905 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:54:13,906 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:54:13,910 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:54:13,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:54:12" (1/3) ... [2023-11-26 11:54:13,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f914dfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:54:13, skipping insertion in model container [2023-11-26 11:54:13,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:12" (2/3) ... [2023-11-26 11:54:13,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f914dfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:54:13, skipping insertion in model container [2023-11-26 11:54:13,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:54:13" (3/3) ... [2023-11-26 11:54:13,918 INFO L112 eAbstractionObserver]: Analyzing ICFG mix034_pso.opt_tso.opt.i [2023-11-26 11:54:13,935 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:54:13,935 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-26 11:54:13,935 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 11:54:13,987 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 11:54:14,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 43 transitions, 94 flow [2023-11-26 11:54:14,063 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2023-11-26 11:54:14,064 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:54:14,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2023-11-26 11:54:14,068 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 43 transitions, 94 flow [2023-11-26 11:54:14,073 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 41 transitions, 88 flow [2023-11-26 11:54:14,084 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:54:14,091 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;@27de9320, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:54:14,092 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-26 11:54:14,095 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 11:54:14,096 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-26 11:54:14,096 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:54:14,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:14,097 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 11:54:14,098 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 11:54:14,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:14,104 INFO L85 PathProgramCache]: Analyzing trace with hash 11496, now seen corresponding path program 1 times [2023-11-26 11:54:14,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:14,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827805186] [2023-11-26 11:54:14,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:14,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:14,475 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 11:54:14,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:54:14,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827805186] [2023-11-26 11:54:14,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827805186] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:14,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:14,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:54:14,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577945628] [2023-11-26 11:54:14,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:14,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:54:14,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:54:14,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:54:14,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:54:14,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2023-11-26 11:54:14,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 11:54:14,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:54:14,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2023-11-26 11:54:14,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:54:14,806 INFO L124 PetriNetUnfolderBase]: 166/413 cut-off events. [2023-11-26 11:54:14,806 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-26 11:54:14,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 413 events. 166/413 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2449 event pairs, 122 based on Foata normal form. 30/399 useless extension candidates. Maximal degree in co-relation 706. Up to 220 conditions per place. [2023-11-26 11:54:14,815 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 22 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-11-26 11:54:14,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 43 transitions, 140 flow [2023-11-26 11:54:14,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:54:14,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:54:14,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2023-11-26 11:54:14,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6976744186046512 [2023-11-26 11:54:14,829 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 90 transitions. [2023-11-26 11:54:14,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 90 transitions. [2023-11-26 11:54:14,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:14,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 90 transitions. [2023-11-26 11:54:14,837 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 11:54:14,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states 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 11:54:14,846 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states 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 11:54:14,848 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 88 flow. Second operand 3 states and 90 transitions. [2023-11-26 11:54:14,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 43 transitions, 140 flow [2023-11-26 11:54:14,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:54:14,862 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 82 flow [2023-11-26 11:54:14,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, 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 11:54:14,871 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2023-11-26 11:54:14,872 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 82 flow [2023-11-26 11:54:14,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 11:54:14,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:14,873 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 11:54:14,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:54:14,874 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 11:54:14,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:14,875 INFO L85 PathProgramCache]: Analyzing trace with hash 11497, now seen corresponding path program 1 times [2023-11-26 11:54:14,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:14,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222455052] [2023-11-26 11:54:14,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:14,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:14,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:15,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 11:54:15,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:54:15,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222455052] [2023-11-26 11:54:15,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222455052] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:15,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:15,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:54:15,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547170977] [2023-11-26 11:54:15,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:15,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:54:15,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:54:15,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:54:15,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:54:15,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 43 [2023-11-26 11:54:15,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 82 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 11:54:15,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:54:15,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 43 [2023-11-26 11:54:15,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:54:15,359 INFO L124 PetriNetUnfolderBase]: 166/412 cut-off events. [2023-11-26 11:54:15,363 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-26 11:54:15,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 732 conditions, 412 events. 166/412 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2427 event pairs, 122 based on Foata normal form. 1/369 useless extension candidates. Maximal degree in co-relation 721. Up to 219 conditions per place. [2023-11-26 11:54:15,373 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 21 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-11-26 11:54:15,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 42 transitions, 138 flow [2023-11-26 11:54:15,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:54:15,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:54:15,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2023-11-26 11:54:15,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6976744186046512 [2023-11-26 11:54:15,379 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 90 transitions. [2023-11-26 11:54:15,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 90 transitions. [2023-11-26 11:54:15,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:15,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 90 transitions. [2023-11-26 11:54:15,383 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 11:54:15,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states 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 11:54:15,385 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states 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 11:54:15,385 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 82 flow. Second operand 3 states and 90 transitions. [2023-11-26 11:54:15,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 42 transitions, 138 flow [2023-11-26 11:54:15,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 42 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:54:15,391 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 80 flow [2023-11-26 11:54:15,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, 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 11:54:15,395 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2023-11-26 11:54:15,396 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 80 flow [2023-11-26 11:54:15,396 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 11:54:15,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:15,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 11:54:15,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:54:15,399 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 11:54:15,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:15,406 INFO L85 PathProgramCache]: Analyzing trace with hash 342795029, now seen corresponding path program 1 times [2023-11-26 11:54:15,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:15,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494499011] [2023-11-26 11:54:15,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:15,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:15,530 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 11:54:15,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:54:15,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494499011] [2023-11-26 11:54:15,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494499011] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:15,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:15,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:54:15,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621220315] [2023-11-26 11:54:15,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:15,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:54:15,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:54:15,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:54:15,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:54:15,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2023-11-26 11:54:15,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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 11:54:15,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:54:15,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2023-11-26 11:54:15,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:54:15,698 INFO L124 PetriNetUnfolderBase]: 168/411 cut-off events. [2023-11-26 11:54:15,699 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-26 11:54:15,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 736 conditions, 411 events. 168/411 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2430 event pairs, 80 based on Foata normal form. 0/374 useless extension candidates. Maximal degree in co-relation 725. Up to 220 conditions per place. [2023-11-26 11:54:15,706 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 22 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-11-26 11:54:15,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 41 transitions, 138 flow [2023-11-26 11:54:15,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:54:15,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:54:15,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2023-11-26 11:54:15,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6821705426356589 [2023-11-26 11:54:15,712 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 88 transitions. [2023-11-26 11:54:15,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 88 transitions. [2023-11-26 11:54:15,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:15,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 88 transitions. [2023-11-26 11:54:15,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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 11:54:15,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states 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 11:54:15,717 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states 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 11:54:15,717 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 80 flow. Second operand 3 states and 88 transitions. [2023-11-26 11:54:15,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 41 transitions, 138 flow [2023-11-26 11:54:15,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 41 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:54:15,720 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 78 flow [2023-11-26 11:54:15,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, 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 11:54:15,722 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -4 predicate places. [2023-11-26 11:54:15,723 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 78 flow [2023-11-26 11:54:15,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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 11:54:15,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:15,724 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 11:54:15,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:54:15,724 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 11:54:15,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:15,725 INFO L85 PathProgramCache]: Analyzing trace with hash 342795030, now seen corresponding path program 1 times [2023-11-26 11:54:15,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:15,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138994487] [2023-11-26 11:54:15,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:15,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:15,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:15,827 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 11:54:15,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:54:15,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138994487] [2023-11-26 11:54:15,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138994487] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:15,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:15,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:54:15,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895862197] [2023-11-26 11:54:15,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:15,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:54:15,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:54:15,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:54:15,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:54:15,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 43 [2023-11-26 11:54:15,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 78 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 11:54:15,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:54:15,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 43 [2023-11-26 11:54:15,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:54:15,995 INFO L124 PetriNetUnfolderBase]: 166/401 cut-off events. [2023-11-26 11:54:15,995 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-26 11:54:15,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 723 conditions, 401 events. 166/401 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2326 event pairs, 125 based on Foata normal form. 3/367 useless extension candidates. Maximal degree in co-relation 713. Up to 215 conditions per place. [2023-11-26 11:54:16,000 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 21 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2023-11-26 11:54:16,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 40 transitions, 134 flow [2023-11-26 11:54:16,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:54:16,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:54:16,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2023-11-26 11:54:16,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6976744186046512 [2023-11-26 11:54:16,002 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 90 transitions. [2023-11-26 11:54:16,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 90 transitions. [2023-11-26 11:54:16,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:16,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 90 transitions. [2023-11-26 11:54:16,003 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 11:54:16,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states 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 11:54:16,005 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states 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 11:54:16,005 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 78 flow. Second operand 3 states and 90 transitions. [2023-11-26 11:54:16,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 40 transitions, 134 flow [2023-11-26 11:54:16,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 40 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:54:16,007 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 76 flow [2023-11-26 11:54:16,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, 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 11:54:16,009 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -5 predicate places. [2023-11-26 11:54:16,009 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 76 flow [2023-11-26 11:54:16,009 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 11:54:16,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:16,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:54:16,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 11:54:16,010 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 11:54:16,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:16,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1225204502, now seen corresponding path program 1 times [2023-11-26 11:54:16,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:16,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600795181] [2023-11-26 11:54:16,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:16,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:16,159 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 11:54:16,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:54:16,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600795181] [2023-11-26 11:54:16,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600795181] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:16,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:16,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:54:16,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217103174] [2023-11-26 11:54:16,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:16,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:54:16,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:54:16,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:54:16,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:54:16,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 43 [2023-11-26 11:54:16,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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 11:54:16,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:54:16,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 43 [2023-11-26 11:54:16,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:54:16,278 INFO L124 PetriNetUnfolderBase]: 129/357 cut-off events. [2023-11-26 11:54:16,279 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-26 11:54:16,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 357 events. 129/357 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1997 event pairs, 18 based on Foata normal form. 0/352 useless extension candidates. Maximal degree in co-relation 605. Up to 184 conditions per place. [2023-11-26 11:54:16,282 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 21 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2023-11-26 11:54:16,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 42 transitions, 144 flow [2023-11-26 11:54:16,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:54:16,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:54:16,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2023-11-26 11:54:16,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7364341085271318 [2023-11-26 11:54:16,284 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 95 transitions. [2023-11-26 11:54:16,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 95 transitions. [2023-11-26 11:54:16,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:16,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 95 transitions. [2023-11-26 11:54:16,285 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 11:54:16,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states 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 11:54:16,286 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states 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 11:54:16,286 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 76 flow. Second operand 3 states and 95 transitions. [2023-11-26 11:54:16,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 42 transitions, 144 flow [2023-11-26 11:54:16,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:54:16,288 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 72 flow [2023-11-26 11:54:16,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, 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=3, PETRI_FLOW=72, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2023-11-26 11:54:16,289 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -6 predicate places. [2023-11-26 11:54:16,289 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 72 flow [2023-11-26 11:54:16,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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 11:54:16,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:16,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:54:16,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 11:54:16,290 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 11:54:16,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:16,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1823280749, now seen corresponding path program 1 times [2023-11-26 11:54:16,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:16,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025079606] [2023-11-26 11:54:16,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:16,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:16,657 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 11:54:16,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:54:16,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025079606] [2023-11-26 11:54:16,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025079606] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:16,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:16,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:54:16,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885648597] [2023-11-26 11:54:16,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:16,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 11:54:16,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:54:16,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 11:54:16,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:54:16,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 43 [2023-11-26 11:54:16,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 72 flow. Second operand has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:54:16,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:54:16,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 43 [2023-11-26 11:54:16,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:54:16,986 INFO L124 PetriNetUnfolderBase]: 144/336 cut-off events. [2023-11-26 11:54:16,987 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-11-26 11:54:16,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 336 events. 144/336 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1767 event pairs, 39 based on Foata normal form. 15/344 useless extension candidates. Maximal degree in co-relation 614. Up to 135 conditions per place. [2023-11-26 11:54:16,990 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 22 selfloop transitions, 3 changer transitions 8/47 dead transitions. [2023-11-26 11:54:16,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 47 transitions, 170 flow [2023-11-26 11:54:16,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:54:16,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 11:54:16,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2023-11-26 11:54:16,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5968992248062015 [2023-11-26 11:54:16,992 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 154 transitions. [2023-11-26 11:54:16,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 154 transitions. [2023-11-26 11:54:16,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:16,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 154 transitions. [2023-11-26 11:54:16,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states 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 11:54:16,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 43.0) internal successors, (301), 7 states have internal predecessors, (301), 0 states have call successors, (0), 0 states 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 11:54:16,997 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 43.0) internal successors, (301), 7 states have internal predecessors, (301), 0 states have call successors, (0), 0 states 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 11:54:16,997 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 72 flow. Second operand 6 states and 154 transitions. [2023-11-26 11:54:16,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 47 transitions, 170 flow [2023-11-26 11:54:16,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 47 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:54:17,001 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 70 flow [2023-11-26 11:54:17,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2023-11-26 11:54:17,004 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -5 predicate places. [2023-11-26 11:54:17,005 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 70 flow [2023-11-26 11:54:17,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:54:17,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:17,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:54:17,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 11:54:17,006 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 11:54:17,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:17,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1823280605, now seen corresponding path program 1 times [2023-11-26 11:54:17,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:17,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563674933] [2023-11-26 11:54:17,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:17,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:17,182 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 11:54:17,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:54:17,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563674933] [2023-11-26 11:54:17,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563674933] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:17,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:17,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:54:17,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743674082] [2023-11-26 11:54:17,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:17,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:54:17,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:54:17,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:54:17,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:54:17,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 43 [2023-11-26 11:54:17,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 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 11:54:17,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:54:17,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 43 [2023-11-26 11:54:17,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:54:17,326 INFO L124 PetriNetUnfolderBase]: 161/370 cut-off events. [2023-11-26 11:54:17,326 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-26 11:54:17,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 370 events. 161/370 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1844 event pairs, 24 based on Foata normal form. 20/380 useless extension candidates. Maximal degree in co-relation 679. Up to 166 conditions per place. [2023-11-26 11:54:17,330 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 28 selfloop transitions, 4 changer transitions 1/46 dead transitions. [2023-11-26 11:54:17,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 46 transitions, 172 flow [2023-11-26 11:54:17,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:54:17,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 11:54:17,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2023-11-26 11:54:17,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6686046511627907 [2023-11-26 11:54:17,332 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 115 transitions. [2023-11-26 11:54:17,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 115 transitions. [2023-11-26 11:54:17,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:17,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 115 transitions. [2023-11-26 11:54:17,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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 11:54:17,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 0 states have call successors, (0), 0 states 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 11:54:17,335 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 0 states have call successors, (0), 0 states 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 11:54:17,335 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 70 flow. Second operand 4 states and 115 transitions. [2023-11-26 11:54:17,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 46 transitions, 172 flow [2023-11-26 11:54:17,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 46 transitions, 165 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-26 11:54:17,337 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 91 flow [2023-11-26 11:54:17,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=91, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2023-11-26 11:54:17,338 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -5 predicate places. [2023-11-26 11:54:17,339 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 91 flow [2023-11-26 11:54:17,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 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 11:54:17,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:17,339 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:54:17,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 11:54:17,340 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 11:54:17,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:17,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1514463620, now seen corresponding path program 1 times [2023-11-26 11:54:17,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:17,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233101413] [2023-11-26 11:54:17,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:17,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:17,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:17,556 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 11:54:17,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:54:17,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233101413] [2023-11-26 11:54:17,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233101413] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:17,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:17,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:54:17,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337810992] [2023-11-26 11:54:17,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:17,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:54:17,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:54:17,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:54:17,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:54:17,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 43 [2023-11-26 11:54:17,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 91 flow. Second operand has 5 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 11:54:17,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:54:17,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 43 [2023-11-26 11:54:17,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:54:17,687 INFO L124 PetriNetUnfolderBase]: 84/197 cut-off events. [2023-11-26 11:54:17,687 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2023-11-26 11:54:17,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 197 events. 84/197 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 652 event pairs, 16 based on Foata normal form. 14/203 useless extension candidates. Maximal degree in co-relation 441. Up to 71 conditions per place. [2023-11-26 11:54:17,689 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 24 selfloop transitions, 6 changer transitions 1/44 dead transitions. [2023-11-26 11:54:17,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 44 transitions, 182 flow [2023-11-26 11:54:17,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:54:17,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 11:54:17,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2023-11-26 11:54:17,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6186046511627907 [2023-11-26 11:54:17,691 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 133 transitions. [2023-11-26 11:54:17,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 133 transitions. [2023-11-26 11:54:17,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:17,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 133 transitions. [2023-11-26 11:54:17,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:54:17,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 0 states 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 11:54:17,694 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 0 states 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 11:54:17,694 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 91 flow. Second operand 5 states and 133 transitions. [2023-11-26 11:54:17,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 44 transitions, 182 flow [2023-11-26 11:54:17,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 173 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-26 11:54:17,697 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 107 flow [2023-11-26 11:54:17,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2023-11-26 11:54:17,698 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -1 predicate places. [2023-11-26 11:54:17,698 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 107 flow [2023-11-26 11:54:17,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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 11:54:17,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:17,699 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] [2023-11-26 11:54:17,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 11:54:17,700 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 11:54:17,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:17,700 INFO L85 PathProgramCache]: Analyzing trace with hash -599627540, now seen corresponding path program 1 times [2023-11-26 11:54:17,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:17,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104058497] [2023-11-26 11:54:17,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:17,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:18,013 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 11:54:18,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:54:18,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104058497] [2023-11-26 11:54:18,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104058497] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:18,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:18,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:54:18,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531529095] [2023-11-26 11:54:18,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:18,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:54:18,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:54:18,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:54:18,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:54:18,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 43 [2023-11-26 11:54:18,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 107 flow. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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 11:54:18,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:54:18,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 43 [2023-11-26 11:54:18,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:54:18,281 INFO L124 PetriNetUnfolderBase]: 116/287 cut-off events. [2023-11-26 11:54:18,281 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2023-11-26 11:54:18,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 648 conditions, 287 events. 116/287 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1133 event pairs, 29 based on Foata normal form. 4/283 useless extension candidates. Maximal degree in co-relation 633. Up to 127 conditions per place. [2023-11-26 11:54:18,284 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 25 selfloop transitions, 7 changer transitions 13/59 dead transitions. [2023-11-26 11:54:18,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 59 transitions, 263 flow [2023-11-26 11:54:18,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:54:18,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-26 11:54:18,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 179 transitions. [2023-11-26 11:54:18,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5946843853820598 [2023-11-26 11:54:18,287 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 179 transitions. [2023-11-26 11:54:18,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 179 transitions. [2023-11-26 11:54:18,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:18,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 179 transitions. [2023-11-26 11:54:18,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 0 states have call successors, (0), 0 states 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 11:54:18,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 43.0) internal successors, (344), 8 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:54:18,290 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 43.0) internal successors, (344), 8 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:54:18,290 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 107 flow. Second operand 7 states and 179 transitions. [2023-11-26 11:54:18,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 59 transitions, 263 flow [2023-11-26 11:54:18,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 59 transitions, 229 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-11-26 11:54:18,298 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 120 flow [2023-11-26 11:54:18,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=120, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2023-11-26 11:54:18,300 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 3 predicate places. [2023-11-26 11:54:18,300 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 120 flow [2023-11-26 11:54:18,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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 11:54:18,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:18,301 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] [2023-11-26 11:54:18,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 11:54:18,301 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 11:54:18,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:18,302 INFO L85 PathProgramCache]: Analyzing trace with hash -2044223792, now seen corresponding path program 2 times [2023-11-26 11:54:18,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:18,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217890337] [2023-11-26 11:54:18,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:18,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:18,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:19,014 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 11:54:19,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:54:19,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217890337] [2023-11-26 11:54:19,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217890337] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:19,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:19,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-26 11:54:19,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859197761] [2023-11-26 11:54:19,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:19,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 11:54:19,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:54:19,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 11:54:19,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-26 11:54:19,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 43 [2023-11-26 11:54:19,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 120 flow. Second operand has 9 states, 9 states have (on average 21.666666666666668) internal successors, (195), 9 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:54:19,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:54:19,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 43 [2023-11-26 11:54:19,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:54:19,399 INFO L124 PetriNetUnfolderBase]: 143/379 cut-off events. [2023-11-26 11:54:19,399 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2023-11-26 11:54:19,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 839 conditions, 379 events. 143/379 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1738 event pairs, 59 based on Foata normal form. 4/369 useless extension candidates. Maximal degree in co-relation 823. Up to 157 conditions per place. [2023-11-26 11:54:19,402 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 21 selfloop transitions, 7 changer transitions 24/68 dead transitions. [2023-11-26 11:54:19,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 68 transitions, 330 flow [2023-11-26 11:54:19,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 11:54:19,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-26 11:54:19,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 228 transitions. [2023-11-26 11:54:19,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5891472868217055 [2023-11-26 11:54:19,405 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 228 transitions. [2023-11-26 11:54:19,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 228 transitions. [2023-11-26 11:54:19,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:19,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 228 transitions. [2023-11-26 11:54:19,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 25.333333333333332) internal successors, (228), 9 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:54:19,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 43.0) internal successors, (430), 10 states have internal predecessors, (430), 0 states have call successors, (0), 0 states 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 11:54:19,408 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 43.0) internal successors, (430), 10 states have internal predecessors, (430), 0 states have call successors, (0), 0 states 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 11:54:19,408 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 120 flow. Second operand 9 states and 228 transitions. [2023-11-26 11:54:19,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 68 transitions, 330 flow [2023-11-26 11:54:19,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 324 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-26 11:54:19,412 INFO L231 Difference]: Finished difference. Result has 59 places, 41 transitions, 180 flow [2023-11-26 11:54:19,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=180, PETRI_PLACES=59, PETRI_TRANSITIONS=41} [2023-11-26 11:54:19,413 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 13 predicate places. [2023-11-26 11:54:19,413 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 41 transitions, 180 flow [2023-11-26 11:54:19,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 21.666666666666668) internal successors, (195), 9 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:54:19,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:19,413 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] [2023-11-26 11:54:19,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 11:54:19,414 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 11:54:19,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:19,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1089828730, now seen corresponding path program 3 times [2023-11-26 11:54:19,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:19,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780583102] [2023-11-26 11:54:19,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:19,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:19,702 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 11:54:19,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:54:19,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780583102] [2023-11-26 11:54:19,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780583102] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:19,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:19,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 11:54:19,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091295430] [2023-11-26 11:54:19,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:19,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 11:54:19,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:54:19,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 11:54:19,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:54:19,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 43 [2023-11-26 11:54:19,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 41 transitions, 180 flow. Second operand has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 0 states 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 11:54:19,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:54:19,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 43 [2023-11-26 11:54:19,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:54:19,979 INFO L124 PetriNetUnfolderBase]: 128/352 cut-off events. [2023-11-26 11:54:19,979 INFO L125 PetriNetUnfolderBase]: For 204/204 co-relation queries the response was YES. [2023-11-26 11:54:19,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 882 conditions, 352 events. 128/352 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1565 event pairs, 43 based on Foata normal form. 4/344 useless extension candidates. Maximal degree in co-relation 860. Up to 122 conditions per place. [2023-11-26 11:54:19,983 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 21 selfloop transitions, 4 changer transitions 27/66 dead transitions. [2023-11-26 11:54:19,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 66 transitions, 372 flow [2023-11-26 11:54:19,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 11:54:19,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-26 11:54:19,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 199 transitions. [2023-11-26 11:54:19,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5784883720930233 [2023-11-26 11:54:19,985 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 199 transitions. [2023-11-26 11:54:19,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 199 transitions. [2023-11-26 11:54:19,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:19,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 199 transitions. [2023-11-26 11:54:19,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 24.875) internal successors, (199), 8 states have internal predecessors, (199), 0 states have call successors, (0), 0 states 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 11:54:19,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 43.0) internal successors, (387), 9 states have internal predecessors, (387), 0 states have call successors, (0), 0 states 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 11:54:19,989 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 43.0) internal successors, (387), 9 states have internal predecessors, (387), 0 states have call successors, (0), 0 states 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 11:54:19,989 INFO L175 Difference]: Start difference. First operand has 59 places, 41 transitions, 180 flow. Second operand 8 states and 199 transitions. [2023-11-26 11:54:19,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 66 transitions, 372 flow [2023-11-26 11:54:19,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 66 transitions, 348 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-11-26 11:54:19,995 INFO L231 Difference]: Finished difference. Result has 60 places, 36 transitions, 141 flow [2023-11-26 11:54:19,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=141, PETRI_PLACES=60, PETRI_TRANSITIONS=36} [2023-11-26 11:54:19,997 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 14 predicate places. [2023-11-26 11:54:19,997 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 36 transitions, 141 flow [2023-11-26 11:54:19,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 0 states 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 11:54:19,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:19,997 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] [2023-11-26 11:54:19,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 11:54:19,999 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 11:54:20,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:20,000 INFO L85 PathProgramCache]: Analyzing trace with hash 588456828, now seen corresponding path program 4 times [2023-11-26 11:54:20,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:20,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408544043] [2023-11-26 11:54:20,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:20,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:54:20,059 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:54:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:54:20,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:54:20,145 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 11:54:20,147 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-26 11:54:20,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-26 11:54:20,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-26 11:54:20,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-26 11:54:20,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-26 11:54:20,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-26 11:54:20,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-26 11:54:20,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-26 11:54:20,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-26 11:54:20,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-26 11:54:20,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 11:54:20,152 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:54:20,158 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-26 11:54:20,158 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 11:54:20,231 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-26 11:54:20,233 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 11:54:20,256 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-26 11:54:20,261 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-26 11:54:20,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 11:54:20 BasicIcfg [2023-11-26 11:54:20,280 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 11:54:20,281 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 11:54:20,281 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 11:54:20,281 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 11:54:20,282 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:54:13" (3/4) ... [2023-11-26 11:54:20,284 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 11:54:20,285 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 11:54:20,286 INFO L158 Benchmark]: Toolchain (without parser) took 8111.87ms. Allocated memory was 155.2MB in the beginning and 203.4MB in the end (delta: 48.2MB). Free memory was 108.5MB in the beginning and 121.2MB in the end (delta: -12.7MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. [2023-11-26 11:54:20,286 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 121.6MB. Free memory is still 65.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:54:20,287 INFO L158 Benchmark]: CACSL2BoogieTranslator took 724.61ms. Allocated memory is still 155.2MB. Free memory was 108.5MB in the beginning and 85.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-26 11:54:20,289 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.62ms. Allocated memory is still 155.2MB. Free memory was 85.4MB in the beginning and 123.2MB in the end (delta: -37.8MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2023-11-26 11:54:20,290 INFO L158 Benchmark]: Boogie Preprocessor took 68.57ms. Allocated memory is still 155.2MB. Free memory was 123.2MB in the beginning and 120.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 11:54:20,290 INFO L158 Benchmark]: RCFGBuilder took 836.05ms. Allocated memory is still 155.2MB. Free memory was 120.3MB in the beginning and 78.3MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2023-11-26 11:54:20,291 INFO L158 Benchmark]: TraceAbstraction took 6375.11ms. Allocated memory was 155.2MB in the beginning and 203.4MB in the end (delta: 48.2MB). Free memory was 77.4MB in the beginning and 122.3MB in the end (delta: -44.8MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. [2023-11-26 11:54:20,291 INFO L158 Benchmark]: Witness Printer took 4.46ms. Allocated memory is still 203.4MB. Free memory was 122.3MB in the beginning and 121.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:54:20,293 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.30ms. Allocated memory is still 121.6MB. Free memory is still 65.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 724.61ms. Allocated memory is still 155.2MB. Free memory was 108.5MB in the beginning and 85.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.62ms. Allocated memory is still 155.2MB. Free memory was 85.4MB in the beginning and 123.2MB in the end (delta: -37.8MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.57ms. Allocated memory is still 155.2MB. Free memory was 123.2MB in the beginning and 120.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 836.05ms. Allocated memory is still 155.2MB. Free memory was 120.3MB in the beginning and 78.3MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6375.11ms. Allocated memory was 155.2MB in the beginning and 203.4MB in the end (delta: 48.2MB). Free memory was 77.4MB in the beginning and 122.3MB in the end (delta: -44.8MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. * Witness Printer took 4.46ms. Allocated memory is still 203.4MB. Free memory was 122.3MB in the beginning and 121.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L813] 0 pthread_t t903; [L814] FCALL, FORK 0 pthread_create(&t903, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t903={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L815] 0 pthread_t t904; [L816] FCALL, FORK 0 pthread_create(&t904, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t903={5:0}, t904={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 1 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L782] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L788] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 x$flush_delayed = weak$$choice2 [L749] 1 x$mem_tmp = x [L750] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = x [L758] 1 x = x$flush_delayed ? x$mem_tmp : x [L759] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t903={5:0}, t904={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L823] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L824] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L825] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L826] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t903={5:0}, t904={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L829] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t903={5:0}, t904={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L831] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L18] 0 __assert_fail ("0", "mix034_pso.opt_tso.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: 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: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 814]: 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, 61 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.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 363 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 298 mSDsluCounter, 125 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 101 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1001 IncrementalHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 24 mSDtfsCounter, 1001 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=10, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 142 ConstructedInterpolants, 0 QuantifiedInterpolants, 859 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 11:54:20,336 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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_250f2167-dad3-4327-9309-4407e4bd30b8/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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_250f2167-dad3-4327-9309-4407e4bd30b8/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix034_pso.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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_250f2167-dad3-4327-9309-4407e4bd30b8/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 0d984378a3d93078f60e6a73f83b588890817628b7e21c558fe1824f195f48ce --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:54:23,127 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:54:23,261 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-26 11:54:23,267 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:54:23,268 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:54:23,296 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:54:23,297 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:54:23,297 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:54:23,298 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:54:23,304 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:54:23,304 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:54:23,305 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:54:23,305 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:54:23,307 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:54:23,308 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:54:23,308 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:54:23,309 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:54:23,309 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:54:23,310 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:54:23,311 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:54:23,311 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-26 11:54:23,312 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-26 11:54:23,312 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-26 11:54:23,313 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:54:23,313 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 11:54:23,314 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-26 11:54:23,314 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-26 11:54:23,314 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 11:54:23,315 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:54:23,315 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:54:23,317 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:54:23,318 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:54:23,318 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:54:23,318 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:54:23,319 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:54:23,319 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:54:23,320 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:54:23,320 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-26 11:54:23,321 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-26 11:54:23,321 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:54:23,322 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:54:23,322 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:54:23,322 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:54:23,323 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-26 11:54:23,323 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_250f2167-dad3-4327-9309-4407e4bd30b8/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_250f2167-dad3-4327-9309-4407e4bd30b8/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 -> 0d984378a3d93078f60e6a73f83b588890817628b7e21c558fe1824f195f48ce [2023-11-26 11:54:23,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:54:23,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:54:23,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:54:23,762 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:54:23,763 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:54:23,765 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-wmm/mix034_pso.opt_tso.opt.i [2023-11-26 11:54:27,128 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:54:27,487 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:54:27,488 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/sv-benchmarks/c/pthread-wmm/mix034_pso.opt_tso.opt.i [2023-11-26 11:54:27,515 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/bin/uautomizer-verify-VRDe98Ueme/data/c23397f3f/c2cb949df9ec432abe7c68bc1f040c81/FLAGc2a9b6609 [2023-11-26 11:54:27,535 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/bin/uautomizer-verify-VRDe98Ueme/data/c23397f3f/c2cb949df9ec432abe7c68bc1f040c81 [2023-11-26 11:54:27,541 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:54:27,543 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:54:27,549 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:54:27,549 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:54:27,554 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:54:27,555 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:54:27" (1/1) ... [2023-11-26 11:54:27,557 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c2c2893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:27, skipping insertion in model container [2023-11-26 11:54:27,557 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:54:27" (1/1) ... [2023-11-26 11:54:27,637 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:54:28,124 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:54:28,151 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:54:28,290 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:54:28,347 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 11:54:28,347 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 11:54:28,356 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:54:28,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:28 WrapperNode [2023-11-26 11:54:28,357 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:54:28,359 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:54:28,359 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:54:28,360 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:54:28,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:28" (1/1) ... [2023-11-26 11:54:28,395 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:28" (1/1) ... [2023-11-26 11:54:28,430 INFO L138 Inliner]: procedures = 178, calls = 46, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 127 [2023-11-26 11:54:28,431 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:54:28,432 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:54:28,432 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:54:28,432 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:54:28,447 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:28" (1/1) ... [2023-11-26 11:54:28,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:28" (1/1) ... [2023-11-26 11:54:28,453 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:28" (1/1) ... [2023-11-26 11:54:28,475 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 11:54:28,475 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:28" (1/1) ... [2023-11-26 11:54:28,476 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:28" (1/1) ... [2023-11-26 11:54:28,492 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:28" (1/1) ... [2023-11-26 11:54:28,495 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:28" (1/1) ... [2023-11-26 11:54:28,499 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:28" (1/1) ... [2023-11-26 11:54:28,502 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:28" (1/1) ... [2023-11-26 11:54:28,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:54:28,510 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:54:28,510 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:54:28,510 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:54:28,511 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:28" (1/1) ... [2023-11-26 11:54:28,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:54:28,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:54:28,558 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:54:28,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:54:28,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 11:54:28,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:54:28,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 11:54:28,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 11:54:28,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-26 11:54:28,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-26 11:54:28,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-26 11:54:28,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-26 11:54:28,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-26 11:54:28,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-26 11:54:28,610 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-26 11:54:28,610 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-26 11:54:28,611 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-26 11:54:28,611 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-26 11:54:28,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 11:54:28,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:54:28,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:54:28,617 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 11:54:28,833 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:54:28,836 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:54:29,190 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:54:29,453 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:54:29,454 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 11:54:29,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:54:29 BoogieIcfgContainer [2023-11-26 11:54:29,456 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:54:29,459 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:54:29,459 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:54:29,464 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:54:29,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:54:27" (1/3) ... [2023-11-26 11:54:29,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4805dbeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:54:29, skipping insertion in model container [2023-11-26 11:54:29,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:28" (2/3) ... [2023-11-26 11:54:29,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4805dbeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:54:29, skipping insertion in model container [2023-11-26 11:54:29,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:54:29" (3/3) ... [2023-11-26 11:54:29,469 INFO L112 eAbstractionObserver]: Analyzing ICFG mix034_pso.opt_tso.opt.i [2023-11-26 11:54:29,492 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:54:29,492 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-26 11:54:29,493 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 11:54:29,615 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 11:54:29,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 43 transitions, 94 flow [2023-11-26 11:54:29,714 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2023-11-26 11:54:29,714 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:54:29,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2023-11-26 11:54:29,722 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 43 transitions, 94 flow [2023-11-26 11:54:29,730 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 41 transitions, 88 flow [2023-11-26 11:54:29,751 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:54:29,761 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;@3df64fbf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:54:29,761 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-26 11:54:29,767 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 11:54:29,768 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-26 11:54:29,768 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:54:29,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:29,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 11:54:29,770 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 11:54:29,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:29,781 INFO L85 PathProgramCache]: Analyzing trace with hash 11560, now seen corresponding path program 1 times [2023-11-26 11:54:29,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:54:29,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1537024299] [2023-11-26 11:54:29,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:29,800 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 11:54:29,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:54:29,809 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:29,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:29,969 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 11:54:29,975 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:54:30,057 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 11:54:30,073 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 11:54:30,074 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:54:30,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:54:30,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1537024299] [2023-11-26 11:54:30,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1537024299] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:30,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:30,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:54:30,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514943279] [2023-11-26 11:54:30,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:30,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:54:30,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:54:30,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:54:30,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:54:30,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2023-11-26 11:54:30,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 11:54:30,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:54:30,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2023-11-26 11:54:30,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:54:30,461 INFO L124 PetriNetUnfolderBase]: 166/413 cut-off events. [2023-11-26 11:54:30,461 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-26 11:54:30,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 413 events. 166/413 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2449 event pairs, 122 based on Foata normal form. 30/399 useless extension candidates. Maximal degree in co-relation 706. Up to 220 conditions per place. [2023-11-26 11:54:30,471 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 22 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-11-26 11:54:30,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 43 transitions, 140 flow [2023-11-26 11:54:30,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:54:30,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:54:30,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2023-11-26 11:54:30,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6976744186046512 [2023-11-26 11:54:30,488 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 90 transitions. [2023-11-26 11:54:30,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 90 transitions. [2023-11-26 11:54:30,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:30,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 90 transitions. [2023-11-26 11:54:30,497 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 11:54:30,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states 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 11:54:30,502 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states 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 11:54:30,504 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 88 flow. Second operand 3 states and 90 transitions. [2023-11-26 11:54:30,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 43 transitions, 140 flow [2023-11-26 11:54:30,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:54:30,512 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 82 flow [2023-11-26 11:54:30,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, 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 11:54:30,519 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2023-11-26 11:54:30,519 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 82 flow [2023-11-26 11:54:30,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 11:54:30,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:30,520 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 11:54:30,533 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:30,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:30,724 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 11:54:30,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:30,725 INFO L85 PathProgramCache]: Analyzing trace with hash 11561, now seen corresponding path program 1 times [2023-11-26 11:54:30,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:54:30,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [604858666] [2023-11-26 11:54:30,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:30,727 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 11:54:30,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:54:30,728 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:30,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:30,854 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 11:54:30,856 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:54:30,873 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 11:54:30,913 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 11:54:30,914 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:54:30,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:54:30,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [604858666] [2023-11-26 11:54:30,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [604858666] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:30,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:30,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:54:30,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8665054] [2023-11-26 11:54:30,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:30,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:54:30,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:54:30,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:54:30,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:54:30,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 43 [2023-11-26 11:54:30,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 82 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 11:54:30,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:54:30,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 43 [2023-11-26 11:54:30,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:54:31,216 INFO L124 PetriNetUnfolderBase]: 166/412 cut-off events. [2023-11-26 11:54:31,216 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-26 11:54:31,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 732 conditions, 412 events. 166/412 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2427 event pairs, 122 based on Foata normal form. 1/369 useless extension candidates. Maximal degree in co-relation 721. Up to 219 conditions per place. [2023-11-26 11:54:31,223 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 21 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-11-26 11:54:31,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 42 transitions, 138 flow [2023-11-26 11:54:31,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:54:31,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:54:31,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2023-11-26 11:54:31,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6976744186046512 [2023-11-26 11:54:31,232 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 90 transitions. [2023-11-26 11:54:31,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 90 transitions. [2023-11-26 11:54:31,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:31,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 90 transitions. [2023-11-26 11:54:31,234 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 11:54:31,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states 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 11:54:31,238 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states 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 11:54:31,240 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 82 flow. Second operand 3 states and 90 transitions. [2023-11-26 11:54:31,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 42 transitions, 138 flow [2023-11-26 11:54:31,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 42 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:54:31,245 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 80 flow [2023-11-26 11:54:31,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, 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 11:54:31,248 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2023-11-26 11:54:31,248 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 80 flow [2023-11-26 11:54:31,249 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 11:54:31,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:31,249 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 11:54:31,257 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:31,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:31,452 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 11:54:31,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:31,452 INFO L85 PathProgramCache]: Analyzing trace with hash 344703639, now seen corresponding path program 1 times [2023-11-26 11:54:31,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:54:31,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1522187341] [2023-11-26 11:54:31,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:31,454 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 11:54:31,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:54:31,456 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:31,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:31,593 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 11:54:31,596 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:54:31,605 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 11:54:31,616 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 11:54:31,617 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:54:31,617 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:54:31,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1522187341] [2023-11-26 11:54:31,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1522187341] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:31,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:31,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:54:31,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416991317] [2023-11-26 11:54:31,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:31,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:54:31,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:54:31,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:54:31,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:54:31,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2023-11-26 11:54:31,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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 11:54:31,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:54:31,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2023-11-26 11:54:31,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:54:31,839 INFO L124 PetriNetUnfolderBase]: 168/411 cut-off events. [2023-11-26 11:54:31,840 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-26 11:54:31,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 736 conditions, 411 events. 168/411 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2430 event pairs, 80 based on Foata normal form. 0/374 useless extension candidates. Maximal degree in co-relation 725. Up to 220 conditions per place. [2023-11-26 11:54:31,846 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 22 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-11-26 11:54:31,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 41 transitions, 138 flow [2023-11-26 11:54:31,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:54:31,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:54:31,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2023-11-26 11:54:31,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6821705426356589 [2023-11-26 11:54:31,855 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 88 transitions. [2023-11-26 11:54:31,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 88 transitions. [2023-11-26 11:54:31,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:31,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 88 transitions. [2023-11-26 11:54:31,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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 11:54:31,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states 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 11:54:31,858 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states 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 11:54:31,858 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 80 flow. Second operand 3 states and 88 transitions. [2023-11-26 11:54:31,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 41 transitions, 138 flow [2023-11-26 11:54:31,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 41 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:54:31,864 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 78 flow [2023-11-26 11:54:31,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, 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 11:54:31,867 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -4 predicate places. [2023-11-26 11:54:31,867 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 78 flow [2023-11-26 11:54:31,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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 11:54:31,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:31,868 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 11:54:31,876 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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)] Ended with exit code 0 [2023-11-26 11:54:32,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:32,071 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 11:54:32,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:32,072 INFO L85 PathProgramCache]: Analyzing trace with hash 344703640, now seen corresponding path program 1 times [2023-11-26 11:54:32,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:54:32,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2145834435] [2023-11-26 11:54:32,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:32,073 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 11:54:32,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:54:32,075 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:32,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:32,166 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 11:54:32,167 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:54:32,178 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 11:54:32,190 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 11:54:32,191 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:54:32,191 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:54:32,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2145834435] [2023-11-26 11:54:32,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2145834435] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:32,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:32,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:54:32,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494465212] [2023-11-26 11:54:32,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:32,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:54:32,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:54:32,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:54:32,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:54:32,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 43 [2023-11-26 11:54:32,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 78 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 11:54:32,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:54:32,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 43 [2023-11-26 11:54:32,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:54:32,374 INFO L124 PetriNetUnfolderBase]: 166/401 cut-off events. [2023-11-26 11:54:32,375 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-26 11:54:32,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 723 conditions, 401 events. 166/401 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2271 event pairs, 125 based on Foata normal form. 3/370 useless extension candidates. Maximal degree in co-relation 713. Up to 215 conditions per place. [2023-11-26 11:54:32,379 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 21 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2023-11-26 11:54:32,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 40 transitions, 134 flow [2023-11-26 11:54:32,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:54:32,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:54:32,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2023-11-26 11:54:32,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6976744186046512 [2023-11-26 11:54:32,382 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 90 transitions. [2023-11-26 11:54:32,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 90 transitions. [2023-11-26 11:54:32,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:32,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 90 transitions. [2023-11-26 11:54:32,388 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 11:54:32,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states 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 11:54:32,391 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states 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 11:54:32,393 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 78 flow. Second operand 3 states and 90 transitions. [2023-11-26 11:54:32,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 40 transitions, 134 flow [2023-11-26 11:54:32,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 40 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:54:32,404 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 76 flow [2023-11-26 11:54:32,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, 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 11:54:32,406 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -5 predicate places. [2023-11-26 11:54:32,407 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 76 flow [2023-11-26 11:54:32,408 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 11:54:32,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:32,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:54:32,417 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:32,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:32,611 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 11:54:32,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:32,611 INFO L85 PathProgramCache]: Analyzing trace with hash -200376854, now seen corresponding path program 1 times [2023-11-26 11:54:32,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:54:32,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [26107651] [2023-11-26 11:54:32,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:32,612 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 11:54:32,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:54:32,615 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:32,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:32,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:32,715 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-26 11:54:32,717 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:54:32,738 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 11:54:32,738 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:54:32,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:54:32,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [26107651] [2023-11-26 11:54:32,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [26107651] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:32,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:32,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:54:32,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500493259] [2023-11-26 11:54:32,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:32,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:54:32,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:54:32,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:54:32,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:54:32,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 43 [2023-11-26 11:54:32,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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 11:54:32,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:54:32,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 43 [2023-11-26 11:54:32,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:54:32,865 INFO L124 PetriNetUnfolderBase]: 129/357 cut-off events. [2023-11-26 11:54:32,866 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-26 11:54:32,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 357 events. 129/357 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2007 event pairs, 18 based on Foata normal form. 0/352 useless extension candidates. Maximal degree in co-relation 605. Up to 184 conditions per place. [2023-11-26 11:54:32,871 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 21 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2023-11-26 11:54:32,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 42 transitions, 144 flow [2023-11-26 11:54:32,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:54:32,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:54:32,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2023-11-26 11:54:32,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7364341085271318 [2023-11-26 11:54:32,875 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 95 transitions. [2023-11-26 11:54:32,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 95 transitions. [2023-11-26 11:54:32,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:32,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 95 transitions. [2023-11-26 11:54:32,878 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 11:54:32,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states 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 11:54:32,879 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states 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 11:54:32,879 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 76 flow. Second operand 3 states and 95 transitions. [2023-11-26 11:54:32,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 42 transitions, 144 flow [2023-11-26 11:54:32,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:54:32,881 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 72 flow [2023-11-26 11:54:32,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, 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=3, PETRI_FLOW=72, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2023-11-26 11:54:32,884 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -6 predicate places. [2023-11-26 11:54:32,885 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 72 flow [2023-11-26 11:54:32,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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 11:54:32,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:32,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:54:32,894 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:33,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:33,089 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 11:54:33,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:33,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1216582831, now seen corresponding path program 1 times [2023-11-26 11:54:33,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:54:33,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1634032186] [2023-11-26 11:54:33,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:33,090 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 11:54:33,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:54:33,095 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:33,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:33,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:33,209 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 11:54:33,211 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:54:33,254 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 11:54:33,254 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:54:33,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:54:33,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1634032186] [2023-11-26 11:54:33,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1634032186] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:33,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:33,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:54:33,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729950659] [2023-11-26 11:54:33,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:33,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:54:33,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:54:33,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:54:33,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:54:33,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 43 [2023-11-26 11:54:33,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 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 11:54:33,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:54:33,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 43 [2023-11-26 11:54:33,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:54:33,436 INFO L124 PetriNetUnfolderBase]: 180/417 cut-off events. [2023-11-26 11:54:33,436 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-11-26 11:54:33,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 788 conditions, 417 events. 180/417 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2173 event pairs, 24 based on Foata normal form. 20/427 useless extension candidates. Maximal degree in co-relation 777. Up to 199 conditions per place. [2023-11-26 11:54:33,440 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 29 selfloop transitions, 4 changer transitions 1/48 dead transitions. [2023-11-26 11:54:33,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 178 flow [2023-11-26 11:54:33,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:54:33,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 11:54:33,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2023-11-26 11:54:33,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6744186046511628 [2023-11-26 11:54:33,442 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 116 transitions. [2023-11-26 11:54:33,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 116 transitions. [2023-11-26 11:54:33,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:33,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 116 transitions. [2023-11-26 11:54:33,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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 11:54:33,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 0 states have call successors, (0), 0 states 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 11:54:33,445 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 0 states have call successors, (0), 0 states 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 11:54:33,454 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 72 flow. Second operand 4 states and 116 transitions. [2023-11-26 11:54:33,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 178 flow [2023-11-26 11:54:33,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:54:33,457 INFO L231 Difference]: Finished difference. Result has 42 places, 34 transitions, 94 flow [2023-11-26 11:54:33,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, 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=94, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2023-11-26 11:54:33,458 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -4 predicate places. [2023-11-26 11:54:33,458 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 94 flow [2023-11-26 11:54:33,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 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 11:54:33,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:33,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:54:33,466 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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)] Forceful destruction successful, exit code 0 [2023-11-26 11:54:33,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:33,662 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 11:54:33,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:33,662 INFO L85 PathProgramCache]: Analyzing trace with hash -641379956, now seen corresponding path program 1 times [2023-11-26 11:54:33,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:54:33,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1264971173] [2023-11-26 11:54:33,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:33,663 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 11:54:33,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:54:33,665 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:33,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:33,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 11:54:33,792 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:54:33,838 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 11:54:33,838 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:54:33,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:54:33,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1264971173] [2023-11-26 11:54:33,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1264971173] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:33,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:33,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:54:33,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860677655] [2023-11-26 11:54:33,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:33,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:54:33,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:54:33,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:54:33,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:54:33,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 43 [2023-11-26 11:54:33,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 94 flow. Second operand has 5 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 11:54:33,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:54:33,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 43 [2023-11-26 11:54:33,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:54:34,020 INFO L124 PetriNetUnfolderBase]: 88/209 cut-off events. [2023-11-26 11:54:34,021 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2023-11-26 11:54:34,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 209 events. 88/209 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 719 event pairs, 16 based on Foata normal form. 14/215 useless extension candidates. Maximal degree in co-relation 459. Up to 71 conditions per place. [2023-11-26 11:54:34,023 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 25 selfloop transitions, 6 changer transitions 1/46 dead transitions. [2023-11-26 11:54:34,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 46 transitions, 187 flow [2023-11-26 11:54:34,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:54:34,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 11:54:34,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2023-11-26 11:54:34,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6232558139534884 [2023-11-26 11:54:34,026 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 134 transitions. [2023-11-26 11:54:34,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 134 transitions. [2023-11-26 11:54:34,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:34,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 134 transitions. [2023-11-26 11:54:34,027 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 11:54:34,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 0 states 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 11:54:34,029 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 0 states 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 11:54:34,029 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 94 flow. Second operand 5 states and 134 transitions. [2023-11-26 11:54:34,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 46 transitions, 187 flow [2023-11-26 11:54:34,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 178 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-26 11:54:34,033 INFO L231 Difference]: Finished difference. Result has 46 places, 34 transitions, 110 flow [2023-11-26 11:54:34,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=40, 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=110, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2023-11-26 11:54:34,034 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 0 predicate places. [2023-11-26 11:54:34,035 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 34 transitions, 110 flow [2023-11-26 11:54:34,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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 11:54:34,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:34,035 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] [2023-11-26 11:54:34,049 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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)] Forceful destruction successful, exit code 0 [2023-11-26 11:54:34,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:34,239 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 11:54:34,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:34,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1535838730, now seen corresponding path program 1 times [2023-11-26 11:54:34,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:54:34,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1377365493] [2023-11-26 11:54:34,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:34,240 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 11:54:34,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:54:34,242 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:34,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:34,401 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-26 11:54:34,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:54:34,765 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t904~0#1.base_47| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t903~0#1.base_51| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t903~0#1.base_51| (_ bv1 1)) |v_ULTIMATE.start_main_~#t904~0#1.base_47|)) (= (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t903~0#1.base_51| (_ bv0 1)) |v_ULTIMATE.start_main_~#t904~0#1.base_47| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t903~0#1.base_51|)))) is different from true [2023-11-26 11:54:34,766 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 11:54:34,766 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:54:34,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:54:34,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1377365493] [2023-11-26 11:54:34,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1377365493] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:34,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:34,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:54:34,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147382388] [2023-11-26 11:54:34,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:34,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:54:34,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:54:34,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:54:34,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-11-26 11:54:34,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 43 [2023-11-26 11:54:34,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 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 11:54:34,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:54:34,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 43 [2023-11-26 11:54:34,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:54:34,891 INFO L124 PetriNetUnfolderBase]: 52/155 cut-off events. [2023-11-26 11:54:34,891 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2023-11-26 11:54:34,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323 conditions, 155 events. 52/155 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 519 event pairs, 18 based on Foata normal form. 4/148 useless extension candidates. Maximal degree in co-relation 307. Up to 94 conditions per place. [2023-11-26 11:54:34,893 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 19 selfloop transitions, 5 changer transitions 0/40 dead transitions. [2023-11-26 11:54:34,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 40 transitions, 170 flow [2023-11-26 11:54:34,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:54:34,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 11:54:34,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2023-11-26 11:54:34,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4883720930232558 [2023-11-26 11:54:34,895 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 105 transitions. [2023-11-26 11:54:34,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 105 transitions. [2023-11-26 11:54:34,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:34,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 105 transitions. [2023-11-26 11:54:34,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:54:34,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 0 states 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 11:54:34,897 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 0 states 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 11:54:34,897 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 110 flow. Second operand 5 states and 105 transitions. [2023-11-26 11:54:34,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 40 transitions, 170 flow [2023-11-26 11:54:34,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 40 transitions, 142 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-11-26 11:54:34,900 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 105 flow [2023-11-26 11:54:34,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=105, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2023-11-26 11:54:34,901 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -1 predicate places. [2023-11-26 11:54:34,901 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 105 flow [2023-11-26 11:54:34,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 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 11:54:34,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:34,902 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] [2023-11-26 11:54:34,910 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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)] Ended with exit code 0 [2023-11-26 11:54:35,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:35,105 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 11:54:35,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:35,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1863807196, now seen corresponding path program 1 times [2023-11-26 11:54:35,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:54:35,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1472641250] [2023-11-26 11:54:35,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:35,107 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 11:54:35,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:54:35,108 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:35,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:35,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:35,254 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-26 11:54:35,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:54:35,339 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 11:54:35,339 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:54:35,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:54:35,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1472641250] [2023-11-26 11:54:35,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1472641250] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:35,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:35,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:54:35,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192146373] [2023-11-26 11:54:35,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:35,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:54:35,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:54:35,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:54:35,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:54:35,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 43 [2023-11-26 11:54:35,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 105 flow. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states 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 11:54:35,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:54:35,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 43 [2023-11-26 11:54:35,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:54:35,599 INFO L124 PetriNetUnfolderBase]: 118/304 cut-off events. [2023-11-26 11:54:35,600 INFO L125 PetriNetUnfolderBase]: For 96/100 co-relation queries the response was YES. [2023-11-26 11:54:35,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 695 conditions, 304 events. 118/304 cut-off events. For 96/100 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1229 event pairs, 32 based on Foata normal form. 4/300 useless extension candidates. Maximal degree in co-relation 682. Up to 130 conditions per place. [2023-11-26 11:54:35,602 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 38 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2023-11-26 11:54:35,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 59 transitions, 264 flow [2023-11-26 11:54:35,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:54:35,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 11:54:35,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 160 transitions. [2023-11-26 11:54:35,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6201550387596899 [2023-11-26 11:54:35,604 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 160 transitions. [2023-11-26 11:54:35,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 160 transitions. [2023-11-26 11:54:35,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:35,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 160 transitions. [2023-11-26 11:54:35,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states 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 11:54:35,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 43.0) internal successors, (301), 7 states have internal predecessors, (301), 0 states have call successors, (0), 0 states 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 11:54:35,607 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 43.0) internal successors, (301), 7 states have internal predecessors, (301), 0 states have call successors, (0), 0 states 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 11:54:35,607 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 105 flow. Second operand 6 states and 160 transitions. [2023-11-26 11:54:35,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 59 transitions, 264 flow [2023-11-26 11:54:35,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 59 transitions, 252 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-26 11:54:35,610 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 137 flow [2023-11-26 11:54:35,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=137, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2023-11-26 11:54:35,612 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 5 predicate places. [2023-11-26 11:54:35,612 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 137 flow [2023-11-26 11:54:35,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states 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 11:54:35,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:35,612 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] [2023-11-26 11:54:35,622 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:35,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:35,816 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 11:54:35,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:35,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1836680426, now seen corresponding path program 2 times [2023-11-26 11:54:35,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:54:35,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1273043143] [2023-11-26 11:54:35,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-26 11:54:35,817 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 11:54:35,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:54:35,819 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:35,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:35,938 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-26 11:54:35,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 11:54:35,943 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-26 11:54:35,945 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:54:36,205 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 11:54:36,205 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:54:36,206 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:54:36,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1273043143] [2023-11-26 11:54:36,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1273043143] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:36,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:36,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 11:54:36,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184306713] [2023-11-26 11:54:36,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:36,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 11:54:36,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:54:36,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 11:54:36,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-26 11:54:36,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 43 [2023-11-26 11:54:36,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 137 flow. Second operand has 8 states, 8 states have (on average 23.625) internal successors, (189), 8 states have internal predecessors, (189), 0 states have call successors, (0), 0 states 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 11:54:36,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:54:36,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 43 [2023-11-26 11:54:36,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:54:36,525 INFO L124 PetriNetUnfolderBase]: 155/433 cut-off events. [2023-11-26 11:54:36,525 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2023-11-26 11:54:36,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1072 conditions, 433 events. 155/433 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2153 event pairs, 38 based on Foata normal form. 4/424 useless extension candidates. Maximal degree in co-relation 1056. Up to 165 conditions per place. [2023-11-26 11:54:36,529 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 35 selfloop transitions, 12 changer transitions 0/66 dead transitions. [2023-11-26 11:54:36,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 66 transitions, 331 flow [2023-11-26 11:54:36,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 11:54:36,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-26 11:54:36,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 236 transitions. [2023-11-26 11:54:36,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6098191214470284 [2023-11-26 11:54:36,532 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 236 transitions. [2023-11-26 11:54:36,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 236 transitions. [2023-11-26 11:54:36,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:36,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 236 transitions. [2023-11-26 11:54:36,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 26.22222222222222) internal successors, (236), 9 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:54:36,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 43.0) internal successors, (430), 10 states have internal predecessors, (430), 0 states have call successors, (0), 0 states 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 11:54:36,535 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 43.0) internal successors, (430), 10 states have internal predecessors, (430), 0 states have call successors, (0), 0 states 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 11:54:36,536 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 137 flow. Second operand 9 states and 236 transitions. [2023-11-26 11:54:36,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 66 transitions, 331 flow [2023-11-26 11:54:36,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 66 transitions, 330 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 11:54:36,542 INFO L231 Difference]: Finished difference. Result has 62 places, 48 transitions, 230 flow [2023-11-26 11:54:36,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=230, PETRI_PLACES=62, PETRI_TRANSITIONS=48} [2023-11-26 11:54:36,545 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 16 predicate places. [2023-11-26 11:54:36,545 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 48 transitions, 230 flow [2023-11-26 11:54:36,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.625) internal successors, (189), 8 states have internal predecessors, (189), 0 states have call successors, (0), 0 states 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 11:54:36,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:36,546 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] [2023-11-26 11:54:36,549 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:36,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:36,749 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 11:54:36,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:36,749 INFO L85 PathProgramCache]: Analyzing trace with hash 683582264, now seen corresponding path program 3 times [2023-11-26 11:54:36,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:54:36,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1618063032] [2023-11-26 11:54:36,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-26 11:54:36,750 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 11:54:36,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:54:36,751 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:36,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:36,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-26 11:54:36,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-26 11:54:36,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:54:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:54:37,034 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-26 11:54:37,035 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 11:54:37,036 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-26 11:54:37,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-26 11:54:37,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-26 11:54:37,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-26 11:54:37,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-26 11:54:37,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-26 11:54:37,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-26 11:54:37,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-26 11:54:37,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-26 11:54:37,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-26 11:54:37,045 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:37,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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 11:54:37,243 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:54:37,248 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-26 11:54:37,248 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 11:54:37,313 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-26 11:54:37,316 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 11:54:37,333 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-26 11:54:37,343 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-26 11:54:37,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 11:54:37 BasicIcfg [2023-11-26 11:54:37,359 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 11:54:37,360 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 11:54:37,360 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 11:54:37,360 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 11:54:37,361 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:54:29" (3/4) ... [2023-11-26 11:54:37,363 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 11:54:37,364 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 11:54:37,371 INFO L158 Benchmark]: Toolchain (without parser) took 9822.32ms. Allocated memory was 71.3MB in the beginning and 142.6MB in the end (delta: 71.3MB). Free memory was 46.1MB in the beginning and 113.2MB in the end (delta: -67.1MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2023-11-26 11:54:37,372 INFO L158 Benchmark]: CDTParser took 1.40ms. Allocated memory is still 71.3MB. Free memory is still 46.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:54:37,372 INFO L158 Benchmark]: CACSL2BoogieTranslator took 809.25ms. Allocated memory was 71.3MB in the beginning and 90.2MB in the end (delta: 18.9MB). Free memory was 45.9MB in the beginning and 59.4MB in the end (delta: -13.5MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2023-11-26 11:54:37,373 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.01ms. Allocated memory is still 90.2MB. Free memory was 59.4MB in the beginning and 56.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:54:37,373 INFO L158 Benchmark]: Boogie Preprocessor took 77.17ms. Allocated memory is still 90.2MB. Free memory was 56.9MB in the beginning and 53.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:54:37,374 INFO L158 Benchmark]: RCFGBuilder took 946.35ms. Allocated memory is still 90.2MB. Free memory was 53.8MB in the beginning and 37.0MB in the end (delta: 16.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-11-26 11:54:37,374 INFO L158 Benchmark]: TraceAbstraction took 7900.90ms. Allocated memory was 90.2MB in the beginning and 142.6MB in the end (delta: 52.4MB). Free memory was 36.0MB in the beginning and 114.3MB in the end (delta: -78.3MB). Peak memory consumption was 36.5MB. Max. memory is 16.1GB. [2023-11-26 11:54:37,375 INFO L158 Benchmark]: Witness Printer took 4.24ms. Allocated memory is still 142.6MB. Free memory was 114.3MB in the beginning and 113.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:54:37,378 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.40ms. Allocated memory is still 71.3MB. Free memory is still 46.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 809.25ms. Allocated memory was 71.3MB in the beginning and 90.2MB in the end (delta: 18.9MB). Free memory was 45.9MB in the beginning and 59.4MB in the end (delta: -13.5MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.01ms. Allocated memory is still 90.2MB. Free memory was 59.4MB in the beginning and 56.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.17ms. Allocated memory is still 90.2MB. Free memory was 56.9MB in the beginning and 53.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 946.35ms. Allocated memory is still 90.2MB. Free memory was 53.8MB in the beginning and 37.0MB in the end (delta: 16.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 7900.90ms. Allocated memory was 90.2MB in the beginning and 142.6MB in the end (delta: 52.4MB). Free memory was 36.0MB in the beginning and 114.3MB in the end (delta: -78.3MB). Peak memory consumption was 36.5MB. Max. memory is 16.1GB. * Witness Printer took 4.24ms. Allocated memory is still 142.6MB. Free memory was 114.3MB in the beginning and 113.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L813] 0 pthread_t t903; [L814] FCALL, FORK 0 pthread_create(&t903, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t903={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L815] 0 pthread_t t904; [L816] FCALL, FORK 0 pthread_create(&t904, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t903={7:0}, t904={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 1 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L782] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L788] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 x$flush_delayed = weak$$choice2 [L749] 1 x$mem_tmp = x [L750] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = x [L758] 1 x = x$flush_delayed ? x$mem_tmp : x [L759] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t903={7:0}, t904={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L823] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L824] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L825] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L826] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t903={7:0}, t904={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L829] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t903={7:0}, t904={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L831] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L18] 0 __assert_fail ("0", "mix034_pso.opt_tso.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: 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: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 814]: 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, 61 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: 7.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 248 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 199 mSDsluCounter, 39 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 35 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 649 IncrementalHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 9 mSDtfsCounter, 649 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230occurred 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.1s InterpolantComputationTime, 165 NumberOfCodeBlocks, 165 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 128 ConstructedInterpolants, 1 QuantifiedInterpolants, 927 SizeOfPredicates, 9 NumberOfNonLiveVariables, 938 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 11:54:37,400 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250f2167-dad3-4327-9309-4407e4bd30b8/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