./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 0f0c41cc4bbd081542690b2b24113aecb06bc89521cb806ea9d2ea12042870bc --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:14:05,184 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:14:05,329 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 21:14:05,338 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:14:05,340 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:14:05,379 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:14:05,380 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:14:05,381 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:14:05,382 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:14:05,390 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:14:05,391 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:14:05,392 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:14:05,392 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:14:05,395 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:14:05,395 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:14:05,395 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:14:05,396 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:14:05,396 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:14:05,397 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 21:14:05,397 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 21:14:05,398 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 21:14:05,398 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:14:05,399 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 21:14:05,399 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 21:14:05,399 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:14:05,400 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:14:05,401 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:14:05,401 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:14:05,401 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:14:05,402 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:14:05,403 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:14:05,404 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:14:05,404 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 21:14:05,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 21:14:05,404 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:14:05,405 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:14:05,405 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:14:05,405 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:14:05,405 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_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/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_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 0f0c41cc4bbd081542690b2b24113aecb06bc89521cb806ea9d2ea12042870bc [2023-11-06 21:14:05,722 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:14:05,744 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:14:05,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:14:05,748 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:14:05,749 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:14:05,750 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i [2023-11-06 21:14:08,881 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:14:09,248 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:14:09,248 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/sv-benchmarks/c/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i [2023-11-06 21:14:09,266 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/data/2879cffa2/e8eb6c5b86f5486cbfcfa6ebdf193211/FLAG24d78b19c [2023-11-06 21:14:09,281 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/data/2879cffa2/e8eb6c5b86f5486cbfcfa6ebdf193211 [2023-11-06 21:14:09,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:14:09,286 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:14:09,287 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:14:09,288 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:14:09,293 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:14:09,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:14:09" (1/1) ... [2023-11-06 21:14:09,296 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d7badb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:09, skipping insertion in model container [2023-11-06 21:14:09,296 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:14:09" (1/1) ... [2023-11-06 21:14:09,348 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:14:09,801 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:14:09,818 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:14:09,970 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:14:10,004 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 21:14:10,004 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 21:14:10,013 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:14:10,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:10 WrapperNode [2023-11-06 21:14:10,013 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:14:10,015 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:14:10,015 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:14:10,015 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:14:10,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:10" (1/1) ... [2023-11-06 21:14:10,054 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:10" (1/1) ... [2023-11-06 21:14:10,089 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 133 [2023-11-06 21:14:10,090 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:14:10,091 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:14:10,091 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:14:10,093 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:14:10,103 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:10" (1/1) ... [2023-11-06 21:14:10,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:10" (1/1) ... [2023-11-06 21:14:10,108 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:10" (1/1) ... [2023-11-06 21:14:10,109 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:10" (1/1) ... [2023-11-06 21:14:10,120 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:10" (1/1) ... [2023-11-06 21:14:10,123 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:10" (1/1) ... [2023-11-06 21:14:10,126 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:10" (1/1) ... [2023-11-06 21:14:10,128 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:10" (1/1) ... [2023-11-06 21:14:10,132 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:14:10,146 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:14:10,146 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:14:10,146 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:14:10,147 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:10" (1/1) ... [2023-11-06 21:14:10,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:14:10,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:14:10,179 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:14:10,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:14:10,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 21:14:10,212 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 21:14:10,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:14:10,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 21:14:10,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 21:14:10,213 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 21:14:10,213 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 21:14:10,214 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 21:14:10,214 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 21:14:10,214 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 21:14:10,214 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 21:14:10,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 21:14:10,215 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 21:14:10,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:14:10,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:14:10,217 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 21:14:10,352 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:14:10,354 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:14:10,709 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:14:10,907 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:14:10,910 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 21:14:10,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:14:10 BoogieIcfgContainer [2023-11-06 21:14:10,913 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:14:10,916 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:14:10,916 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:14:10,920 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:14:10,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:14:09" (1/3) ... [2023-11-06 21:14:10,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27b63cd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:14:10, skipping insertion in model container [2023-11-06 21:14:10,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:10" (2/3) ... [2023-11-06 21:14:10,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27b63cd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:14:10, skipping insertion in model container [2023-11-06 21:14:10,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:14:10" (3/3) ... [2023-11-06 21:14:10,927 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_pso.opt_rmo.opt_tso.opt.i [2023-11-06 21:14:10,949 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:14:10,949 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-06 21:14:10,950 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 21:14:11,026 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 21:14:11,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 124 transitions, 260 flow [2023-11-06 21:14:11,174 INFO L124 PetriNetUnfolderBase]: 3/121 cut-off events. [2023-11-06 21:14:11,175 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:14:11,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 3/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 89 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2023-11-06 21:14:11,182 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 124 transitions, 260 flow [2023-11-06 21:14:11,191 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 121 transitions, 251 flow [2023-11-06 21:14:11,196 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 21:14:11,213 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 121 transitions, 251 flow [2023-11-06 21:14:11,219 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 121 transitions, 251 flow [2023-11-06 21:14:11,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 121 transitions, 251 flow [2023-11-06 21:14:11,275 INFO L124 PetriNetUnfolderBase]: 3/121 cut-off events. [2023-11-06 21:14:11,276 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:14:11,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 3/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 89 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2023-11-06 21:14:11,281 INFO L119 LiptonReduction]: Number of co-enabled transitions 2228 [2023-11-06 21:14:16,234 INFO L134 LiptonReduction]: Checked pairs total: 4622 [2023-11-06 21:14:16,234 INFO L136 LiptonReduction]: Total number of compositions: 122 [2023-11-06 21:14:16,250 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:14:16,257 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;@1109e48b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:14:16,258 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-06 21:14:16,260 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 21:14:16,260 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-06 21:14:16,260 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:14:16,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:14:16,261 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 21:14:16,262 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:14:16,267 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:16,268 INFO L85 PathProgramCache]: Analyzing trace with hash 543, now seen corresponding path program 1 times [2023-11-06 21:14:16,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:16,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99229206] [2023-11-06 21:14:16,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:16,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:16,398 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-06 21:14:16,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:16,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99229206] [2023-11-06 21:14:16,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99229206] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:16,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:16,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 21:14:16,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964067281] [2023-11-06 21:14:16,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:16,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 21:14:16,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:16,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 21:14:16,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 21:14:16,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 246 [2023-11-06 21:14:16,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 69 flow. Second operand has 2 states, 2 states have (on average 112.5) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:16,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:14:16,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 246 [2023-11-06 21:14:16,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:14:16,806 INFO L124 PetriNetUnfolderBase]: 910/1371 cut-off events. [2023-11-06 21:14:16,806 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-11-06 21:14:16,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2769 conditions, 1371 events. 910/1371 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 6200 event pairs, 910 based on Foata normal form. 0/1154 useless extension candidates. Maximal degree in co-relation 2758. Up to 1362 conditions per place. [2023-11-06 21:14:16,832 INFO L140 encePairwiseOnDemand]: 239/246 looper letters, 21 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2023-11-06 21:14:16,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 23 transitions, 97 flow [2023-11-06 21:14:16,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 21:14:16,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 21:14:16,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 252 transitions. [2023-11-06 21:14:16,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5121951219512195 [2023-11-06 21:14:16,856 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 252 transitions. [2023-11-06 21:14:16,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 252 transitions. [2023-11-06 21:14:16,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:14:16,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 252 transitions. [2023-11-06 21:14:16,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 126.0) internal successors, (252), 2 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:16,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:16,884 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:16,886 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 69 flow. Second operand 2 states and 252 transitions. [2023-11-06 21:14:16,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 23 transitions, 97 flow [2023-11-06 21:14:16,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 23 transitions, 94 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 21:14:16,892 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 52 flow [2023-11-06 21:14:16,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2023-11-06 21:14:16,900 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -8 predicate places. [2023-11-06 21:14:16,900 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 52 flow [2023-11-06 21:14:16,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 112.5) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:16,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:14:16,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:14:16,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 21:14:16,902 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:14:16,903 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:16,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1357481233, now seen corresponding path program 1 times [2023-11-06 21:14:16,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:16,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789636789] [2023-11-06 21:14:16,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:16,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:16,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:17,332 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-06 21:14:17,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:17,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789636789] [2023-11-06 21:14:17,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789636789] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:17,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:17,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 21:14:17,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781988224] [2023-11-06 21:14:17,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:17,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:14:17,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:17,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:14:17,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:14:17,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 246 [2023-11-06 21:14:17,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:17,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:14:17,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 246 [2023-11-06 21:14:17,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:14:17,609 INFO L124 PetriNetUnfolderBase]: 719/1171 cut-off events. [2023-11-06 21:14:17,609 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:14:17,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2292 conditions, 1171 events. 719/1171 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5799 event pairs, 146 based on Foata normal form. 0/1074 useless extension candidates. Maximal degree in co-relation 2289. Up to 826 conditions per place. [2023-11-06 21:14:17,619 INFO L140 encePairwiseOnDemand]: 243/246 looper letters, 27 selfloop transitions, 2 changer transitions 2/33 dead transitions. [2023-11-06 21:14:17,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 33 transitions, 134 flow [2023-11-06 21:14:17,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:14:17,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:14:17,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2023-11-06 21:14:17,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.494579945799458 [2023-11-06 21:14:17,627 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 365 transitions. [2023-11-06 21:14:17,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 365 transitions. [2023-11-06 21:14:17,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:14:17,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 365 transitions. [2023-11-06 21:14:17,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:17,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:17,637 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:17,638 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 52 flow. Second operand 3 states and 365 transitions. [2023-11-06 21:14:17,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 33 transitions, 134 flow [2023-11-06 21:14:17,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 33 transitions, 134 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 21:14:17,643 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 52 flow [2023-11-06 21:14:17,643 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-11-06 21:14:17,644 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -7 predicate places. [2023-11-06 21:14:17,645 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 52 flow [2023-11-06 21:14:17,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:17,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:14:17,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:14:17,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 21:14:17,654 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:14:17,657 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:17,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1130661674, now seen corresponding path program 1 times [2023-11-06 21:14:17,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:17,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253498743] [2023-11-06 21:14:17,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:17,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:17,928 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-06 21:14:17,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:17,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253498743] [2023-11-06 21:14:17,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253498743] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:17,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:17,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 21:14:17,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470167484] [2023-11-06 21:14:17,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:17,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:14:17,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:17,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:14:17,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:14:17,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 246 [2023-11-06 21:14:17,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:17,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:14:17,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 246 [2023-11-06 21:14:17,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:14:18,383 INFO L124 PetriNetUnfolderBase]: 1575/2388 cut-off events. [2023-11-06 21:14:18,383 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2023-11-06 21:14:18,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4975 conditions, 2388 events. 1575/2388 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 11413 event pairs, 523 based on Foata normal form. 0/2316 useless extension candidates. Maximal degree in co-relation 4971. Up to 1453 conditions per place. [2023-11-06 21:14:18,402 INFO L140 encePairwiseOnDemand]: 239/246 looper letters, 31 selfloop transitions, 6 changer transitions 0/37 dead transitions. [2023-11-06 21:14:18,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 37 transitions, 162 flow [2023-11-06 21:14:18,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:14:18,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:14:18,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2023-11-06 21:14:18,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4823848238482385 [2023-11-06 21:14:18,404 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2023-11-06 21:14:18,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2023-11-06 21:14:18,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:14:18,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2023-11-06 21:14:18,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:18,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:18,410 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:18,410 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 52 flow. Second operand 3 states and 356 transitions. [2023-11-06 21:14:18,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 37 transitions, 162 flow [2023-11-06 21:14:18,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 37 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 21:14:18,414 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 94 flow [2023-11-06 21:14:18,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2023-11-06 21:14:18,416 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -6 predicate places. [2023-11-06 21:14:18,416 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 94 flow [2023-11-06 21:14:18,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:18,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:14:18,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:14:18,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 21:14:18,422 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:14:18,423 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:18,423 INFO L85 PathProgramCache]: Analyzing trace with hash 690772348, now seen corresponding path program 1 times [2023-11-06 21:14:18,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:18,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170932805] [2023-11-06 21:14:18,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:18,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:18,675 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-06 21:14:18,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:18,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170932805] [2023-11-06 21:14:18,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170932805] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:18,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:18,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:14:18,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234122080] [2023-11-06 21:14:18,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:18,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:14:18,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:18,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:14:18,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:14:18,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 246 [2023-11-06 21:14:18,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:18,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:14:18,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 246 [2023-11-06 21:14:18,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:14:19,029 INFO L124 PetriNetUnfolderBase]: 800/1354 cut-off events. [2023-11-06 21:14:19,029 INFO L125 PetriNetUnfolderBase]: For 503/503 co-relation queries the response was YES. [2023-11-06 21:14:19,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3341 conditions, 1354 events. 800/1354 cut-off events. For 503/503 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7101 event pairs, 167 based on Foata normal form. 92/1413 useless extension candidates. Maximal degree in co-relation 3336. Up to 960 conditions per place. [2023-11-06 21:14:19,041 INFO L140 encePairwiseOnDemand]: 240/246 looper letters, 40 selfloop transitions, 7 changer transitions 10/61 dead transitions. [2023-11-06 21:14:19,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 61 transitions, 318 flow [2023-11-06 21:14:19,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:14:19,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 21:14:19,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 565 transitions. [2023-11-06 21:14:19,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45934959349593496 [2023-11-06 21:14:19,045 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 565 transitions. [2023-11-06 21:14:19,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 565 transitions. [2023-11-06 21:14:19,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:14:19,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 565 transitions. [2023-11-06 21:14:19,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:19,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:19,053 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:19,053 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 94 flow. Second operand 5 states and 565 transitions. [2023-11-06 21:14:19,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 61 transitions, 318 flow [2023-11-06 21:14:19,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 61 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 21:14:19,061 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 136 flow [2023-11-06 21:14:19,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=136, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2023-11-06 21:14:19,063 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2023-11-06 21:14:19,063 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 136 flow [2023-11-06 21:14:19,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:19,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:14:19,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:14:19,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 21:14:19,064 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:14:19,065 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:19,065 INFO L85 PathProgramCache]: Analyzing trace with hash -456504831, now seen corresponding path program 1 times [2023-11-06 21:14:19,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:19,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411913738] [2023-11-06 21:14:19,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:19,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:19,731 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-06 21:14:19,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:19,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411913738] [2023-11-06 21:14:19,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411913738] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:19,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:19,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:14:19,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419546596] [2023-11-06 21:14:19,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:19,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:14:19,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:19,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:14:19,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:14:19,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 246 [2023-11-06 21:14:19,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:19,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:14:19,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 246 [2023-11-06 21:14:19,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:14:20,063 INFO L124 PetriNetUnfolderBase]: 445/811 cut-off events. [2023-11-06 21:14:20,063 INFO L125 PetriNetUnfolderBase]: For 546/562 co-relation queries the response was YES. [2023-11-06 21:14:20,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2496 conditions, 811 events. 445/811 cut-off events. For 546/562 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4062 event pairs, 53 based on Foata normal form. 72/854 useless extension candidates. Maximal degree in co-relation 2488. Up to 283 conditions per place. [2023-11-06 21:14:20,071 INFO L140 encePairwiseOnDemand]: 240/246 looper letters, 48 selfloop transitions, 13 changer transitions 18/83 dead transitions. [2023-11-06 21:14:20,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 83 transitions, 480 flow [2023-11-06 21:14:20,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:14:20,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 21:14:20,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 789 transitions. [2023-11-06 21:14:20,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45818815331010454 [2023-11-06 21:14:20,075 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 789 transitions. [2023-11-06 21:14:20,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 789 transitions. [2023-11-06 21:14:20,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:14:20,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 789 transitions. [2023-11-06 21:14:20,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 112.71428571428571) internal successors, (789), 7 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:20,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:20,086 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:20,086 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 136 flow. Second operand 7 states and 789 transitions. [2023-11-06 21:14:20,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 83 transitions, 480 flow [2023-11-06 21:14:20,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 83 transitions, 476 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 21:14:20,093 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 220 flow [2023-11-06 21:14:20,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=220, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2023-11-06 21:14:20,096 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 7 predicate places. [2023-11-06 21:14:20,097 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 220 flow [2023-11-06 21:14:20,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:20,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:14:20,098 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:14:20,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 21:14:20,098 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:14:20,099 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:20,099 INFO L85 PathProgramCache]: Analyzing trace with hash 189938665, now seen corresponding path program 1 times [2023-11-06 21:14:20,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:20,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257926945] [2023-11-06 21:14:20,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:20,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,338 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-06 21:14:20,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:20,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257926945] [2023-11-06 21:14:20,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257926945] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:20,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:20,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:14:20,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954404642] [2023-11-06 21:14:20,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:20,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:14:20,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:20,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:14:20,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:14:20,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 246 [2023-11-06 21:14:20,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 105.33333333333333) internal successors, (632), 6 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:20,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:14:20,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 246 [2023-11-06 21:14:20,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:14:20,662 INFO L124 PetriNetUnfolderBase]: 365/667 cut-off events. [2023-11-06 21:14:20,662 INFO L125 PetriNetUnfolderBase]: For 1147/1159 co-relation queries the response was YES. [2023-11-06 21:14:20,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2389 conditions, 667 events. 365/667 cut-off events. For 1147/1159 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3294 event pairs, 40 based on Foata normal form. 29/679 useless extension candidates. Maximal degree in co-relation 2378. Up to 237 conditions per place. [2023-11-06 21:14:20,669 INFO L140 encePairwiseOnDemand]: 240/246 looper letters, 45 selfloop transitions, 17 changer transitions 17/83 dead transitions. [2023-11-06 21:14:20,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 83 transitions, 538 flow [2023-11-06 21:14:20,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 21:14:20,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 21:14:20,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 995 transitions. [2023-11-06 21:14:20,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44941282746160793 [2023-11-06 21:14:20,673 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 995 transitions. [2023-11-06 21:14:20,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 995 transitions. [2023-11-06 21:14:20,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:14:20,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 995 transitions. [2023-11-06 21:14:20,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 110.55555555555556) internal successors, (995), 9 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:20,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 246.0) internal successors, (2460), 10 states have internal predecessors, (2460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:20,684 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 246.0) internal successors, (2460), 10 states have internal predecessors, (2460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:20,684 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 220 flow. Second operand 9 states and 995 transitions. [2023-11-06 21:14:20,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 83 transitions, 538 flow [2023-11-06 21:14:20,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 83 transitions, 508 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-11-06 21:14:20,698 INFO L231 Difference]: Finished difference. Result has 55 places, 39 transitions, 246 flow [2023-11-06 21:14:20,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=246, PETRI_PLACES=55, PETRI_TRANSITIONS=39} [2023-11-06 21:14:20,699 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 16 predicate places. [2023-11-06 21:14:20,699 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 39 transitions, 246 flow [2023-11-06 21:14:20,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.33333333333333) internal successors, (632), 6 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:20,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:14:20,700 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:14:20,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 21:14:20,701 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:14:20,701 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:20,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1374376295, now seen corresponding path program 1 times [2023-11-06 21:14:20,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:20,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628618613] [2023-11-06 21:14:20,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:20,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,959 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-06 21:14:20,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:20,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628618613] [2023-11-06 21:14:20,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628618613] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:20,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:20,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:14:20,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459780038] [2023-11-06 21:14:20,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:20,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:14:20,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:20,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:14:20,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:14:20,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 246 [2023-11-06 21:14:20,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 39 transitions, 246 flow. Second operand has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:20,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:14:20,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 246 [2023-11-06 21:14:20,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:14:21,252 INFO L124 PetriNetUnfolderBase]: 541/972 cut-off events. [2023-11-06 21:14:21,252 INFO L125 PetriNetUnfolderBase]: For 2027/2027 co-relation queries the response was YES. [2023-11-06 21:14:21,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3627 conditions, 972 events. 541/972 cut-off events. For 2027/2027 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4904 event pairs, 66 based on Foata normal form. 0/971 useless extension candidates. Maximal degree in co-relation 3612. Up to 467 conditions per place. [2023-11-06 21:14:21,260 INFO L140 encePairwiseOnDemand]: 238/246 looper letters, 58 selfloop transitions, 12 changer transitions 20/90 dead transitions. [2023-11-06 21:14:21,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 90 transitions, 752 flow [2023-11-06 21:14:21,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:14:21,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 21:14:21,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2023-11-06 21:14:21,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46747967479674796 [2023-11-06 21:14:21,264 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 575 transitions. [2023-11-06 21:14:21,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 575 transitions. [2023-11-06 21:14:21,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:14:21,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 575 transitions. [2023-11-06 21:14:21,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:21,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:21,270 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:21,270 INFO L175 Difference]: Start difference. First operand has 55 places, 39 transitions, 246 flow. Second operand 5 states and 575 transitions. [2023-11-06 21:14:21,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 90 transitions, 752 flow [2023-11-06 21:14:21,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 90 transitions, 617 flow, removed 30 selfloop flow, removed 8 redundant places. [2023-11-06 21:14:21,290 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 228 flow [2023-11-06 21:14:21,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=228, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2023-11-06 21:14:21,291 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 14 predicate places. [2023-11-06 21:14:21,291 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 228 flow [2023-11-06 21:14:21,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:21,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:14:21,292 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:14:21,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 21:14:21,292 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:14:21,292 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:21,293 INFO L85 PathProgramCache]: Analyzing trace with hash -380242815, now seen corresponding path program 2 times [2023-11-06 21:14:21,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:21,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082855595] [2023-11-06 21:14:21,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:21,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:21,560 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-06 21:14:21,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:21,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082855595] [2023-11-06 21:14:21,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082855595] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:21,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:21,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:14:21,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32686050] [2023-11-06 21:14:21,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:21,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:14:21,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:21,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:14:21,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:14:21,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 246 [2023-11-06 21:14:21,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 228 flow. Second operand has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:21,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:14:21,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 246 [2023-11-06 21:14:21,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:14:21,825 INFO L124 PetriNetUnfolderBase]: 293/558 cut-off events. [2023-11-06 21:14:21,826 INFO L125 PetriNetUnfolderBase]: For 879/879 co-relation queries the response was YES. [2023-11-06 21:14:21,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2125 conditions, 558 events. 293/558 cut-off events. For 879/879 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2493 event pairs, 32 based on Foata normal form. 1/559 useless extension candidates. Maximal degree in co-relation 2110. Up to 203 conditions per place. [2023-11-06 21:14:21,832 INFO L140 encePairwiseOnDemand]: 238/246 looper letters, 78 selfloop transitions, 11 changer transitions 0/89 dead transitions. [2023-11-06 21:14:21,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 89 transitions, 654 flow [2023-11-06 21:14:21,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:14:21,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 21:14:21,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 688 transitions. [2023-11-06 21:14:21,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46612466124661245 [2023-11-06 21:14:21,836 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 688 transitions. [2023-11-06 21:14:21,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 688 transitions. [2023-11-06 21:14:21,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:14:21,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 688 transitions. [2023-11-06 21:14:21,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.66666666666667) internal successors, (688), 6 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:21,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 246.0) internal successors, (1722), 7 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:21,843 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 246.0) internal successors, (1722), 7 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:21,844 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 228 flow. Second operand 6 states and 688 transitions. [2023-11-06 21:14:21,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 89 transitions, 654 flow [2023-11-06 21:14:21,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 89 transitions, 630 flow, removed 12 selfloop flow, removed 4 redundant places. [2023-11-06 21:14:21,854 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 298 flow [2023-11-06 21:14:21,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=298, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2023-11-06 21:14:21,855 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 13 predicate places. [2023-11-06 21:14:21,855 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 298 flow [2023-11-06 21:14:21,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:21,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:14:21,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:14:21,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 21:14:21,856 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:14:21,856 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:21,856 INFO L85 PathProgramCache]: Analyzing trace with hash 403845583, now seen corresponding path program 3 times [2023-11-06 21:14:21,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:21,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287509343] [2023-11-06 21:14:21,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:21,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:22,108 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-06 21:14:22,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:22,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287509343] [2023-11-06 21:14:22,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287509343] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:22,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:22,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:14:22,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258751104] [2023-11-06 21:14:22,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:22,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:14:22,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:22,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:14:22,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:14:22,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 246 [2023-11-06 21:14:22,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 298 flow. Second operand has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:22,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:14:22,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 246 [2023-11-06 21:14:22,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:14:22,357 INFO L124 PetriNetUnfolderBase]: 341/674 cut-off events. [2023-11-06 21:14:22,357 INFO L125 PetriNetUnfolderBase]: For 1756/1756 co-relation queries the response was YES. [2023-11-06 21:14:22,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2741 conditions, 674 events. 341/674 cut-off events. For 1756/1756 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3269 event pairs, 71 based on Foata normal form. 1/675 useless extension candidates. Maximal degree in co-relation 2726. Up to 330 conditions per place. [2023-11-06 21:14:22,367 INFO L140 encePairwiseOnDemand]: 240/246 looper letters, 58 selfloop transitions, 15 changer transitions 0/73 dead transitions. [2023-11-06 21:14:22,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 73 transitions, 606 flow [2023-11-06 21:14:22,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:14:22,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 21:14:22,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 469 transitions. [2023-11-06 21:14:22,370 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4766260162601626 [2023-11-06 21:14:22,370 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 469 transitions. [2023-11-06 21:14:22,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 469 transitions. [2023-11-06 21:14:22,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:14:22,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 469 transitions. [2023-11-06 21:14:22,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:22,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:22,376 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:22,376 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 298 flow. Second operand 4 states and 469 transitions. [2023-11-06 21:14:22,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 73 transitions, 606 flow [2023-11-06 21:14:22,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 73 transitions, 590 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-06 21:14:22,388 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 412 flow [2023-11-06 21:14:22,388 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=412, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2023-11-06 21:14:22,389 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 16 predicate places. [2023-11-06 21:14:22,389 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 412 flow [2023-11-06 21:14:22,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:22,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:14:22,390 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:14:22,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 21:14:22,390 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:14:22,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:22,391 INFO L85 PathProgramCache]: Analyzing trace with hash -664230111, now seen corresponding path program 4 times [2023-11-06 21:14:22,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:22,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428781573] [2023-11-06 21:14:22,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:22,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:14:22,461 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:14:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:14:22,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 21:14:22,569 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 21:14:22,570 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-06 21:14:22,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-06 21:14:22,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-06 21:14:22,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-06 21:14:22,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-06 21:14:22,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-06 21:14:22,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-06 21:14:22,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-06 21:14:22,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-06 21:14:22,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-06 21:14:22,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-06 21:14:22,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-06 21:14:22,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-06 21:14:22,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 21:14:22,575 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2023-11-06 21:14:22,581 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 21:14:22,581 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 21:14:22,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:14:22 BasicIcfg [2023-11-06 21:14:22,671 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 21:14:22,671 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 21:14:22,671 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 21:14:22,672 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 21:14:22,672 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:14:10" (3/4) ... [2023-11-06 21:14:22,674 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 21:14:22,675 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 21:14:22,676 INFO L158 Benchmark]: Toolchain (without parser) took 13390.40ms. Allocated memory was 163.6MB in the beginning and 285.2MB in the end (delta: 121.6MB). Free memory was 125.5MB in the beginning and 186.9MB in the end (delta: -61.4MB). Peak memory consumption was 58.8MB. Max. memory is 16.1GB. [2023-11-06 21:14:22,676 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 117.4MB. Free memory is still 89.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:14:22,677 INFO L158 Benchmark]: CACSL2BoogieTranslator took 726.63ms. Allocated memory is still 163.6MB. Free memory was 124.8MB in the beginning and 125.1MB in the end (delta: -306.1kB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-06 21:14:22,677 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.49ms. Allocated memory is still 163.6MB. Free memory was 125.1MB in the beginning and 122.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:14:22,677 INFO L158 Benchmark]: Boogie Preprocessor took 42.76ms. Allocated memory is still 163.6MB. Free memory was 122.5MB in the beginning and 121.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:14:22,678 INFO L158 Benchmark]: RCFGBuilder took 767.27ms. Allocated memory is still 163.6MB. Free memory was 121.1MB in the beginning and 87.5MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2023-11-06 21:14:22,678 INFO L158 Benchmark]: TraceAbstraction took 11754.63ms. Allocated memory was 163.6MB in the beginning and 285.2MB in the end (delta: 121.6MB). Free memory was 86.9MB in the beginning and 188.0MB in the end (delta: -101.1MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. [2023-11-06 21:14:22,678 INFO L158 Benchmark]: Witness Printer took 4.09ms. Allocated memory is still 285.2MB. Free memory was 188.0MB in the beginning and 186.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:14:22,680 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.27ms. Allocated memory is still 117.4MB. Free memory is still 89.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 726.63ms. Allocated memory is still 163.6MB. Free memory was 124.8MB in the beginning and 125.1MB in the end (delta: -306.1kB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.49ms. Allocated memory is still 163.6MB. Free memory was 125.1MB in the beginning and 122.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.76ms. Allocated memory is still 163.6MB. Free memory was 122.5MB in the beginning and 121.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 767.27ms. Allocated memory is still 163.6MB. Free memory was 121.1MB in the beginning and 87.5MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11754.63ms. Allocated memory was 163.6MB in the beginning and 285.2MB in the end (delta: 121.6MB). Free memory was 86.9MB in the beginning and 188.0MB in the end (delta: -101.1MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. * Witness Printer took 4.09ms. Allocated memory is still 285.2MB. Free memory was 188.0MB in the beginning and 186.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.0s, 128 PlacesBefore, 39 PlacesAfterwards, 121 TransitionsBefore, 30 TransitionsAfterwards, 2228 CoEnabledTransitionPairs, 6 FixpointIterations, 48 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 122 TotalNumberOfCompositions, 4622 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2578, independent: 2445, independent conditional: 0, independent unconditional: 2445, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1285, independent: 1245, independent conditional: 0, independent unconditional: 1245, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2578, independent: 1200, independent conditional: 0, independent unconditional: 1200, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 1285, unknown conditional: 0, unknown unconditional: 1285] , Statistics on independence cache: Total cache size (in pairs): 101, Positive cache size: 85, Positive conditional cache size: 0, Positive unconditional cache size: 85, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1394; [L824] FCALL, FORK 0 pthread_create(&t1394, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1394, ((void *)0), P0, ((void *)0))=-1, t1394={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L825] 0 pthread_t t1395; [L826] FCALL, FORK 0 pthread_create(&t1395, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1395, ((void *)0), P1, ((void *)0))=0, t1394={5:0}, t1395={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L827] 0 pthread_t t1396; [L828] FCALL, FORK 0 pthread_create(&t1396, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1396, ((void *)0), P2, ((void *)0))=1, t1394={5:0}, t1395={6:0}, t1396={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L786] 3 y$w_buff1 = y$w_buff0 [L787] 3 y$w_buff0 = 1 [L788] 3 y$w_buff1_used = y$w_buff0_used [L789] 3 y$w_buff0_used = (_Bool)1 [L790] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L790] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L791] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L792] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L793] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L794] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0: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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L798] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0: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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L758] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0: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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 y$flush_delayed = weak$$choice2 [L764] 2 y$mem_tmp = y [L765] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L766] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L767] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L768] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L769] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L771] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EAX = y [L773] 2 y = y$flush_delayed ? y$mem_tmp : y [L774] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0: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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L779] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 2 return 0; [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1394={5:0}, t1395={6:0}, t1396={3:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L841] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) [L843] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix052_pso.opt_rmo.opt_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 821]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 826]: 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: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 148 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.5s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 339 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 266 mSDsluCounter, 90 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 42 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 687 IncrementalHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 48 mSDtfsCounter, 687 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=412occurred in iteration=9, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 130 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 102 ConstructedInterpolants, 0 QuantifiedInterpolants, 509 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-06 21:14:22,703 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 0f0c41cc4bbd081542690b2b24113aecb06bc89521cb806ea9d2ea12042870bc --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:14:25,349 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:14:25,427 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-06 21:14:25,433 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:14:25,434 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:14:25,464 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:14:25,464 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:14:25,465 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:14:25,466 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:14:25,466 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:14:25,467 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:14:25,468 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:14:25,468 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:14:25,469 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:14:25,470 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:14:25,470 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:14:25,471 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:14:25,471 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:14:25,472 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 21:14:25,472 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 21:14:25,473 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 21:14:25,473 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:14:25,474 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 21:14:25,474 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 21:14:25,475 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 21:14:25,475 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 21:14:25,476 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:14:25,476 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:14:25,476 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:14:25,477 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:14:25,477 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:14:25,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:14:25,478 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:14:25,478 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:14:25,479 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 21:14:25,479 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 21:14:25,480 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:14:25,480 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:14:25,480 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:14:25,481 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 21:14:25,481 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:14:25,482 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_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/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_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 0f0c41cc4bbd081542690b2b24113aecb06bc89521cb806ea9d2ea12042870bc [2023-11-06 21:14:25,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:14:25,976 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:14:25,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:14:25,980 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:14:25,981 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:14:25,982 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i [2023-11-06 21:14:29,078 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:14:29,436 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:14:29,436 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/sv-benchmarks/c/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i [2023-11-06 21:14:29,460 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/data/ef294c327/13979f89b33f4719a46f6159db609ea2/FLAG7f8deee05 [2023-11-06 21:14:29,476 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/data/ef294c327/13979f89b33f4719a46f6159db609ea2 [2023-11-06 21:14:29,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:14:29,481 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:14:29,482 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:14:29,482 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:14:29,488 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:14:29,489 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:14:29" (1/1) ... [2023-11-06 21:14:29,490 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ec28bb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:29, skipping insertion in model container [2023-11-06 21:14:29,491 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:14:29" (1/1) ... [2023-11-06 21:14:29,541 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:14:29,950 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:14:29,984 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:14:30,119 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:14:30,176 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 21:14:30,176 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 21:14:30,184 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:14:30,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:30 WrapperNode [2023-11-06 21:14:30,185 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:14:30,187 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:14:30,187 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:14:30,188 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:14:30,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:30" (1/1) ... [2023-11-06 21:14:30,235 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:30" (1/1) ... [2023-11-06 21:14:30,285 INFO L138 Inliner]: procedures = 179, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 134 [2023-11-06 21:14:30,286 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:14:30,287 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:14:30,287 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:14:30,287 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:14:30,297 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:30" (1/1) ... [2023-11-06 21:14:30,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:30" (1/1) ... [2023-11-06 21:14:30,318 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:30" (1/1) ... [2023-11-06 21:14:30,322 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:30" (1/1) ... [2023-11-06 21:14:30,332 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:30" (1/1) ... [2023-11-06 21:14:30,348 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:30" (1/1) ... [2023-11-06 21:14:30,352 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:30" (1/1) ... [2023-11-06 21:14:30,354 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:30" (1/1) ... [2023-11-06 21:14:30,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:14:30,377 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:14:30,377 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:14:30,377 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:14:30,378 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:30" (1/1) ... [2023-11-06 21:14:30,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:14:30,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:14:30,422 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:14:30,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:14:30,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 21:14:30,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:14:30,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 21:14:30,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 21:14:30,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 21:14:30,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 21:14:30,470 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 21:14:30,471 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 21:14:30,471 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 21:14:30,471 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 21:14:30,471 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 21:14:30,471 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 21:14:30,473 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 21:14:30,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:14:30,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:14:30,476 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 21:14:30,712 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:14:30,715 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:14:31,165 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:14:31,349 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:14:31,349 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 21:14:31,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:14:31 BoogieIcfgContainer [2023-11-06 21:14:31,353 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:14:31,356 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:14:31,357 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:14:31,361 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:14:31,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:14:29" (1/3) ... [2023-11-06 21:14:31,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab2cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:14:31, skipping insertion in model container [2023-11-06 21:14:31,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:30" (2/3) ... [2023-11-06 21:14:31,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab2cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:14:31, skipping insertion in model container [2023-11-06 21:14:31,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:14:31" (3/3) ... [2023-11-06 21:14:31,366 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_pso.opt_rmo.opt_tso.opt.i [2023-11-06 21:14:31,384 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:14:31,384 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-06 21:14:31,384 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 21:14:31,445 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 21:14:31,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 125 transitions, 262 flow [2023-11-06 21:14:31,583 INFO L124 PetriNetUnfolderBase]: 3/122 cut-off events. [2023-11-06 21:14:31,583 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:14:31,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 3/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 89 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2023-11-06 21:14:31,588 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 125 transitions, 262 flow [2023-11-06 21:14:31,593 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 122 transitions, 253 flow [2023-11-06 21:14:31,596 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 21:14:31,606 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 122 transitions, 253 flow [2023-11-06 21:14:31,609 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 122 transitions, 253 flow [2023-11-06 21:14:31,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 122 transitions, 253 flow [2023-11-06 21:14:31,641 INFO L124 PetriNetUnfolderBase]: 3/122 cut-off events. [2023-11-06 21:14:31,642 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:14:31,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 3/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 89 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2023-11-06 21:14:31,646 INFO L119 LiptonReduction]: Number of co-enabled transitions 2228 [2023-11-06 21:14:39,571 INFO L134 LiptonReduction]: Checked pairs total: 5199 [2023-11-06 21:14:39,571 INFO L136 LiptonReduction]: Total number of compositions: 126 [2023-11-06 21:14:39,605 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:14:39,611 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;@7937d1a5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:14:39,612 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-06 21:14:39,614 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 21:14:39,614 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 21:14:39,614 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:14:39,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:14:39,615 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 21:14:39,615 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:14:39,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:39,621 INFO L85 PathProgramCache]: Analyzing trace with hash 550, now seen corresponding path program 1 times [2023-11-06 21:14:39,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:14:39,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1791951209] [2023-11-06 21:14:39,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:39,644 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-06 21:14:39,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:14:39,651 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/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-06 21:14:39,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/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-06 21:14:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:39,732 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 21:14:39,736 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:14:39,740 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-06 21:14:39,741 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:14:39,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:14:39,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1791951209] [2023-11-06 21:14:39,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1791951209] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:39,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:39,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 21:14:39,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584827686] [2023-11-06 21:14:39,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:39,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 21:14:39,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:14:39,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 21:14:39,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 21:14:39,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 251 [2023-11-06 21:14:39,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 69 flow. Second operand has 2 states, 2 states have (on average 113.5) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:39,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:14:39,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 251 [2023-11-06 21:14:39,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:14:40,149 INFO L124 PetriNetUnfolderBase]: 910/1374 cut-off events. [2023-11-06 21:14:40,149 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-06 21:14:40,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2772 conditions, 1374 events. 910/1374 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 6200 event pairs, 910 based on Foata normal form. 0/1157 useless extension candidates. Maximal degree in co-relation 2761. Up to 1362 conditions per place. [2023-11-06 21:14:40,167 INFO L140 encePairwiseOnDemand]: 244/251 looper letters, 21 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2023-11-06 21:14:40,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 23 transitions, 97 flow [2023-11-06 21:14:40,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 21:14:40,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 21:14:40,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 254 transitions. [2023-11-06 21:14:40,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5059760956175299 [2023-11-06 21:14:40,185 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 254 transitions. [2023-11-06 21:14:40,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 254 transitions. [2023-11-06 21:14:40,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:14:40,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 254 transitions. [2023-11-06 21:14:40,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 127.0) internal successors, (254), 2 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:40,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 251.0) internal successors, (753), 3 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:40,201 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 251.0) internal successors, (753), 3 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:40,203 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 69 flow. Second operand 2 states and 254 transitions. [2023-11-06 21:14:40,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 23 transitions, 97 flow [2023-11-06 21:14:40,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 23 transitions, 94 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 21:14:40,209 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 52 flow [2023-11-06 21:14:40,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2023-11-06 21:14:40,215 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -8 predicate places. [2023-11-06 21:14:40,216 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 52 flow [2023-11-06 21:14:40,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 113.5) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:40,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:14:40,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:14:40,234 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/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-06 21:14:40,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/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-06 21:14:40,429 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:14:40,430 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:40,430 INFO L85 PathProgramCache]: Analyzing trace with hash -262720327, now seen corresponding path program 1 times [2023-11-06 21:14:40,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:14:40,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1613214860] [2023-11-06 21:14:40,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:40,432 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-06 21:14:40,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:14:40,433 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/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-06 21:14:40,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/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-06 21:14:40,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:40,560 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 21:14:40,561 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:14:40,610 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-06 21:14:40,611 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:14:40,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:14:40,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1613214860] [2023-11-06 21:14:40,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1613214860] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:40,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:40,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 21:14:40,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086433097] [2023-11-06 21:14:40,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:40,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:14:40,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:14:40,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:14:40,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:14:40,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 251 [2023-11-06 21:14:40,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:40,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:14:40,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 251 [2023-11-06 21:14:40,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:14:40,904 INFO L124 PetriNetUnfolderBase]: 719/1171 cut-off events. [2023-11-06 21:14:40,904 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:14:40,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2292 conditions, 1171 events. 719/1171 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5774 event pairs, 146 based on Foata normal form. 0/1074 useless extension candidates. Maximal degree in co-relation 2289. Up to 826 conditions per place. [2023-11-06 21:14:40,914 INFO L140 encePairwiseOnDemand]: 248/251 looper letters, 27 selfloop transitions, 2 changer transitions 2/33 dead transitions. [2023-11-06 21:14:40,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 33 transitions, 134 flow [2023-11-06 21:14:40,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:14:40,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:14:40,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2023-11-06 21:14:40,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48871181938911024 [2023-11-06 21:14:40,920 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2023-11-06 21:14:40,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2023-11-06 21:14:40,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:14:40,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2023-11-06 21:14:40,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:40,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:40,927 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:40,927 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 52 flow. Second operand 3 states and 368 transitions. [2023-11-06 21:14:40,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 33 transitions, 134 flow [2023-11-06 21:14:40,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 33 transitions, 134 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 21:14:40,929 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 52 flow [2023-11-06 21:14:40,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-11-06 21:14:40,931 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -7 predicate places. [2023-11-06 21:14:40,931 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 52 flow [2023-11-06 21:14:40,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:40,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:14:40,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:14:40,949 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/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-06 21:14:41,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/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-06 21:14:41,145 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:14:41,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:41,148 INFO L85 PathProgramCache]: Analyzing trace with hash 928904866, now seen corresponding path program 1 times [2023-11-06 21:14:41,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:14:41,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349467979] [2023-11-06 21:14:41,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:41,149 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-06 21:14:41,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:14:41,151 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/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-06 21:14:41,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/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-06 21:14:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:41,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 21:14:41,300 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:14:41,362 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-06 21:14:41,362 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:14:41,363 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:14:41,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349467979] [2023-11-06 21:14:41,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [349467979] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:41,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:41,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:14:41,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84326308] [2023-11-06 21:14:41,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:41,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:14:41,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:14:41,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:14:41,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:14:41,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 251 [2023-11-06 21:14:41,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:41,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:14:41,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 251 [2023-11-06 21:14:41,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:14:41,709 INFO L124 PetriNetUnfolderBase]: 419/703 cut-off events. [2023-11-06 21:14:41,710 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-11-06 21:14:41,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1490 conditions, 703 events. 419/703 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3087 event pairs, 84 based on Foata normal form. 48/720 useless extension candidates. Maximal degree in co-relation 1486. Up to 508 conditions per place. [2023-11-06 21:14:41,716 INFO L140 encePairwiseOnDemand]: 245/251 looper letters, 27 selfloop transitions, 4 changer transitions 17/50 dead transitions. [2023-11-06 21:14:41,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 50 transitions, 216 flow [2023-11-06 21:14:41,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:14:41,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 21:14:41,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 570 transitions. [2023-11-06 21:14:41,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4541832669322709 [2023-11-06 21:14:41,720 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 570 transitions. [2023-11-06 21:14:41,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 570 transitions. [2023-11-06 21:14:41,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:14:41,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 570 transitions. [2023-11-06 21:14:41,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:41,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:41,729 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:41,729 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 52 flow. Second operand 5 states and 570 transitions. [2023-11-06 21:14:41,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 50 transitions, 216 flow [2023-11-06 21:14:41,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 50 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 21:14:41,734 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 84 flow [2023-11-06 21:14:41,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=84, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2023-11-06 21:14:41,736 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -3 predicate places. [2023-11-06 21:14:41,736 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 84 flow [2023-11-06 21:14:41,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:41,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:14:41,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:14:41,751 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-06 21:14:41,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/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-06 21:14:41,949 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:14:41,950 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:41,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1847122380, now seen corresponding path program 1 times [2023-11-06 21:14:41,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:14:41,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2128273273] [2023-11-06 21:14:41,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:41,951 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-06 21:14:41,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:14:41,953 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/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-06 21:14:41,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/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-06 21:14:42,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,082 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 21:14:42,083 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:14:42,142 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-06 21:14:42,143 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:14:42,143 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:14:42,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2128273273] [2023-11-06 21:14:42,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2128273273] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:42,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:42,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:14:42,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637365749] [2023-11-06 21:14:42,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:42,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:14:42,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:14:42,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:14:42,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:14:42,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 251 [2023-11-06 21:14:42,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 106.2) internal successors, (531), 5 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:42,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:14:42,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 251 [2023-11-06 21:14:42,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:14:42,480 INFO L124 PetriNetUnfolderBase]: 176/337 cut-off events. [2023-11-06 21:14:42,480 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2023-11-06 21:14:42,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 935 conditions, 337 events. 176/337 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1284 event pairs, 37 based on Foata normal form. 30/357 useless extension candidates. Maximal degree in co-relation 928. Up to 121 conditions per place. [2023-11-06 21:14:42,483 INFO L140 encePairwiseOnDemand]: 245/251 looper letters, 34 selfloop transitions, 7 changer transitions 17/60 dead transitions. [2023-11-06 21:14:42,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 60 transitions, 316 flow [2023-11-06 21:14:42,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:14:42,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 21:14:42,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 684 transitions. [2023-11-06 21:14:42,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4541832669322709 [2023-11-06 21:14:42,487 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 684 transitions. [2023-11-06 21:14:42,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 684 transitions. [2023-11-06 21:14:42,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:14:42,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 684 transitions. [2023-11-06 21:14:42,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:42,495 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 251.0) internal successors, (1757), 7 states have internal predecessors, (1757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:42,496 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 251.0) internal successors, (1757), 7 states have internal predecessors, (1757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:42,497 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 84 flow. Second operand 6 states and 684 transitions. [2023-11-06 21:14:42,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 60 transitions, 316 flow [2023-11-06 21:14:42,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 60 transitions, 310 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 21:14:42,501 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 134 flow [2023-11-06 21:14:42,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=134, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-11-06 21:14:42,502 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2023-11-06 21:14:42,502 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 134 flow [2023-11-06 21:14:42,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.2) internal successors, (531), 5 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:42,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:14:42,503 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:14:42,520 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/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-06 21:14:42,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/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-06 21:14:42,715 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:14:42,716 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:42,716 INFO L85 PathProgramCache]: Analyzing trace with hash -629403497, now seen corresponding path program 1 times [2023-11-06 21:14:42,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:14:42,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1843661698] [2023-11-06 21:14:42,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:42,717 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-06 21:14:42,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:14:42,718 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/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-06 21:14:42,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/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-06 21:14:42,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:42,843 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 21:14:42,845 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:14:42,902 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-06 21:14:42,902 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:14:42,902 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:14:42,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1843661698] [2023-11-06 21:14:42,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1843661698] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:42,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:42,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:14:42,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638518722] [2023-11-06 21:14:42,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:42,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:14:42,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:14:42,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:14:42,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:14:42,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 251 [2023-11-06 21:14:42,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 134 flow. Second operand has 6 states, 6 states have (on average 106.33333333333333) internal successors, (638), 6 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:42,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:14:42,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 251 [2023-11-06 21:14:42,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:14:43,237 INFO L124 PetriNetUnfolderBase]: 102/202 cut-off events. [2023-11-06 21:14:43,237 INFO L125 PetriNetUnfolderBase]: For 228/228 co-relation queries the response was YES. [2023-11-06 21:14:43,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 202 events. 102/202 cut-off events. For 228/228 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 653 event pairs, 32 based on Foata normal form. 9/209 useless extension candidates. Maximal degree in co-relation 622. Up to 77 conditions per place. [2023-11-06 21:14:43,240 INFO L140 encePairwiseOnDemand]: 245/251 looper letters, 31 selfloop transitions, 10 changer transitions 9/52 dead transitions. [2023-11-06 21:14:43,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 318 flow [2023-11-06 21:14:43,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:14:43,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 21:14:43,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 780 transitions. [2023-11-06 21:14:43,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.443938531587934 [2023-11-06 21:14:43,244 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 780 transitions. [2023-11-06 21:14:43,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 780 transitions. [2023-11-06 21:14:43,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:14:43,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 780 transitions. [2023-11-06 21:14:43,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 111.42857142857143) internal successors, (780), 7 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:43,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:43,254 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:43,254 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 134 flow. Second operand 7 states and 780 transitions. [2023-11-06 21:14:43,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 318 flow [2023-11-06 21:14:43,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 52 transitions, 282 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-11-06 21:14:43,260 INFO L231 Difference]: Finished difference. Result has 43 places, 27 transitions, 136 flow [2023-11-06 21:14:43,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=136, PETRI_PLACES=43, PETRI_TRANSITIONS=27} [2023-11-06 21:14:43,261 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 4 predicate places. [2023-11-06 21:14:43,261 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 27 transitions, 136 flow [2023-11-06 21:14:43,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.33333333333333) internal successors, (638), 6 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:43,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:14:43,262 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:14:43,280 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/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-06 21:14:43,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/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-06 21:14:43,474 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:14:43,475 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:43,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1774527175, now seen corresponding path program 1 times [2023-11-06 21:14:43,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:14:43,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1239497626] [2023-11-06 21:14:43,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:43,476 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-06 21:14:43,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:14:43,477 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/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-06 21:14:43,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/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-06 21:14:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:43,643 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 21:14:43,645 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:14:43,676 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-06 21:14:43,676 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:14:43,677 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:14:43,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1239497626] [2023-11-06 21:14:43,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1239497626] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:43,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:43,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:14:43,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894159309] [2023-11-06 21:14:43,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:43,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:14:43,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:14:43,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:14:43,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:14:43,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 251 [2023-11-06 21:14:43,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 27 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:43,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:14:43,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 251 [2023-11-06 21:14:43,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:14:43,835 INFO L124 PetriNetUnfolderBase]: 171/334 cut-off events. [2023-11-06 21:14:43,835 INFO L125 PetriNetUnfolderBase]: For 385/385 co-relation queries the response was YES. [2023-11-06 21:14:43,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1013 conditions, 334 events. 171/334 cut-off events. For 385/385 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1335 event pairs, 79 based on Foata normal form. 0/333 useless extension candidates. Maximal degree in co-relation 1003. Up to 198 conditions per place. [2023-11-06 21:14:43,838 INFO L140 encePairwiseOnDemand]: 248/251 looper letters, 45 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2023-11-06 21:14:43,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 348 flow [2023-11-06 21:14:43,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:14:43,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:14:43,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2023-11-06 21:14:43,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4860557768924303 [2023-11-06 21:14:43,841 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2023-11-06 21:14:43,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2023-11-06 21:14:43,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:14:43,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2023-11-06 21:14:43,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:43,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:43,846 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:43,846 INFO L175 Difference]: Start difference. First operand has 43 places, 27 transitions, 136 flow. Second operand 3 states and 366 transitions. [2023-11-06 21:14:43,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 348 flow [2023-11-06 21:14:43,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 48 transitions, 274 flow, removed 24 selfloop flow, removed 6 redundant places. [2023-11-06 21:14:43,853 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 110 flow [2023-11-06 21:14:43,853 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2023-11-06 21:14:43,856 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2023-11-06 21:14:43,856 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 110 flow [2023-11-06 21:14:43,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:43,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:14:43,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:14:43,879 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/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-06 21:14:44,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/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-06 21:14:44,074 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:14:44,074 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:44,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1981824027, now seen corresponding path program 2 times [2023-11-06 21:14:44,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:14:44,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [491800361] [2023-11-06 21:14:44,075 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 21:14:44,075 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-06 21:14:44,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:14:44,078 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/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-06 21:14:44,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/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-06 21:14:44,206 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 21:14:44,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:14:44,212 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 21:14:44,214 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:14:44,264 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-06 21:14:44,264 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:14:44,264 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:14:44,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [491800361] [2023-11-06 21:14:44,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [491800361] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:44,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:44,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:14:44,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710666063] [2023-11-06 21:14:44,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:44,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:14:44,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:14:44,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:14:44,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:14:44,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 251 [2023-11-06 21:14:44,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 113.5) internal successors, (454), 4 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:44,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:14:44,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 251 [2023-11-06 21:14:44,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:14:44,509 INFO L124 PetriNetUnfolderBase]: 202/423 cut-off events. [2023-11-06 21:14:44,509 INFO L125 PetriNetUnfolderBase]: For 384/384 co-relation queries the response was YES. [2023-11-06 21:14:44,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1259 conditions, 423 events. 202/423 cut-off events. For 384/384 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1934 event pairs, 31 based on Foata normal form. 1/424 useless extension candidates. Maximal degree in co-relation 1251. Up to 241 conditions per place. [2023-11-06 21:14:44,514 INFO L140 encePairwiseOnDemand]: 248/251 looper letters, 55 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-11-06 21:14:44,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 58 transitions, 347 flow [2023-11-06 21:14:44,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:14:44,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 21:14:44,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 478 transitions. [2023-11-06 21:14:44,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4760956175298805 [2023-11-06 21:14:44,517 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 478 transitions. [2023-11-06 21:14:44,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 478 transitions. [2023-11-06 21:14:44,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:14:44,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 478 transitions. [2023-11-06 21:14:44,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:44,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:44,522 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:44,523 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 110 flow. Second operand 4 states and 478 transitions. [2023-11-06 21:14:44,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 58 transitions, 347 flow [2023-11-06 21:14:44,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 58 transitions, 344 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 21:14:44,528 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 121 flow [2023-11-06 21:14:44,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-11-06 21:14:44,529 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2023-11-06 21:14:44,529 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 121 flow [2023-11-06 21:14:44,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.5) internal successors, (454), 4 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:44,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:14:44,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:14:44,547 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/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-06 21:14:44,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/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-06 21:14:44,743 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:14:44,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:44,743 INFO L85 PathProgramCache]: Analyzing trace with hash -153084933, now seen corresponding path program 3 times [2023-11-06 21:14:44,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:14:44,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [707735060] [2023-11-06 21:14:44,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 21:14:44,744 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-06 21:14:44,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:14:44,745 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/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-06 21:14:44,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/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-06 21:14:44,878 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-06 21:14:44,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:14:44,884 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-06 21:14:44,887 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:14:45,076 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-06 21:14:45,076 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:14:45,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:14:45,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [707735060] [2023-11-06 21:14:45,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [707735060] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:45,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:45,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:14:45,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200372012] [2023-11-06 21:14:45,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:45,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:14:45,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:14:45,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:14:45,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:14:45,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 251 [2023-11-06 21:14:45,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 121 flow. Second operand has 6 states, 6 states have (on average 109.83333333333333) internal successors, (659), 6 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:45,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:14:45,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 251 [2023-11-06 21:14:45,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:14:45,397 INFO L124 PetriNetUnfolderBase]: 201/451 cut-off events. [2023-11-06 21:14:45,397 INFO L125 PetriNetUnfolderBase]: For 498/498 co-relation queries the response was YES. [2023-11-06 21:14:45,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1422 conditions, 451 events. 201/451 cut-off events. For 498/498 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2185 event pairs, 58 based on Foata normal form. 1/451 useless extension candidates. Maximal degree in co-relation 1412. Up to 136 conditions per place. [2023-11-06 21:14:45,403 INFO L140 encePairwiseOnDemand]: 245/251 looper letters, 50 selfloop transitions, 6 changer transitions 0/59 dead transitions. [2023-11-06 21:14:45,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 59 transitions, 378 flow [2023-11-06 21:14:45,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:14:45,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 21:14:45,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 787 transitions. [2023-11-06 21:14:45,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4479225953329539 [2023-11-06 21:14:45,408 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 787 transitions. [2023-11-06 21:14:45,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 787 transitions. [2023-11-06 21:14:45,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:14:45,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 787 transitions. [2023-11-06 21:14:45,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 112.42857142857143) internal successors, (787), 7 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:45,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:45,418 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:45,419 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 121 flow. Second operand 7 states and 787 transitions. [2023-11-06 21:14:45,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 59 transitions, 378 flow [2023-11-06 21:14:45,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 59 transitions, 374 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 21:14:45,425 INFO L231 Difference]: Finished difference. Result has 49 places, 31 transitions, 144 flow [2023-11-06 21:14:45,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=144, PETRI_PLACES=49, PETRI_TRANSITIONS=31} [2023-11-06 21:14:45,426 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 10 predicate places. [2023-11-06 21:14:45,426 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 31 transitions, 144 flow [2023-11-06 21:14:45,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.83333333333333) internal successors, (659), 6 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:45,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:14:45,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:14:45,451 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-06 21:14:45,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/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-06 21:14:45,647 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 21:14:45,648 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:45,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1422678645, now seen corresponding path program 4 times [2023-11-06 21:14:45,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:14:45,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1126200991] [2023-11-06 21:14:45,648 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 21:14:45,649 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-06 21:14:45,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:14:45,650 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/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-06 21:14:45,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/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-06 21:14:45,806 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 21:14:45,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 21:14:45,807 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:14:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:14:45,974 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-06 21:14:45,975 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 21:14:45,976 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-06 21:14:45,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-06 21:14:45,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-06 21:14:45,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-06 21:14:45,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-06 21:14:45,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-06 21:14:45,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-06 21:14:45,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-06 21:14:45,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-06 21:14:45,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-06 21:14:45,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-06 21:14:45,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-06 21:14:45,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-06 21:14:45,996 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/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-06 21:14:46,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/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-06 21:14:46,196 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2023-11-06 21:14:46,202 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 21:14:46,203 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 21:14:46,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:14:46 BasicIcfg [2023-11-06 21:14:46,289 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 21:14:46,290 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 21:14:46,290 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 21:14:46,290 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 21:14:46,291 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:14:31" (3/4) ... [2023-11-06 21:14:46,292 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 21:14:46,300 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 21:14:46,301 INFO L158 Benchmark]: Toolchain (without parser) took 16820.18ms. Allocated memory was 69.2MB in the beginning and 134.2MB in the end (delta: 65.0MB). Free memory was 44.5MB in the beginning and 59.2MB in the end (delta: -14.6MB). Peak memory consumption was 52.3MB. Max. memory is 16.1GB. [2023-11-06 21:14:46,301 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 69.2MB. Free memory is still 45.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:14:46,302 INFO L158 Benchmark]: CACSL2BoogieTranslator took 703.48ms. Allocated memory was 69.2MB in the beginning and 92.3MB in the end (delta: 23.1MB). Free memory was 44.4MB in the beginning and 60.7MB in the end (delta: -16.4MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2023-11-06 21:14:46,302 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.65ms. Allocated memory is still 92.3MB. Free memory was 60.7MB in the beginning and 58.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:14:46,303 INFO L158 Benchmark]: Boogie Preprocessor took 88.90ms. Allocated memory is still 92.3MB. Free memory was 58.2MB in the beginning and 56.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:14:46,303 INFO L158 Benchmark]: RCFGBuilder took 977.02ms. Allocated memory is still 92.3MB. Free memory was 56.1MB in the beginning and 52.9MB in the end (delta: 3.2MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2023-11-06 21:14:46,304 INFO L158 Benchmark]: TraceAbstraction took 14932.96ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 52.3MB in the beginning and 59.2MB in the end (delta: -6.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2023-11-06 21:14:46,304 INFO L158 Benchmark]: Witness Printer took 10.38ms. Allocated memory is still 134.2MB. Free memory is still 59.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:14:46,306 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.28ms. Allocated memory is still 69.2MB. Free memory is still 45.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 703.48ms. Allocated memory was 69.2MB in the beginning and 92.3MB in the end (delta: 23.1MB). Free memory was 44.4MB in the beginning and 60.7MB in the end (delta: -16.4MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.65ms. Allocated memory is still 92.3MB. Free memory was 60.7MB in the beginning and 58.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 88.90ms. Allocated memory is still 92.3MB. Free memory was 58.2MB in the beginning and 56.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 977.02ms. Allocated memory is still 92.3MB. Free memory was 56.1MB in the beginning and 52.9MB in the end (delta: 3.2MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. * TraceAbstraction took 14932.96ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 52.3MB in the beginning and 59.2MB in the end (delta: -6.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Witness Printer took 10.38ms. Allocated memory is still 134.2MB. Free memory is still 59.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.0s, 129 PlacesBefore, 39 PlacesAfterwards, 122 TransitionsBefore, 30 TransitionsAfterwards, 2228 CoEnabledTransitionPairs, 7 FixpointIterations, 49 TrivialSequentialCompositions, 64 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 126 TotalNumberOfCompositions, 5199 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2417, independent: 2262, independent conditional: 0, independent unconditional: 2262, dependent: 155, dependent conditional: 0, dependent unconditional: 155, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1230, independent: 1197, independent conditional: 0, independent unconditional: 1197, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2417, independent: 1065, independent conditional: 0, independent unconditional: 1065, dependent: 122, dependent conditional: 0, dependent unconditional: 122, unknown: 1230, unknown conditional: 0, unknown unconditional: 1230] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 72, Positive conditional cache size: 0, Positive unconditional cache size: 72, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1394; [L824] FCALL, FORK 0 pthread_create(&t1394, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1394, ((void *)0), P0, ((void *)0))=0, t1394={-6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L825] 0 pthread_t t1395; [L826] FCALL, FORK 0 pthread_create(&t1395, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1395, ((void *)0), P1, ((void *)0))=1, t1394={-6:0}, t1395={-10:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L827] 0 pthread_t t1396; [L828] FCALL, FORK 0 pthread_create(&t1396, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1396, ((void *)0), P2, ((void *)0))=2, t1394={-6:0}, t1395={-10:0}, t1396={-2:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L786] 3 y$w_buff1 = y$w_buff0 [L787] 3 y$w_buff0 = 1 [L788] 3 y$w_buff1_used = y$w_buff0_used [L789] 3 y$w_buff0_used = (_Bool)1 [L790] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L790] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L791] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L792] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L793] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L794] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0: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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L798] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0: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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L758] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0: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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 y$flush_delayed = weak$$choice2 [L764] 2 y$mem_tmp = y [L765] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L766] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L767] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L768] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L769] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L771] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EAX = y [L773] 2 y = y$flush_delayed ? y$mem_tmp : y [L774] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L779] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 2 return 0; [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0: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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1394={-6:0}, t1395={-10:0}, t1396={-2:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L841] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) [L843] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix052_pso.opt_rmo.opt_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={5:6}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 821]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 826]: 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: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 149 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 232 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 175 mSDsluCounter, 100 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 813 IncrementalHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 39 mSDtfsCounter, 813 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=8, InterpolantAutomatonStates: 37, 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.4s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 327 SizeOfPredicates, 10 NumberOfNonLiveVariables, 895 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-06 21:14:46,338 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9abcf51d-2f13-4610-9acb-56b7691ea2ba/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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