./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff 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_c49fbcf0-a3e0-4374-9e20-dc7157eace3d/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49fbcf0-a3e0-4374-9e20-dc7157eace3d/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49fbcf0-a3e0-4374-9e20-dc7157eace3d/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49fbcf0-a3e0-4374-9e20-dc7157eace3d/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49fbcf0-a3e0-4374-9e20-dc7157eace3d/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49fbcf0-a3e0-4374-9e20-dc7157eace3d/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e61e21f5d7e6e4d5f8f06eb5177c457338190644d81fa4e1ee7a1000b79020da --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:40:36,236 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:40:36,314 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49fbcf0-a3e0-4374-9e20-dc7157eace3d/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-19 07:40:36,319 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:40:36,319 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:40:36,346 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:40:36,347 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:40:36,347 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:40:36,348 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:40:36,349 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:40:36,350 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:40:36,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:40:36,351 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:40:36,351 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:40:36,352 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:40:36,352 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:40:36,353 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:40:36,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:40:36,354 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 07:40:36,354 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 07:40:36,355 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 07:40:36,356 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:40:36,356 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 07:40:36,357 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:40:36,357 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:40:36,357 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:40:36,358 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:40:36,358 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:40:36,359 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:40:36,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:40:36,360 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:40:36,360 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:40:36,361 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:40:36,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:40:36,362 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:40:36,362 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:40:36,362 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:40:36,363 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:40:36,363 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_c49fbcf0-a3e0-4374-9e20-dc7157eace3d/bin/uautomizer-verify-uCwYo4JHxu/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_c49fbcf0-a3e0-4374-9e20-dc7157eace3d/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e61e21f5d7e6e4d5f8f06eb5177c457338190644d81fa4e1ee7a1000b79020da [2023-11-19 07:40:36,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:40:36,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:40:36,665 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:40:36,668 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:40:36,669 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:40:36,670 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49fbcf0-a3e0-4374-9e20-dc7157eace3d/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i [2023-11-19 07:40:39,942 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:40:40,218 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:40:40,224 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49fbcf0-a3e0-4374-9e20-dc7157eace3d/sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i [2023-11-19 07:40:40,253 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49fbcf0-a3e0-4374-9e20-dc7157eace3d/bin/uautomizer-verify-uCwYo4JHxu/data/aa0f6f9ff/802e9dcdb2e54756adf19f4ce5d876d0/FLAG6c6ac3aed [2023-11-19 07:40:40,268 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49fbcf0-a3e0-4374-9e20-dc7157eace3d/bin/uautomizer-verify-uCwYo4JHxu/data/aa0f6f9ff/802e9dcdb2e54756adf19f4ce5d876d0 [2023-11-19 07:40:40,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:40:40,272 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:40:40,274 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:40:40,274 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:40:40,285 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:40:40,286 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:40:40" (1/1) ... [2023-11-19 07:40:40,287 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61e2bc1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:40, skipping insertion in model container [2023-11-19 07:40:40,287 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:40:40" (1/1) ... [2023-11-19 07:40:40,358 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:40:40,924 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:40:40,951 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:40:41,055 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:40:41,106 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:40:41,106 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:40:41,114 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:40:41,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:41 WrapperNode [2023-11-19 07:40:41,115 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:40:41,117 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:40:41,117 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:40:41,117 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:40:41,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:41" (1/1) ... [2023-11-19 07:40:41,164 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:41" (1/1) ... [2023-11-19 07:40:41,219 INFO L138 Inliner]: procedures = 176, calls = 63, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 160 [2023-11-19 07:40:41,220 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:40:41,221 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:40:41,221 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:40:41,222 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:40:41,232 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:41" (1/1) ... [2023-11-19 07:40:41,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:41" (1/1) ... [2023-11-19 07:40:41,243 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:41" (1/1) ... [2023-11-19 07:40:41,243 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:41" (1/1) ... [2023-11-19 07:40:41,254 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:41" (1/1) ... [2023-11-19 07:40:41,281 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:41" (1/1) ... [2023-11-19 07:40:41,283 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:41" (1/1) ... [2023-11-19 07:40:41,291 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:41" (1/1) ... [2023-11-19 07:40:41,299 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:40:41,300 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:40:41,303 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:40:41,303 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:40:41,304 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:41" (1/1) ... [2023-11-19 07:40:41,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:40:41,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49fbcf0-a3e0-4374-9e20-dc7157eace3d/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:40:41,347 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49fbcf0-a3e0-4374-9e20-dc7157eace3d/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:40:41,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49fbcf0-a3e0-4374-9e20-dc7157eace3d/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:40:41,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:40:41,381 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:40:41,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:40:41,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:40:41,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:40:41,382 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:40:41,383 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:40:41,383 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:40:41,383 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:40:41,383 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 07:40:41,383 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 07:40:41,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:40:41,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:40:41,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:40:41,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:40:41,387 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 07:40:41,528 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:40:41,530 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:40:41,876 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:40:42,172 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:40:42,172 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:40:42,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:40:42 BoogieIcfgContainer [2023-11-19 07:40:42,179 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:40:42,182 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:40:42,183 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:40:42,186 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:40:42,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:40:40" (1/3) ... [2023-11-19 07:40:42,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@86577ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:40:42, skipping insertion in model container [2023-11-19 07:40:42,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:41" (2/3) ... [2023-11-19 07:40:42,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@86577ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:40:42, skipping insertion in model container [2023-11-19 07:40:42,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:40:42" (3/3) ... [2023-11-19 07:40:42,192 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033_tso.oepc.i [2023-11-19 07:40:42,211 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:40:42,211 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-19 07:40:42,211 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:40:42,269 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:40:42,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 135 transitions, 282 flow [2023-11-19 07:40:42,407 INFO L124 PetriNetUnfolderBase]: 4/132 cut-off events. [2023-11-19 07:40:42,411 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:40:42,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 132 events. 4/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2023-11-19 07:40:42,421 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 135 transitions, 282 flow [2023-11-19 07:40:42,432 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 132 transitions, 273 flow [2023-11-19 07:40:42,436 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:40:42,456 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 132 transitions, 273 flow [2023-11-19 07:40:42,461 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 132 transitions, 273 flow [2023-11-19 07:40:42,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 132 transitions, 273 flow [2023-11-19 07:40:42,512 INFO L124 PetriNetUnfolderBase]: 4/132 cut-off events. [2023-11-19 07:40:42,512 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:40:42,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 132 events. 4/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2023-11-19 07:40:42,516 INFO L119 LiptonReduction]: Number of co-enabled transitions 3142 [2023-11-19 07:40:48,776 INFO L134 LiptonReduction]: Checked pairs total: 8473 [2023-11-19 07:40:48,776 INFO L136 LiptonReduction]: Total number of compositions: 129 [2023-11-19 07:40:48,802 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:40:48,816 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;@54270e2c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:40:48,817 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-19 07:40:48,819 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:40:48,819 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-19 07:40:48,819 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:40:48,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:40:48,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-19 07:40:48,825 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 07:40:48,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:48,830 INFO L85 PathProgramCache]: Analyzing trace with hash 594, now seen corresponding path program 1 times [2023-11-19 07:40:48,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:48,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395721703] [2023-11-19 07:40:48,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:48,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:48,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:48,981 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-19 07:40:48,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:48,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395721703] [2023-11-19 07:40:48,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395721703] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:48,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:48,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 07:40:48,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089983876] [2023-11-19 07:40:48,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:48,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:40:49,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:49,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:40:49,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:40:49,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 264 [2023-11-19 07:40:49,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 79 flow. Second operand has 2 states, 2 states have (on average 120.5) internal successors, (241), 2 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:49,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:40:49,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 264 [2023-11-19 07:40:49,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:40:49,645 INFO L124 PetriNetUnfolderBase]: 1849/2769 cut-off events. [2023-11-19 07:40:49,645 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-11-19 07:40:49,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5522 conditions, 2769 events. 1849/2769 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 14196 event pairs, 1849 based on Foata normal form. 100/2360 useless extension candidates. Maximal degree in co-relation 5511. Up to 2699 conditions per place. [2023-11-19 07:40:49,676 INFO L140 encePairwiseOnDemand]: 257/264 looper letters, 24 selfloop transitions, 0 changer transitions 0/28 dead transitions. [2023-11-19 07:40:49,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 28 transitions, 113 flow [2023-11-19 07:40:49,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:40:49,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 07:40:49,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 271 transitions. [2023-11-19 07:40:49,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5132575757575758 [2023-11-19 07:40:49,701 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 271 transitions. [2023-11-19 07:40:49,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 271 transitions. [2023-11-19 07:40:49,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:40:49,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 271 transitions. [2023-11-19 07:40:49,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 135.5) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:49,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 264.0) internal successors, (792), 3 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:49,719 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 264.0) internal successors, (792), 3 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:49,721 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 79 flow. Second operand 2 states and 271 transitions. [2023-11-19 07:40:49,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 28 transitions, 113 flow [2023-11-19 07:40:49,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 28 transitions, 110 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-19 07:40:49,729 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 62 flow [2023-11-19 07:40:49,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2023-11-19 07:40:49,737 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -8 predicate places. [2023-11-19 07:40:49,737 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 62 flow [2023-11-19 07:40:49,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 120.5) internal successors, (241), 2 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:49,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:40:49,738 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 07:40:49,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:40:49,739 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 07:40:49,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:49,739 INFO L85 PathProgramCache]: Analyzing trace with hash 560120362, now seen corresponding path program 1 times [2023-11-19 07:40:49,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:49,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457202926] [2023-11-19 07:40:49,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:49,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:50,128 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-19 07:40:50,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:50,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457202926] [2023-11-19 07:40:50,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457202926] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:50,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:50,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:40:50,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185822322] [2023-11-19 07:40:50,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:50,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:40:50,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:50,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:40:50,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:40:50,136 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 264 [2023-11-19 07:40:50,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:50,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:40:50,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 264 [2023-11-19 07:40:50,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:40:50,546 INFO L124 PetriNetUnfolderBase]: 1447/2349 cut-off events. [2023-11-19 07:40:50,546 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:40:50,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4522 conditions, 2349 events. 1447/2349 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 13015 event pairs, 369 based on Foata normal form. 0/2104 useless extension candidates. Maximal degree in co-relation 4519. Up to 1711 conditions per place. [2023-11-19 07:40:50,563 INFO L140 encePairwiseOnDemand]: 261/264 looper letters, 33 selfloop transitions, 2 changer transitions 4/43 dead transitions. [2023-11-19 07:40:50,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 43 transitions, 172 flow [2023-11-19 07:40:50,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:40:50,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:40:50,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2023-11-19 07:40:50,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5012626262626263 [2023-11-19 07:40:50,567 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 397 transitions. [2023-11-19 07:40:50,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 397 transitions. [2023-11-19 07:40:50,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:40:50,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 397 transitions. [2023-11-19 07:40:50,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:50,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 264.0) internal successors, (1056), 4 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:50,573 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 264.0) internal successors, (1056), 4 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:50,574 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 62 flow. Second operand 3 states and 397 transitions. [2023-11-19 07:40:50,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 43 transitions, 172 flow [2023-11-19 07:40:50,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 43 transitions, 172 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:40:50,575 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 60 flow [2023-11-19 07:40:50,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-11-19 07:40:50,577 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -7 predicate places. [2023-11-19 07:40:50,577 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 60 flow [2023-11-19 07:40:50,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:50,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:40:50,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:40:50,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:40:50,578 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 07:40:50,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:50,579 INFO L85 PathProgramCache]: Analyzing trace with hash 770196362, now seen corresponding path program 1 times [2023-11-19 07:40:50,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:50,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866320116] [2023-11-19 07:40:50,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:50,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:51,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:40:51,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:51,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866320116] [2023-11-19 07:40:51,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866320116] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:51,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:51,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:40:51,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661737574] [2023-11-19 07:40:51,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:51,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:40:51,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:51,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:40:51,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:40:51,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 264 [2023-11-19 07:40:51,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 60 flow. Second operand has 6 states, 6 states have (on average 105.66666666666667) internal successors, (634), 6 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:51,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:40:51,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 264 [2023-11-19 07:40:51,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:40:52,090 INFO L124 PetriNetUnfolderBase]: 1899/2969 cut-off events. [2023-11-19 07:40:52,091 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2023-11-19 07:40:52,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5976 conditions, 2969 events. 1899/2969 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 16338 event pairs, 620 based on Foata normal form. 0/2901 useless extension candidates. Maximal degree in co-relation 5972. Up to 1161 conditions per place. [2023-11-19 07:40:52,115 INFO L140 encePairwiseOnDemand]: 259/264 looper letters, 52 selfloop transitions, 5 changer transitions 0/60 dead transitions. [2023-11-19 07:40:52,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 60 transitions, 250 flow [2023-11-19 07:40:52,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:40:52,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:40:52,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 683 transitions. [2023-11-19 07:40:52,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4311868686868687 [2023-11-19 07:40:52,119 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 683 transitions. [2023-11-19 07:40:52,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 683 transitions. [2023-11-19 07:40:52,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:40:52,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 683 transitions. [2023-11-19 07:40:52,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.83333333333333) internal successors, (683), 6 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:52,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 264.0) internal successors, (1848), 7 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:52,129 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 264.0) internal successors, (1848), 7 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:52,129 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 60 flow. Second operand 6 states and 683 transitions. [2023-11-19 07:40:52,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 60 transitions, 250 flow [2023-11-19 07:40:52,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 60 transitions, 244 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:40:52,134 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 82 flow [2023-11-19 07:40:52,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=82, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2023-11-19 07:40:52,136 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-11-19 07:40:52,136 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 82 flow [2023-11-19 07:40:52,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.66666666666667) internal successors, (634), 6 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:52,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:40:52,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:40:52,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:40:52,143 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 07:40:52,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:52,143 INFO L85 PathProgramCache]: Analyzing trace with hash 770196346, now seen corresponding path program 1 times [2023-11-19 07:40:52,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:52,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535721568] [2023-11-19 07:40:52,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:52,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:52,649 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-19 07:40:52,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:52,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535721568] [2023-11-19 07:40:52,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535721568] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:52,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:52,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:40:52,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652763753] [2023-11-19 07:40:52,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:52,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:40:52,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:52,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:40:52,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:40:52,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 264 [2023-11-19 07:40:52,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:52,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:40:52,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 264 [2023-11-19 07:40:52,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:40:53,544 INFO L124 PetriNetUnfolderBase]: 2955/4373 cut-off events. [2023-11-19 07:40:53,544 INFO L125 PetriNetUnfolderBase]: For 527/527 co-relation queries the response was YES. [2023-11-19 07:40:53,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9279 conditions, 4373 events. 2955/4373 cut-off events. For 527/527 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 22521 event pairs, 1267 based on Foata normal form. 144/4516 useless extension candidates. Maximal degree in co-relation 9272. Up to 3529 conditions per place. [2023-11-19 07:40:53,575 INFO L140 encePairwiseOnDemand]: 260/264 looper letters, 34 selfloop transitions, 3 changer transitions 22/60 dead transitions. [2023-11-19 07:40:53,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 60 transitions, 272 flow [2023-11-19 07:40:53,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:40:53,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:40:53,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2023-11-19 07:40:53,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44696969696969696 [2023-11-19 07:40:53,579 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 590 transitions. [2023-11-19 07:40:53,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 590 transitions. [2023-11-19 07:40:53,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:40:53,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 590 transitions. [2023-11-19 07:40:53,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:53,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 264.0) internal successors, (1584), 6 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:53,587 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 264.0) internal successors, (1584), 6 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:53,587 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 82 flow. Second operand 5 states and 590 transitions. [2023-11-19 07:40:53,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 60 transitions, 272 flow [2023-11-19 07:40:53,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 60 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:40:53,591 INFO L231 Difference]: Finished difference. Result has 46 places, 27 transitions, 93 flow [2023-11-19 07:40:53,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=93, PETRI_PLACES=46, PETRI_TRANSITIONS=27} [2023-11-19 07:40:53,594 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2023-11-19 07:40:53,594 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 27 transitions, 93 flow [2023-11-19 07:40:53,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:53,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:40:53,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:40:53,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:40:53,596 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 07:40:53,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:53,597 INFO L85 PathProgramCache]: Analyzing trace with hash 237523200, now seen corresponding path program 1 times [2023-11-19 07:40:53,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:53,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117478812] [2023-11-19 07:40:53,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:53,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:54,120 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-19 07:40:54,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:54,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117478812] [2023-11-19 07:40:54,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117478812] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:54,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:54,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:40:54,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724993509] [2023-11-19 07:40:54,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:54,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:40:54,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:54,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:40:54,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:40:54,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 264 [2023-11-19 07:40:54,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 27 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:54,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:40:54,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 264 [2023-11-19 07:40:54,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:40:55,016 INFO L124 PetriNetUnfolderBase]: 2767/4105 cut-off events. [2023-11-19 07:40:55,017 INFO L125 PetriNetUnfolderBase]: For 1510/1510 co-relation queries the response was YES. [2023-11-19 07:40:55,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9430 conditions, 4105 events. 2767/4105 cut-off events. For 1510/1510 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 20674 event pairs, 775 based on Foata normal form. 192/4296 useless extension candidates. Maximal degree in co-relation 9420. Up to 2665 conditions per place. [2023-11-19 07:40:55,051 INFO L140 encePairwiseOnDemand]: 259/264 looper letters, 50 selfloop transitions, 6 changer transitions 0/57 dead transitions. [2023-11-19 07:40:55,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 57 transitions, 282 flow [2023-11-19 07:40:55,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:40:55,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:40:55,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2023-11-19 07:40:55,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44393939393939397 [2023-11-19 07:40:55,054 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 586 transitions. [2023-11-19 07:40:55,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 586 transitions. [2023-11-19 07:40:55,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:40:55,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 586 transitions. [2023-11-19 07:40:55,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:55,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 264.0) internal successors, (1584), 6 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:55,062 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 264.0) internal successors, (1584), 6 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:55,062 INFO L175 Difference]: Start difference. First operand has 46 places, 27 transitions, 93 flow. Second operand 5 states and 586 transitions. [2023-11-19 07:40:55,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 57 transitions, 282 flow [2023-11-19 07:40:55,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 57 transitions, 261 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-11-19 07:40:55,107 INFO L231 Difference]: Finished difference. Result has 46 places, 31 transitions, 122 flow [2023-11-19 07:40:55,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=46, PETRI_TRANSITIONS=31} [2023-11-19 07:40:55,110 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2023-11-19 07:40:55,111 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 31 transitions, 122 flow [2023-11-19 07:40:55,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:55,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:40:55,112 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:40:55,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:40:55,112 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 07:40:55,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:55,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1481263218, now seen corresponding path program 1 times [2023-11-19 07:40:55,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:55,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296107952] [2023-11-19 07:40:55,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:55,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:55,797 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-19 07:40:55,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:55,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296107952] [2023-11-19 07:40:55,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296107952] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:55,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:55,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:40:55,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140009464] [2023-11-19 07:40:55,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:55,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:40:55,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:55,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:40:55,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:40:56,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 264 [2023-11-19 07:40:56,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 31 transitions, 122 flow. Second operand has 7 states, 7 states have (on average 102.57142857142857) internal successors, (718), 7 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:56,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:40:56,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 264 [2023-11-19 07:40:56,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:40:56,714 INFO L124 PetriNetUnfolderBase]: 1596/2558 cut-off events. [2023-11-19 07:40:56,715 INFO L125 PetriNetUnfolderBase]: For 787/787 co-relation queries the response was YES. [2023-11-19 07:40:56,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5890 conditions, 2558 events. 1596/2558 cut-off events. For 787/787 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 14149 event pairs, 730 based on Foata normal form. 104/2646 useless extension candidates. Maximal degree in co-relation 5880. Up to 2162 conditions per place. [2023-11-19 07:40:56,734 INFO L140 encePairwiseOnDemand]: 256/264 looper letters, 36 selfloop transitions, 12 changer transitions 4/57 dead transitions. [2023-11-19 07:40:56,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 57 transitions, 291 flow [2023-11-19 07:40:56,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:40:56,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:40:56,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 755 transitions. [2023-11-19 07:40:56,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40854978354978355 [2023-11-19 07:40:56,738 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 755 transitions. [2023-11-19 07:40:56,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 755 transitions. [2023-11-19 07:40:56,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:40:56,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 755 transitions. [2023-11-19 07:40:56,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.85714285714286) internal successors, (755), 7 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:56,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 264.0) internal successors, (2112), 8 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:56,746 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 264.0) internal successors, (2112), 8 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:56,746 INFO L175 Difference]: Start difference. First operand has 46 places, 31 transitions, 122 flow. Second operand 7 states and 755 transitions. [2023-11-19 07:40:56,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 57 transitions, 291 flow [2023-11-19 07:40:56,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 57 transitions, 287 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:40:56,755 INFO L231 Difference]: Finished difference. Result has 52 places, 34 transitions, 157 flow [2023-11-19 07:40:56,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=157, PETRI_PLACES=52, PETRI_TRANSITIONS=34} [2023-11-19 07:40:56,757 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 8 predicate places. [2023-11-19 07:40:56,757 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 34 transitions, 157 flow [2023-11-19 07:40:56,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.57142857142857) internal successors, (718), 7 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:56,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:40:56,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:40:56,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:40:56,758 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 07:40:56,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:56,759 INFO L85 PathProgramCache]: Analyzing trace with hash -475387025, now seen corresponding path program 1 times [2023-11-19 07:40:56,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:56,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682169304] [2023-11-19 07:40:56,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:56,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:56,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:57,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:40:57,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:57,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682169304] [2023-11-19 07:40:57,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682169304] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:57,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:57,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:40:57,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504535368] [2023-11-19 07:40:57,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:57,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:40:57,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:57,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:40:57,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:40:57,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 264 [2023-11-19 07:40:57,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 34 transitions, 157 flow. Second operand has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:57,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:40:57,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 264 [2023-11-19 07:40:57,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:40:57,892 INFO L124 PetriNetUnfolderBase]: 1841/3017 cut-off events. [2023-11-19 07:40:57,893 INFO L125 PetriNetUnfolderBase]: For 2192/2195 co-relation queries the response was YES. [2023-11-19 07:40:57,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8146 conditions, 3017 events. 1841/3017 cut-off events. For 2192/2195 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 17329 event pairs, 735 based on Foata normal form. 97/3108 useless extension candidates. Maximal degree in co-relation 8134. Up to 2335 conditions per place. [2023-11-19 07:40:57,911 INFO L140 encePairwiseOnDemand]: 257/264 looper letters, 49 selfloop transitions, 10 changer transitions 19/82 dead transitions. [2023-11-19 07:40:57,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 82 transitions, 502 flow [2023-11-19 07:40:57,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:40:57,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:40:57,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 751 transitions. [2023-11-19 07:40:57,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4741161616161616 [2023-11-19 07:40:57,915 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 751 transitions. [2023-11-19 07:40:57,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 751 transitions. [2023-11-19 07:40:57,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:40:57,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 751 transitions. [2023-11-19 07:40:57,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.16666666666667) internal successors, (751), 6 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:57,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 264.0) internal successors, (1848), 7 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:57,924 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 264.0) internal successors, (1848), 7 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:57,925 INFO L175 Difference]: Start difference. First operand has 52 places, 34 transitions, 157 flow. Second operand 6 states and 751 transitions. [2023-11-19 07:40:57,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 82 transitions, 502 flow [2023-11-19 07:40:57,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 82 transitions, 490 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-11-19 07:40:57,938 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 250 flow [2023-11-19 07:40:57,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=250, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2023-11-19 07:40:57,939 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 10 predicate places. [2023-11-19 07:40:57,941 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 250 flow [2023-11-19 07:40:57,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:57,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:40:57,944 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:40:57,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:40:57,944 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 07:40:57,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:57,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1256290212, now seen corresponding path program 1 times [2023-11-19 07:40:57,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:57,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713743340] [2023-11-19 07:40:57,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:57,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:58,550 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-19 07:40:58,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:58,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713743340] [2023-11-19 07:40:58,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713743340] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:58,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:58,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:40:58,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685150390] [2023-11-19 07:40:58,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:58,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:40:58,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:58,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:40:58,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:40:58,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 264 [2023-11-19 07:40:58,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 250 flow. Second operand has 7 states, 7 states have (on average 115.14285714285714) internal successors, (806), 7 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:58,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:40:58,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 264 [2023-11-19 07:40:58,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:40:59,361 INFO L124 PetriNetUnfolderBase]: 2140/3418 cut-off events. [2023-11-19 07:40:59,361 INFO L125 PetriNetUnfolderBase]: For 5666/5755 co-relation queries the response was YES. [2023-11-19 07:40:59,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11237 conditions, 3418 events. 2140/3418 cut-off events. For 5666/5755 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 19133 event pairs, 1191 based on Foata normal form. 92/3461 useless extension candidates. Maximal degree in co-relation 11223. Up to 2672 conditions per place. [2023-11-19 07:40:59,388 INFO L140 encePairwiseOnDemand]: 255/264 looper letters, 55 selfloop transitions, 24 changer transitions 14/97 dead transitions. [2023-11-19 07:40:59,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 97 transitions, 758 flow [2023-11-19 07:40:59,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:40:59,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:40:59,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 851 transitions. [2023-11-19 07:40:59,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4604978354978355 [2023-11-19 07:40:59,392 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 851 transitions. [2023-11-19 07:40:59,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 851 transitions. [2023-11-19 07:40:59,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:40:59,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 851 transitions. [2023-11-19 07:40:59,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.57142857142857) internal successors, (851), 7 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:59,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 264.0) internal successors, (2112), 8 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:59,401 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 264.0) internal successors, (2112), 8 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:59,401 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 250 flow. Second operand 7 states and 851 transitions. [2023-11-19 07:40:59,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 97 transitions, 758 flow [2023-11-19 07:40:59,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 97 transitions, 754 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-19 07:40:59,414 INFO L231 Difference]: Finished difference. Result has 61 places, 62 transitions, 489 flow [2023-11-19 07:40:59,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=489, PETRI_PLACES=61, PETRI_TRANSITIONS=62} [2023-11-19 07:40:59,415 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 17 predicate places. [2023-11-19 07:40:59,415 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 62 transitions, 489 flow [2023-11-19 07:40:59,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.14285714285714) internal successors, (806), 7 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:59,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:40:59,416 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:40:59,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:40:59,417 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 07:40:59,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:59,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1297272050, now seen corresponding path program 2 times [2023-11-19 07:40:59,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:59,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445751309] [2023-11-19 07:40:59,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:59,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:59,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:59,950 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-19 07:40:59,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:59,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445751309] [2023-11-19 07:40:59,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445751309] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:59,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:59,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:40:59,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459593012] [2023-11-19 07:40:59,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:59,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:40:59,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:59,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:40:59,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:40:59,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 264 [2023-11-19 07:40:59,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 62 transitions, 489 flow. Second operand has 7 states, 7 states have (on average 116.14285714285714) internal successors, (813), 7 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:59,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:40:59,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 264 [2023-11-19 07:40:59,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:41:00,782 INFO L124 PetriNetUnfolderBase]: 2188/3499 cut-off events. [2023-11-19 07:41:00,783 INFO L125 PetriNetUnfolderBase]: For 10190/10392 co-relation queries the response was YES. [2023-11-19 07:41:00,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13650 conditions, 3499 events. 2188/3499 cut-off events. For 10190/10392 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 19614 event pairs, 1183 based on Foata normal form. 150/3601 useless extension candidates. Maximal degree in co-relation 13632. Up to 2614 conditions per place. [2023-11-19 07:41:00,813 INFO L140 encePairwiseOnDemand]: 257/264 looper letters, 51 selfloop transitions, 26 changer transitions 16/97 dead transitions. [2023-11-19 07:41:00,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 97 transitions, 915 flow [2023-11-19 07:41:00,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:41:00,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:41:00,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 734 transitions. [2023-11-19 07:41:00,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4633838383838384 [2023-11-19 07:41:00,817 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 734 transitions. [2023-11-19 07:41:00,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 734 transitions. [2023-11-19 07:41:00,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:41:00,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 734 transitions. [2023-11-19 07:41:00,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:41:00,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 264.0) internal successors, (1848), 7 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:41:00,825 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 264.0) internal successors, (1848), 7 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:41:00,825 INFO L175 Difference]: Start difference. First operand has 61 places, 62 transitions, 489 flow. Second operand 6 states and 734 transitions. [2023-11-19 07:41:00,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 97 transitions, 915 flow [2023-11-19 07:41:00,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 97 transitions, 872 flow, removed 21 selfloop flow, removed 3 redundant places. [2023-11-19 07:41:00,861 INFO L231 Difference]: Finished difference. Result has 64 places, 66 transitions, 596 flow [2023-11-19 07:41:00,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=596, PETRI_PLACES=64, PETRI_TRANSITIONS=66} [2023-11-19 07:41:00,863 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 20 predicate places. [2023-11-19 07:41:00,863 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 66 transitions, 596 flow [2023-11-19 07:41:00,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.14285714285714) internal successors, (813), 7 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:41:00,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:41:00,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:41:00,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:41:00,864 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 07:41:00,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:00,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1820687584, now seen corresponding path program 1 times [2023-11-19 07:41:00,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:00,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186901563] [2023-11-19 07:41:00,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:00,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,038 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-19 07:41:01,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:01,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186901563] [2023-11-19 07:41:01,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186901563] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:01,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:01,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:41:01,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357958333] [2023-11-19 07:41:01,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:01,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:41:01,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:01,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:41:01,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:41:01,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 264 [2023-11-19 07:41:01,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 66 transitions, 596 flow. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:41:01,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:41:01,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 264 [2023-11-19 07:41:01,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:41:01,423 INFO L124 PetriNetUnfolderBase]: 1020/1735 cut-off events. [2023-11-19 07:41:01,423 INFO L125 PetriNetUnfolderBase]: For 9107/9283 co-relation queries the response was YES. [2023-11-19 07:41:01,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8010 conditions, 1735 events. 1020/1735 cut-off events. For 9107/9283 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9539 event pairs, 178 based on Foata normal form. 249/1956 useless extension candidates. Maximal degree in co-relation 7991. Up to 1300 conditions per place. [2023-11-19 07:41:01,443 INFO L140 encePairwiseOnDemand]: 259/264 looper letters, 81 selfloop transitions, 4 changer transitions 0/92 dead transitions. [2023-11-19 07:41:01,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 92 transitions, 974 flow [2023-11-19 07:41:01,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:41:01,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:41:01,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2023-11-19 07:41:01,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48358585858585856 [2023-11-19 07:41:01,446 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 383 transitions. [2023-11-19 07:41:01,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 383 transitions. [2023-11-19 07:41:01,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:41:01,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 383 transitions. [2023-11-19 07:41:01,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:41:01,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 264.0) internal successors, (1056), 4 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:41:01,452 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 264.0) internal successors, (1056), 4 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:41:01,452 INFO L175 Difference]: Start difference. First operand has 64 places, 66 transitions, 596 flow. Second operand 3 states and 383 transitions. [2023-11-19 07:41:01,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 92 transitions, 974 flow [2023-11-19 07:41:01,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 92 transitions, 924 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-19 07:41:01,470 INFO L231 Difference]: Finished difference. Result has 61 places, 66 transitions, 542 flow [2023-11-19 07:41:01,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=542, PETRI_PLACES=61, PETRI_TRANSITIONS=66} [2023-11-19 07:41:01,472 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 17 predicate places. [2023-11-19 07:41:01,472 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 66 transitions, 542 flow [2023-11-19 07:41:01,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:41:01,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:41:01,473 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:41:01,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:41:01,473 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 07:41:01,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:01,474 INFO L85 PathProgramCache]: Analyzing trace with hash 851658771, now seen corresponding path program 1 times [2023-11-19 07:41:01,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:01,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385478457] [2023-11-19 07:41:01,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:01,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:01,681 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-19 07:41:01,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:01,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385478457] [2023-11-19 07:41:01,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385478457] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:01,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:01,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:41:01,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378933327] [2023-11-19 07:41:01,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:01,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:41:01,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:01,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:41:01,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:41:01,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 264 [2023-11-19 07:41:01,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 66 transitions, 542 flow. Second operand has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:41:01,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:41:01,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 264 [2023-11-19 07:41:01,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:41:01,943 INFO L124 PetriNetUnfolderBase]: 485/920 cut-off events. [2023-11-19 07:41:01,943 INFO L125 PetriNetUnfolderBase]: For 4180/4281 co-relation queries the response was YES. [2023-11-19 07:41:01,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4330 conditions, 920 events. 485/920 cut-off events. For 4180/4281 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4793 event pairs, 92 based on Foata normal form. 163/1060 useless extension candidates. Maximal degree in co-relation 4312. Up to 332 conditions per place. [2023-11-19 07:41:01,952 INFO L140 encePairwiseOnDemand]: 259/264 looper letters, 89 selfloop transitions, 7 changer transitions 0/103 dead transitions. [2023-11-19 07:41:01,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 103 transitions, 1035 flow [2023-11-19 07:41:01,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:41:01,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:41:01,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 511 transitions. [2023-11-19 07:41:01,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48390151515151514 [2023-11-19 07:41:01,955 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 511 transitions. [2023-11-19 07:41:01,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 511 transitions. [2023-11-19 07:41:01,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:41:01,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 511 transitions. [2023-11-19 07:41:01,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:41:01,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 264.0) internal successors, (1320), 5 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:41:01,961 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 264.0) internal successors, (1320), 5 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:41:01,962 INFO L175 Difference]: Start difference. First operand has 61 places, 66 transitions, 542 flow. Second operand 4 states and 511 transitions. [2023-11-19 07:41:01,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 103 transitions, 1035 flow [2023-11-19 07:41:01,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 103 transitions, 1011 flow, removed 10 selfloop flow, removed 1 redundant places. [2023-11-19 07:41:01,972 INFO L231 Difference]: Finished difference. Result has 64 places, 67 transitions, 544 flow [2023-11-19 07:41:01,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=544, PETRI_PLACES=64, PETRI_TRANSITIONS=67} [2023-11-19 07:41:01,973 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 20 predicate places. [2023-11-19 07:41:01,973 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 67 transitions, 544 flow [2023-11-19 07:41:01,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:41:01,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:41:01,974 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:41:01,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:41:01,974 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 07:41:01,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:01,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1809319777, now seen corresponding path program 1 times [2023-11-19 07:41:01,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:01,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353952063] [2023-11-19 07:41:01,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:01,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:02,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:02,185 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-19 07:41:02,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:02,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353952063] [2023-11-19 07:41:02,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353952063] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:02,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:02,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:41:02,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457814378] [2023-11-19 07:41:02,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:02,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:41:02,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:02,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:41:02,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:41:02,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 264 [2023-11-19 07:41:02,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 67 transitions, 544 flow. Second operand has 5 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:41:02,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:41:02,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 264 [2023-11-19 07:41:02,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:41:02,435 INFO L124 PetriNetUnfolderBase]: 409/764 cut-off events. [2023-11-19 07:41:02,435 INFO L125 PetriNetUnfolderBase]: For 3703/3780 co-relation queries the response was YES. [2023-11-19 07:41:02,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3682 conditions, 764 events. 409/764 cut-off events. For 3703/3780 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3932 event pairs, 84 based on Foata normal form. 83/824 useless extension candidates. Maximal degree in co-relation 3663. Up to 332 conditions per place. [2023-11-19 07:41:02,442 INFO L140 encePairwiseOnDemand]: 259/264 looper letters, 84 selfloop transitions, 10 changer transitions 0/101 dead transitions. [2023-11-19 07:41:02,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 101 transitions, 1020 flow [2023-11-19 07:41:02,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:41:02,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:41:02,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 627 transitions. [2023-11-19 07:41:02,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2023-11-19 07:41:02,446 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 627 transitions. [2023-11-19 07:41:02,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 627 transitions. [2023-11-19 07:41:02,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:41:02,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 627 transitions. [2023-11-19 07:41:02,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:41:02,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 264.0) internal successors, (1584), 6 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:41:02,452 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 264.0) internal successors, (1584), 6 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:41:02,452 INFO L175 Difference]: Start difference. First operand has 64 places, 67 transitions, 544 flow. Second operand 5 states and 627 transitions. [2023-11-19 07:41:02,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 101 transitions, 1020 flow [2023-11-19 07:41:02,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 101 transitions, 950 flow, removed 15 selfloop flow, removed 5 redundant places. [2023-11-19 07:41:02,463 INFO L231 Difference]: Finished difference. Result has 64 places, 65 transitions, 499 flow [2023-11-19 07:41:02,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=499, PETRI_PLACES=64, PETRI_TRANSITIONS=65} [2023-11-19 07:41:02,464 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 20 predicate places. [2023-11-19 07:41:02,464 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 65 transitions, 499 flow [2023-11-19 07:41:02,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:41:02,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:41:02,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:41:02,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:41:02,466 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 07:41:02,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:02,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1092073949, now seen corresponding path program 1 times [2023-11-19 07:41:02,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:02,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749874892] [2023-11-19 07:41:02,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:02,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:02,957 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-19 07:41:02,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:02,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749874892] [2023-11-19 07:41:02,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749874892] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:02,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:02,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:41:02,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727440920] [2023-11-19 07:41:02,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:02,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:41:02,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:02,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:41:02,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:41:03,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 264 [2023-11-19 07:41:03,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 65 transitions, 499 flow. Second operand has 6 states, 6 states have (on average 107.83333333333333) internal successors, (647), 6 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:41:03,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:41:03,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 264 [2023-11-19 07:41:03,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:41:03,680 INFO L124 PetriNetUnfolderBase]: 1037/1754 cut-off events. [2023-11-19 07:41:03,680 INFO L125 PetriNetUnfolderBase]: For 6671/6775 co-relation queries the response was YES. [2023-11-19 07:41:03,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8027 conditions, 1754 events. 1037/1754 cut-off events. For 6671/6775 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 9333 event pairs, 82 based on Foata normal form. 101/1848 useless extension candidates. Maximal degree in co-relation 8009. Up to 800 conditions per place. [2023-11-19 07:41:03,692 INFO L140 encePairwiseOnDemand]: 256/264 looper letters, 79 selfloop transitions, 7 changer transitions 47/136 dead transitions. [2023-11-19 07:41:03,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 136 transitions, 1309 flow [2023-11-19 07:41:03,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:41:03,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:41:03,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 784 transitions. [2023-11-19 07:41:03,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2023-11-19 07:41:03,697 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 784 transitions. [2023-11-19 07:41:03,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 784 transitions. [2023-11-19 07:41:03,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:41:03,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 784 transitions. [2023-11-19 07:41:03,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:41:03,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 264.0) internal successors, (2112), 8 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:41:03,706 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 264.0) internal successors, (2112), 8 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:41:03,706 INFO L175 Difference]: Start difference. First operand has 64 places, 65 transitions, 499 flow. Second operand 7 states and 784 transitions. [2023-11-19 07:41:03,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 136 transitions, 1309 flow [2023-11-19 07:41:03,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 136 transitions, 1160 flow, removed 38 selfloop flow, removed 6 redundant places. [2023-11-19 07:41:03,731 INFO L231 Difference]: Finished difference. Result has 69 places, 66 transitions, 476 flow [2023-11-19 07:41:03,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=476, PETRI_PLACES=69, PETRI_TRANSITIONS=66} [2023-11-19 07:41:03,732 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 25 predicate places. [2023-11-19 07:41:03,732 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 476 flow [2023-11-19 07:41:03,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.83333333333333) internal successors, (647), 6 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:41:03,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:41:03,733 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:41:03,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 07:41:03,734 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 07:41:03,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:03,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1410057641, now seen corresponding path program 2 times [2023-11-19 07:41:03,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:03,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233121169] [2023-11-19 07:41:03,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:03,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:04,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:41:04,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:04,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233121169] [2023-11-19 07:41:04,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233121169] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:04,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:04,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:41:04,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282997025] [2023-11-19 07:41:04,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:04,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:41:04,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:04,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:41:04,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:41:04,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 264 [2023-11-19 07:41:04,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 476 flow. Second operand has 8 states, 8 states have (on average 114.75) internal successors, (918), 8 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:41:04,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:41:04,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 264 [2023-11-19 07:41:04,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:41:04,768 INFO L124 PetriNetUnfolderBase]: 688/1296 cut-off events. [2023-11-19 07:41:04,768 INFO L125 PetriNetUnfolderBase]: For 3687/3715 co-relation queries the response was YES. [2023-11-19 07:41:04,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5687 conditions, 1296 events. 688/1296 cut-off events. For 3687/3715 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6809 event pairs, 131 based on Foata normal form. 8/1289 useless extension candidates. Maximal degree in co-relation 5667. Up to 767 conditions per place. [2023-11-19 07:41:04,777 INFO L140 encePairwiseOnDemand]: 256/264 looper letters, 51 selfloop transitions, 4 changer transitions 83/141 dead transitions. [2023-11-19 07:41:04,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 141 transitions, 1254 flow [2023-11-19 07:41:04,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 07:41:04,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-19 07:41:04,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1187 transitions. [2023-11-19 07:41:04,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44962121212121214 [2023-11-19 07:41:04,782 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1187 transitions. [2023-11-19 07:41:04,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1187 transitions. [2023-11-19 07:41:04,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:41:04,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1187 transitions. [2023-11-19 07:41:04,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 118.7) internal successors, (1187), 10 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:41:04,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 264.0) internal successors, (2904), 11 states have internal predecessors, (2904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:41:04,794 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 264.0) internal successors, (2904), 11 states have internal predecessors, (2904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:41:04,795 INFO L175 Difference]: Start difference. First operand has 69 places, 66 transitions, 476 flow. Second operand 10 states and 1187 transitions. [2023-11-19 07:41:04,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 141 transitions, 1254 flow [2023-11-19 07:41:04,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 141 transitions, 1244 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-11-19 07:41:04,811 INFO L231 Difference]: Finished difference. Result has 78 places, 47 transitions, 326 flow [2023-11-19 07:41:04,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=326, PETRI_PLACES=78, PETRI_TRANSITIONS=47} [2023-11-19 07:41:04,812 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 34 predicate places. [2023-11-19 07:41:04,812 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 47 transitions, 326 flow [2023-11-19 07:41:04,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 114.75) internal successors, (918), 8 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:41:04,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:41:04,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:41:04,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 07:41:04,814 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 07:41:04,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:04,814 INFO L85 PathProgramCache]: Analyzing trace with hash 474396023, now seen corresponding path program 3 times [2023-11-19 07:41:04,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:04,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547236780] [2023-11-19 07:41:04,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:04,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:41:04,878 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:41:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:41:04,960 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:41:04,960 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:41:04,962 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-19 07:41:04,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-19 07:41:04,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-19 07:41:04,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-19 07:41:04,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-19 07:41:04,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-19 07:41:04,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-19 07:41:04,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-19 07:41:04,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-19 07:41:04,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-19 07:41:04,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-19 07:41:04,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-19 07:41:04,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-19 07:41:04,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 07:41:04,967 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:41:04,973 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 07:41:04,973 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:41:05,031 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-19 07:41:05,033 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 07:41:05,034 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 07:41:05,047 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-19 07:41:05,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:41:05 BasicIcfg [2023-11-19 07:41:05,069 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:41:05,070 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:41:05,070 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:41:05,070 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:41:05,071 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:40:42" (3/4) ... [2023-11-19 07:41:05,073 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 07:41:05,074 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:41:05,075 INFO L158 Benchmark]: Toolchain (without parser) took 24802.70ms. Allocated memory was 165.7MB in the beginning and 564.1MB in the end (delta: 398.5MB). Free memory was 118.7MB in the beginning and 241.9MB in the end (delta: -123.2MB). Peak memory consumption was 277.7MB. Max. memory is 16.1GB. [2023-11-19 07:41:05,075 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 134.2MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:41:05,075 INFO L158 Benchmark]: CACSL2BoogieTranslator took 842.11ms. Allocated memory is still 165.7MB. Free memory was 118.7MB in the beginning and 94.9MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-19 07:41:05,076 INFO L158 Benchmark]: Boogie Procedure Inliner took 103.64ms. Allocated memory is still 165.7MB. Free memory was 94.9MB in the beginning and 92.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 07:41:05,076 INFO L158 Benchmark]: Boogie Preprocessor took 78.58ms. Allocated memory is still 165.7MB. Free memory was 92.1MB in the beginning and 90.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:41:05,077 INFO L158 Benchmark]: RCFGBuilder took 878.97ms. Allocated memory is still 165.7MB. Free memory was 90.0MB in the beginning and 123.6MB in the end (delta: -33.6MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. [2023-11-19 07:41:05,077 INFO L158 Benchmark]: TraceAbstraction took 22887.04ms. Allocated memory was 165.7MB in the beginning and 564.1MB in the end (delta: 398.5MB). Free memory was 123.6MB in the beginning and 241.9MB in the end (delta: -118.3MB). Peak memory consumption was 281.2MB. Max. memory is 16.1GB. [2023-11-19 07:41:05,077 INFO L158 Benchmark]: Witness Printer took 4.23ms. Allocated memory is still 564.1MB. Free memory is still 241.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:41:05,079 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 134.2MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 842.11ms. Allocated memory is still 165.7MB. Free memory was 118.7MB in the beginning and 94.9MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 103.64ms. Allocated memory is still 165.7MB. Free memory was 94.9MB in the beginning and 92.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.58ms. Allocated memory is still 165.7MB. Free memory was 92.1MB in the beginning and 90.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 878.97ms. Allocated memory is still 165.7MB. Free memory was 90.0MB in the beginning and 123.6MB in the end (delta: -33.6MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. * TraceAbstraction took 22887.04ms. Allocated memory was 165.7MB in the beginning and 564.1MB in the end (delta: 398.5MB). Free memory was 123.6MB in the beginning and 241.9MB in the end (delta: -118.3MB). Peak memory consumption was 281.2MB. Max. memory is 16.1GB. * Witness Printer took 4.23ms. Allocated memory is still 564.1MB. Free memory is still 241.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.3s, 138 PlacesBefore, 44 PlacesAfterwards, 132 TransitionsBefore, 35 TransitionsAfterwards, 3142 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 68 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 3 ChoiceCompositions, 129 TotalNumberOfCompositions, 8473 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4417, independent: 4201, independent conditional: 0, independent unconditional: 4201, dependent: 216, dependent conditional: 0, dependent unconditional: 216, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1687, independent: 1652, independent conditional: 0, independent unconditional: 1652, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4417, independent: 2549, independent conditional: 0, independent unconditional: 2549, dependent: 181, dependent conditional: 0, dependent unconditional: 181, unknown: 1687, unknown conditional: 0, unknown unconditional: 1687] , Statistics on independence cache: Total cache size (in pairs): 163, Positive cache size: 146, Positive conditional cache size: 0, Positive unconditional cache size: 146, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, 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_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L726] 0 _Bool x$flush_delayed; [L727] 0 int x$mem_tmp; [L728] 0 _Bool x$r_buff0_thd0; [L729] 0 _Bool x$r_buff0_thd1; [L730] 0 _Bool x$r_buff0_thd2; [L731] 0 _Bool x$r_buff0_thd3; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$read_delayed; [L737] 0 int *x$read_delayed_var; [L738] 0 int x$w_buff0; [L739] 0 _Bool x$w_buff0_used; [L740] 0 int x$w_buff1; [L741] 0 _Bool x$w_buff1_used; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L840] 0 pthread_t t891; [L841] FCALL, FORK 0 pthread_create(&t891, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L842] 0 pthread_t t892; [L843] FCALL, FORK 0 pthread_create(&t892, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891={5:0}, t892={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L844] 0 pthread_t t893; [L845] FCALL, FORK 0 pthread_create(&t893, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891={5:0}, t892={6:0}, t893={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 2 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L780] 2 x$r_buff0_thd2 = (_Bool)1 [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L809] 3 a = 1 [L812] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L815] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L751] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L754] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L757] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L758] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L759] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L760] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L761] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L792] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L818] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L819] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L820] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L821] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L822] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L827] 3 return 0; [L847] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L849] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L849] RET 0 assume_abort_if_not(main$tmp_guard0) [L851] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L852] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L853] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L854] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L855] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t891={5:0}, t892={6:0}, t893={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L858] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L859] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L860] 0 x$flush_delayed = weak$$choice2 [L861] 0 x$mem_tmp = x [L862] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L863] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L864] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L865] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L866] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L868] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L870] 0 x = x$flush_delayed ? x$mem_tmp : x [L871] 0 x$flush_delayed = (_Bool)0 [L873] 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", "mix033_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, 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: 838]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 843]: 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: 845]: 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: 841]: 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, 164 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: 22.7s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 862 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 671 mSDsluCounter, 437 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 366 mSDsCounter, 113 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2134 IncrementalHoareTripleChecker+Invalid, 2247 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 113 mSolverCounterUnsat, 71 mSDtfsCounter, 2134 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=596occurred in iteration=9, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 221 NumberOfCodeBlocks, 221 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 183 ConstructedInterpolants, 0 QuantifiedInterpolants, 1778 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-19 07:41:05,131 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49fbcf0-a3e0-4374-9e20-dc7157eace3d/bin/uautomizer-verify-uCwYo4JHxu/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_c49fbcf0-a3e0-4374-9e20-dc7157eace3d/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49fbcf0-a3e0-4374-9e20-dc7157eace3d/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49fbcf0-a3e0-4374-9e20-dc7157eace3d/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49fbcf0-a3e0-4374-9e20-dc7157eace3d/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49fbcf0-a3e0-4374-9e20-dc7157eace3d/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49fbcf0-a3e0-4374-9e20-dc7157eace3d/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e61e21f5d7e6e4d5f8f06eb5177c457338190644d81fa4e1ee7a1000b79020da --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:41:07,749 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:41:07,882 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49fbcf0-a3e0-4374-9e20-dc7157eace3d/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-19 07:41:07,893 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:41:07,894 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:41:07,942 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:41:07,943 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:41:07,944 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:41:07,945 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:41:07,950 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:41:07,951 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:41:07,951 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:41:07,952 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:41:07,954 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:41:07,954 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:41:07,955 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:41:07,955 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:41:07,956 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:41:07,956 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 07:41:07,957 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 07:41:07,957 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 07:41:07,958 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:41:07,958 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 07:41:07,959 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-19 07:41:07,959 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-19 07:41:07,960 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:41:07,960 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:41:07,961 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:41:07,962 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:41:07,962 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:41:07,964 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:41:07,964 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:41:07,964 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:41:07,965 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:41:07,965 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-19 07:41:07,965 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-19 07:41:07,966 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:41:07,966 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:41:07,966 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:41:07,967 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-19 07:41:07,968 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:41:07,968 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_c49fbcf0-a3e0-4374-9e20-dc7157eace3d/bin/uautomizer-verify-uCwYo4JHxu/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_c49fbcf0-a3e0-4374-9e20-dc7157eace3d/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e61e21f5d7e6e4d5f8f06eb5177c457338190644d81fa4e1ee7a1000b79020da [2023-11-19 07:41:08,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:41:08,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:41:08,426 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:41:08,428 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:41:08,429 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:41:08,430 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49fbcf0-a3e0-4374-9e20-dc7157eace3d/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i [2023-11-19 07:41:11,708 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:41:12,141 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:41:12,144 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49fbcf0-a3e0-4374-9e20-dc7157eace3d/sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i [2023-11-19 07:41:12,170 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49fbcf0-a3e0-4374-9e20-dc7157eace3d/bin/uautomizer-verify-uCwYo4JHxu/data/7ebdb7f67/3344b7be97124815beb5e110ff4e7c22/FLAG744fd5293 [2023-11-19 07:41:12,191 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49fbcf0-a3e0-4374-9e20-dc7157eace3d/bin/uautomizer-verify-uCwYo4JHxu/data/7ebdb7f67/3344b7be97124815beb5e110ff4e7c22 [2023-11-19 07:41:12,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:41:12,198 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:41:12,202 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:41:12,202 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:41:12,207 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:41:12,208 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:41:12" (1/1) ... [2023-11-19 07:41:12,209 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8a872d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:12, skipping insertion in model container [2023-11-19 07:41:12,209 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:41:12" (1/1) ... [2023-11-19 07:41:12,282 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:41:12,836 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:41:12,852 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:41:12,919 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:41:12,967 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:41:12,967 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:41:12,975 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:41:12,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:12 WrapperNode [2023-11-19 07:41:12,976 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:41:12,978 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:41:12,978 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:41:12,978 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:41:12,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:12" (1/1) ... [2023-11-19 07:41:13,043 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:12" (1/1) ... [2023-11-19 07:41:13,089 INFO L138 Inliner]: procedures = 179, calls = 63, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 161 [2023-11-19 07:41:13,089 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:41:13,090 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:41:13,090 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:41:13,090 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:41:13,101 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:12" (1/1) ... [2023-11-19 07:41:13,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:12" (1/1) ... [2023-11-19 07:41:13,118 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:12" (1/1) ... [2023-11-19 07:41:13,122 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:12" (1/1) ... [2023-11-19 07:41:13,132 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:12" (1/1) ... [2023-11-19 07:41:13,148 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:12" (1/1) ... [2023-11-19 07:41:13,151 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:12" (1/1) ... [2023-11-19 07:41:13,164 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:12" (1/1) ... [2023-11-19 07:41:13,168 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:41:13,169 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:41:13,170 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:41:13,170 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:41:13,171 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:12" (1/1) ... [2023-11-19 07:41:13,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:41:13,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49fbcf0-a3e0-4374-9e20-dc7157eace3d/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:41:13,213 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49fbcf0-a3e0-4374-9e20-dc7157eace3d/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:41:13,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c49fbcf0-a3e0-4374-9e20-dc7157eace3d/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:41:13,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:41:13,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:41:13,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:41:13,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:41:13,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-19 07:41:13,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-19 07:41:13,270 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:41:13,270 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:41:13,270 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:41:13,271 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:41:13,271 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 07:41:13,271 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 07:41:13,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:41:13,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:41:13,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:41:13,275 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 07:41:13,436 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:41:13,438 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:41:14,020 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:41:14,180 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:41:14,180 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:41:14,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:41:14 BoogieIcfgContainer [2023-11-19 07:41:14,188 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:41:14,191 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:41:14,191 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:41:14,195 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:41:14,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:41:12" (1/3) ... [2023-11-19 07:41:14,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a5f889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:41:14, skipping insertion in model container [2023-11-19 07:41:14,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:12" (2/3) ... [2023-11-19 07:41:14,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a5f889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:41:14, skipping insertion in model container [2023-11-19 07:41:14,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:41:14" (3/3) ... [2023-11-19 07:41:14,200 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033_tso.oepc.i [2023-11-19 07:41:14,221 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:41:14,221 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-19 07:41:14,222 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:41:14,309 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:41:14,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 136 transitions, 284 flow [2023-11-19 07:41:14,484 INFO L124 PetriNetUnfolderBase]: 4/133 cut-off events. [2023-11-19 07:41:14,484 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:41:14,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 133 events. 4/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2023-11-19 07:41:14,492 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 136 transitions, 284 flow [2023-11-19 07:41:14,503 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 133 transitions, 275 flow [2023-11-19 07:41:14,508 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:41:14,531 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 133 transitions, 275 flow [2023-11-19 07:41:14,534 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 133 transitions, 275 flow [2023-11-19 07:41:14,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 133 transitions, 275 flow [2023-11-19 07:41:14,567 INFO L124 PetriNetUnfolderBase]: 4/133 cut-off events. [2023-11-19 07:41:14,567 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:41:14,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 133 events. 4/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2023-11-19 07:41:14,573 INFO L119 LiptonReduction]: Number of co-enabled transitions 3142