./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix011_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_938dd06d-9569-4706-914c-a275092e5809/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938dd06d-9569-4706-914c-a275092e5809/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_938dd06d-9569-4706-914c-a275092e5809/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938dd06d-9569-4706-914c-a275092e5809/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix011_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938dd06d-9569-4706-914c-a275092e5809/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_938dd06d-9569-4706-914c-a275092e5809/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 a4d86e141dde5935b04f74715dd2fbb14b0de9136d07674e0b6c5447ac95e0ef --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 08:05:34,346 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 08:05:34,473 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938dd06d-9569-4706-914c-a275092e5809/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-19 08:05:34,480 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 08:05:34,481 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 08:05:34,518 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 08:05:34,519 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 08:05:34,520 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 08:05:34,521 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 08:05:34,527 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 08:05:34,528 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 08:05:34,528 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 08:05:34,529 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 08:05:34,531 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 08:05:34,531 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 08:05:34,532 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 08:05:34,532 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 08:05:34,533 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 08:05:34,533 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 08:05:34,534 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 08:05:34,534 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 08:05:34,535 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 08:05:34,536 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 08:05:34,538 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 08:05:34,538 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 08:05:34,539 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 08:05:34,540 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 08:05:34,540 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 08:05:34,541 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 08:05:34,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:05:34,543 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 08:05:34,543 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 08:05:34,543 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 08:05:34,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 08:05:34,544 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 08:05:34,544 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 08:05:34,545 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 08:05:34,545 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 08:05:34,545 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_938dd06d-9569-4706-914c-a275092e5809/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_938dd06d-9569-4706-914c-a275092e5809/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 -> a4d86e141dde5935b04f74715dd2fbb14b0de9136d07674e0b6c5447ac95e0ef [2023-11-19 08:05:34,865 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 08:05:34,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 08:05:34,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 08:05:34,910 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 08:05:34,911 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 08:05:34,913 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938dd06d-9569-4706-914c-a275092e5809/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix011_tso.oepc.i [2023-11-19 08:05:38,036 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 08:05:38,385 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 08:05:38,385 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938dd06d-9569-4706-914c-a275092e5809/sv-benchmarks/c/pthread-wmm/mix011_tso.oepc.i [2023-11-19 08:05:38,403 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938dd06d-9569-4706-914c-a275092e5809/bin/uautomizer-verify-uCwYo4JHxu/data/360363fc7/6b3b327f66284236b9f756bb6f3b54ac/FLAG8c05c5225 [2023-11-19 08:05:38,421 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938dd06d-9569-4706-914c-a275092e5809/bin/uautomizer-verify-uCwYo4JHxu/data/360363fc7/6b3b327f66284236b9f756bb6f3b54ac [2023-11-19 08:05:38,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 08:05:38,426 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 08:05:38,428 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 08:05:38,428 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 08:05:38,434 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 08:05:38,435 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:05:38" (1/1) ... [2023-11-19 08:05:38,436 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67ce1344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:38, skipping insertion in model container [2023-11-19 08:05:38,436 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:05:38" (1/1) ... [2023-11-19 08:05:38,490 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 08:05:39,030 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:05:39,049 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 08:05:39,122 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:05:39,197 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 08:05:39,204 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 08:05:39,213 INFO L206 MainTranslator]: Completed translation [2023-11-19 08:05:39,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:39 WrapperNode [2023-11-19 08:05:39,214 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 08:05:39,216 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 08:05:39,217 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 08:05:39,217 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 08:05:39,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:39" (1/1) ... [2023-11-19 08:05:39,247 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:39" (1/1) ... [2023-11-19 08:05:39,286 INFO L138 Inliner]: procedures = 176, calls = 61, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 159 [2023-11-19 08:05:39,286 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 08:05:39,287 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 08:05:39,287 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 08:05:39,288 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 08:05:39,298 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:39" (1/1) ... [2023-11-19 08:05:39,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:39" (1/1) ... [2023-11-19 08:05:39,303 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:39" (1/1) ... [2023-11-19 08:05:39,304 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:39" (1/1) ... [2023-11-19 08:05:39,315 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:39" (1/1) ... [2023-11-19 08:05:39,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:39" (1/1) ... [2023-11-19 08:05:39,321 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:39" (1/1) ... [2023-11-19 08:05:39,323 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:39" (1/1) ... [2023-11-19 08:05:39,328 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 08:05:39,329 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 08:05:39,329 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 08:05:39,330 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 08:05:39,331 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:39" (1/1) ... [2023-11-19 08:05:39,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:05:39,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938dd06d-9569-4706-914c-a275092e5809/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:05:39,368 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938dd06d-9569-4706-914c-a275092e5809/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 08:05:39,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938dd06d-9569-4706-914c-a275092e5809/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 08:05:39,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 08:05:39,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 08:05:39,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 08:05:39,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 08:05:39,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 08:05:39,419 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 08:05:39,419 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 08:05:39,419 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 08:05:39,420 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 08:05:39,420 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 08:05:39,420 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 08:05:39,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 08:05:39,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 08:05:39,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 08:05:39,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 08:05:39,423 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 08:05:39,574 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 08:05:39,576 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 08:05:40,008 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 08:05:40,209 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 08:05:40,210 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 08:05:40,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:05:40 BoogieIcfgContainer [2023-11-19 08:05:40,214 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 08:05:40,217 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 08:05:40,217 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 08:05:40,221 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 08:05:40,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:05:38" (1/3) ... [2023-11-19 08:05:40,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@524130d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:05:40, skipping insertion in model container [2023-11-19 08:05:40,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:39" (2/3) ... [2023-11-19 08:05:40,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@524130d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:05:40, skipping insertion in model container [2023-11-19 08:05:40,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:05:40" (3/3) ... [2023-11-19 08:05:40,224 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011_tso.oepc.i [2023-11-19 08:05:40,246 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 08:05:40,246 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-19 08:05:40,246 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 08:05:40,332 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 08:05:40,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 133 transitions, 278 flow [2023-11-19 08:05:40,441 INFO L124 PetriNetUnfolderBase]: 4/130 cut-off events. [2023-11-19 08:05:40,441 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:05:40,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 130 events. 4/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-11-19 08:05:40,449 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 133 transitions, 278 flow [2023-11-19 08:05:40,455 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 130 transitions, 269 flow [2023-11-19 08:05:40,459 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 08:05:40,475 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 130 transitions, 269 flow [2023-11-19 08:05:40,480 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 130 transitions, 269 flow [2023-11-19 08:05:40,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 130 transitions, 269 flow [2023-11-19 08:05:40,567 INFO L124 PetriNetUnfolderBase]: 4/130 cut-off events. [2023-11-19 08:05:40,568 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:05:40,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 130 events. 4/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-11-19 08:05:40,576 INFO L119 LiptonReduction]: Number of co-enabled transitions 3024 [2023-11-19 08:05:46,615 INFO L134 LiptonReduction]: Checked pairs total: 8208 [2023-11-19 08:05:46,615 INFO L136 LiptonReduction]: Total number of compositions: 128 [2023-11-19 08:05:46,632 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:05:46,639 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;@41c9f7e1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:05:46,640 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-19 08:05:46,641 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 08:05:46,641 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-19 08:05:46,642 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:05:46,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:05:46,643 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-19 08:05:46,643 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 08:05:46,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:46,649 INFO L85 PathProgramCache]: Analyzing trace with hash 590, now seen corresponding path program 1 times [2023-11-19 08:05:46,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:46,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491662877] [2023-11-19 08:05:46,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:46,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:46,785 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 08:05:46,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:46,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491662877] [2023-11-19 08:05:46,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491662877] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:05:46,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:05:46,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 08:05:46,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270291953] [2023-11-19 08:05:46,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:05:46,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 08:05:46,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:46,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 08:05:46,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 08:05:46,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 261 [2023-11-19 08:05:46,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 79 flow. Second operand has 2 states, 2 states have (on average 118.5) internal successors, (237), 2 states have internal predecessors, (237), 0 states have call successors, (0), 0 states 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 08:05:46,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:05:46,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 261 [2023-11-19 08:05:46,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:05:47,311 INFO L124 PetriNetUnfolderBase]: 1461/2190 cut-off events. [2023-11-19 08:05:47,313 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-11-19 08:05:47,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4395 conditions, 2190 events. 1461/2190 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 10991 event pairs, 1461 based on Foata normal form. 80/1825 useless extension candidates. Maximal degree in co-relation 4384. Up to 2151 conditions per place. [2023-11-19 08:05:47,340 INFO L140 encePairwiseOnDemand]: 254/261 looper letters, 23 selfloop transitions, 0 changer transitions 0/28 dead transitions. [2023-11-19 08:05:47,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 28 transitions, 111 flow [2023-11-19 08:05:47,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 08:05:47,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 08:05:47,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 266 transitions. [2023-11-19 08:05:47,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5095785440613027 [2023-11-19 08:05:47,358 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 266 transitions. [2023-11-19 08:05:47,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 266 transitions. [2023-11-19 08:05:47,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:05:47,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 266 transitions. [2023-11-19 08:05:47,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 133.0) internal successors, (266), 2 states have internal predecessors, (266), 0 states have call successors, (0), 0 states 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 08:05:47,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 0 states 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 08:05:47,372 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 0 states 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 08:05:47,374 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 79 flow. Second operand 2 states and 266 transitions. [2023-11-19 08:05:47,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 28 transitions, 111 flow [2023-11-19 08:05:47,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 28 transitions, 108 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-19 08:05:47,381 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 62 flow [2023-11-19 08:05:47,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, 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 08:05:47,387 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -8 predicate places. [2023-11-19 08:05:47,388 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 62 flow [2023-11-19 08:05:47,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 118.5) internal successors, (237), 2 states have internal predecessors, (237), 0 states have call successors, (0), 0 states 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 08:05:47,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:05:47,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 08:05:47,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 08:05:47,389 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 08:05:47,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:47,390 INFO L85 PathProgramCache]: Analyzing trace with hash 556276206, now seen corresponding path program 1 times [2023-11-19 08:05:47,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:47,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136003622] [2023-11-19 08:05:47,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:47,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:47,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:47,774 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 08:05:47,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:47,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136003622] [2023-11-19 08:05:47,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136003622] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:05:47,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:05:47,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:05:47,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533128890] [2023-11-19 08:05:47,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:05:47,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:05:47,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:47,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:05:47,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:05:47,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 261 [2023-11-19 08:05:47,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:05:47,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:05:47,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 261 [2023-11-19 08:05:47,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:05:48,209 INFO L124 PetriNetUnfolderBase]: 1143/1978 cut-off events. [2023-11-19 08:05:48,209 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:05:48,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3719 conditions, 1978 events. 1143/1978 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 11874 event pairs, 189 based on Foata normal form. 0/1765 useless extension candidates. Maximal degree in co-relation 3716. Up to 1363 conditions per place. [2023-11-19 08:05:48,224 INFO L140 encePairwiseOnDemand]: 258/261 looper letters, 31 selfloop transitions, 2 changer transitions 4/42 dead transitions. [2023-11-19 08:05:48,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 42 transitions, 166 flow [2023-11-19 08:05:48,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:05:48,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:05:48,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2023-11-19 08:05:48,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49680715197956576 [2023-11-19 08:05:48,229 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 389 transitions. [2023-11-19 08:05:48,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 389 transitions. [2023-11-19 08:05:48,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:05:48,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 389 transitions. [2023-11-19 08:05:48,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states 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 08:05:48,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states 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 08:05:48,237 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states 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 08:05:48,237 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 62 flow. Second operand 3 states and 389 transitions. [2023-11-19 08:05:48,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 42 transitions, 166 flow [2023-11-19 08:05:48,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 166 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:05:48,240 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 60 flow [2023-11-19 08:05:48,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, 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 08:05:48,241 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -7 predicate places. [2023-11-19 08:05:48,241 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 60 flow [2023-11-19 08:05:48,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:05:48,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:05:48,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:05:48,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 08:05:48,243 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 08:05:48,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:48,244 INFO L85 PathProgramCache]: Analyzing trace with hash 170725775, now seen corresponding path program 1 times [2023-11-19 08:05:48,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:48,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382944149] [2023-11-19 08:05:48,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:48,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:48,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:49,071 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 08:05:49,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:49,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382944149] [2023-11-19 08:05:49,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382944149] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:05:49,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:05:49,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:05:49,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631774413] [2023-11-19 08:05:49,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:05:49,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:05:49,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:49,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:05:49,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:05:49,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 261 [2023-11-19 08:05:49,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 60 flow. Second operand has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states 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 08:05:49,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:05:49,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 261 [2023-11-19 08:05:49,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:05:49,826 INFO L124 PetriNetUnfolderBase]: 2127/3098 cut-off events. [2023-11-19 08:05:49,826 INFO L125 PetriNetUnfolderBase]: For 125/125 co-relation queries the response was YES. [2023-11-19 08:05:49,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6385 conditions, 3098 events. 2127/3098 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 14759 event pairs, 523 based on Foata normal form. 0/3001 useless extension candidates. Maximal degree in co-relation 6381. Up to 2105 conditions per place. [2023-11-19 08:05:49,852 INFO L140 encePairwiseOnDemand]: 256/261 looper letters, 54 selfloop transitions, 6 changer transitions 0/61 dead transitions. [2023-11-19 08:05:49,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 61 transitions, 256 flow [2023-11-19 08:05:49,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 08:05:49,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 08:05:49,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 567 transitions. [2023-11-19 08:05:49,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43448275862068964 [2023-11-19 08:05:49,856 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 567 transitions. [2023-11-19 08:05:49,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 567 transitions. [2023-11-19 08:05:49,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:05:49,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 567 transitions. [2023-11-19 08:05:49,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 0 states have call successors, (0), 0 states 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 08:05:49,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states 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 08:05:49,864 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states 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 08:05:49,864 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 60 flow. Second operand 5 states and 567 transitions. [2023-11-19 08:05:49,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 61 transitions, 256 flow [2023-11-19 08:05:49,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 61 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:05:49,868 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 93 flow [2023-11-19 08:05:49,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, 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=5, PETRI_FLOW=93, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2023-11-19 08:05:49,870 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -4 predicate places. [2023-11-19 08:05:49,870 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 93 flow [2023-11-19 08:05:49,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states 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 08:05:49,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:05:49,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:05:49,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 08:05:49,876 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 08:05:49,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:49,877 INFO L85 PathProgramCache]: Analyzing trace with hash 170725802, now seen corresponding path program 1 times [2023-11-19 08:05:49,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:49,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131073306] [2023-11-19 08:05:49,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:49,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:50,481 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 08:05:50,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:50,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131073306] [2023-11-19 08:05:50,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131073306] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:05:50,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:05:50,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:05:50,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893029004] [2023-11-19 08:05:50,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:05:50,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:05:50,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:50,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:05:50,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:05:50,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 261 [2023-11-19 08:05:50,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 93 flow. Second operand has 6 states, 6 states have (on average 103.66666666666667) internal successors, (622), 6 states have internal predecessors, (622), 0 states have call successors, (0), 0 states 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 08:05:50,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:05:50,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 261 [2023-11-19 08:05:50,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:05:51,276 INFO L124 PetriNetUnfolderBase]: 1478/2356 cut-off events. [2023-11-19 08:05:51,277 INFO L125 PetriNetUnfolderBase]: For 356/356 co-relation queries the response was YES. [2023-11-19 08:05:51,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5225 conditions, 2356 events. 1478/2356 cut-off events. For 356/356 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 13201 event pairs, 516 based on Foata normal form. 128/2452 useless extension candidates. Maximal degree in co-relation 5218. Up to 927 conditions per place. [2023-11-19 08:05:51,297 INFO L140 encePairwiseOnDemand]: 256/261 looper letters, 47 selfloop transitions, 5 changer transitions 2/58 dead transitions. [2023-11-19 08:05:51,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 265 flow [2023-11-19 08:05:51,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:05:51,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 08:05:51,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 667 transitions. [2023-11-19 08:05:51,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2023-11-19 08:05:51,301 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 667 transitions. [2023-11-19 08:05:51,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 667 transitions. [2023-11-19 08:05:51,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:05:51,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 667 transitions. [2023-11-19 08:05:51,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 0 states have call successors, (0), 0 states 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 08:05:51,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 261.0) internal successors, (1827), 7 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states 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 08:05:51,310 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 261.0) internal successors, (1827), 7 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states 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 08:05:51,310 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 93 flow. Second operand 6 states and 667 transitions. [2023-11-19 08:05:51,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 265 flow [2023-11-19 08:05:51,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 58 transitions, 265 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:05:51,314 INFO L231 Difference]: Finished difference. Result has 47 places, 27 transitions, 95 flow [2023-11-19 08:05:51,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=40, 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=6, PETRI_FLOW=95, PETRI_PLACES=47, PETRI_TRANSITIONS=27} [2023-11-19 08:05:51,316 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2023-11-19 08:05:51,316 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 27 transitions, 95 flow [2023-11-19 08:05:51,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.66666666666667) internal successors, (622), 6 states have internal predecessors, (622), 0 states have call successors, (0), 0 states 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 08:05:51,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:05:51,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:05:51,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 08:05:51,318 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 08:05:51,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:51,318 INFO L85 PathProgramCache]: Analyzing trace with hash 897660041, now seen corresponding path program 1 times [2023-11-19 08:05:51,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:51,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920227324] [2023-11-19 08:05:51,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:51,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:52,028 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 08:05:52,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:52,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920227324] [2023-11-19 08:05:52,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920227324] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:05:52,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:05:52,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 08:05:52,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217088420] [2023-11-19 08:05:52,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:05:52,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 08:05:52,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:52,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 08:05:52,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-19 08:05:52,127 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 261 [2023-11-19 08:05:52,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 27 transitions, 95 flow. Second operand has 7 states, 7 states have (on average 102.71428571428571) internal successors, (719), 7 states have internal predecessors, (719), 0 states have call successors, (0), 0 states 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 08:05:52,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:05:52,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 261 [2023-11-19 08:05:52,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:05:53,046 INFO L124 PetriNetUnfolderBase]: 2981/4420 cut-off events. [2023-11-19 08:05:53,046 INFO L125 PetriNetUnfolderBase]: For 1536/1536 co-relation queries the response was YES. [2023-11-19 08:05:53,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10098 conditions, 4420 events. 2981/4420 cut-off events. For 1536/1536 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 22496 event pairs, 587 based on Foata normal form. 208/4627 useless extension candidates. Maximal degree in co-relation 10088. Up to 2699 conditions per place. [2023-11-19 08:05:53,086 INFO L140 encePairwiseOnDemand]: 253/261 looper letters, 64 selfloop transitions, 15 changer transitions 0/80 dead transitions. [2023-11-19 08:05:53,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 80 transitions, 400 flow [2023-11-19 08:05:53,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 08:05:53,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 08:05:53,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 785 transitions. [2023-11-19 08:05:53,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42966611932129173 [2023-11-19 08:05:53,090 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 785 transitions. [2023-11-19 08:05:53,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 785 transitions. [2023-11-19 08:05:53,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:05:53,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 785 transitions. [2023-11-19 08:05:53,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 112.14285714285714) internal successors, (785), 7 states have internal predecessors, (785), 0 states have call successors, (0), 0 states 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 08:05:53,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 261.0) internal successors, (2088), 8 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states 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 08:05:53,100 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 261.0) internal successors, (2088), 8 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states 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 08:05:53,100 INFO L175 Difference]: Start difference. First operand has 47 places, 27 transitions, 95 flow. Second operand 7 states and 785 transitions. [2023-11-19 08:05:53,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 80 transitions, 400 flow [2023-11-19 08:05:53,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 80 transitions, 371 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-11-19 08:05:53,138 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 191 flow [2023-11-19 08:05:53,138 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=191, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2023-11-19 08:05:53,141 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 6 predicate places. [2023-11-19 08:05:53,141 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 191 flow [2023-11-19 08:05:53,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.71428571428571) internal successors, (719), 7 states have internal predecessors, (719), 0 states have call successors, (0), 0 states 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 08:05:53,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:05:53,142 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:05:53,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 08:05:53,143 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 08:05:53,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:53,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1182364234, now seen corresponding path program 1 times [2023-11-19 08:05:53,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:53,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931005468] [2023-11-19 08:05:53,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:53,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:53,706 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 08:05:53,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:53,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931005468] [2023-11-19 08:05:53,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931005468] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:05:53,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:05:53,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:05:53,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523388610] [2023-11-19 08:05:53,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:05:53,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:05:53,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:53,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:05:53,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:05:53,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 261 [2023-11-19 08:05:53,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 0 states have call successors, (0), 0 states 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 08:05:53,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:05:53,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 261 [2023-11-19 08:05:53,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:05:54,444 INFO L124 PetriNetUnfolderBase]: 1464/2366 cut-off events. [2023-11-19 08:05:54,445 INFO L125 PetriNetUnfolderBase]: For 2016/2019 co-relation queries the response was YES. [2023-11-19 08:05:54,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6508 conditions, 2366 events. 1464/2366 cut-off events. For 2016/2019 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 13244 event pairs, 251 based on Foata normal form. 101/2448 useless extension candidates. Maximal degree in co-relation 6496. Up to 1423 conditions per place. [2023-11-19 08:05:54,470 INFO L140 encePairwiseOnDemand]: 256/261 looper letters, 37 selfloop transitions, 6 changer transitions 6/54 dead transitions. [2023-11-19 08:05:54,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 54 transitions, 328 flow [2023-11-19 08:05:54,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:05:54,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 08:05:54,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 652 transitions. [2023-11-19 08:05:54,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4163473818646232 [2023-11-19 08:05:54,475 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 652 transitions. [2023-11-19 08:05:54,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 652 transitions. [2023-11-19 08:05:54,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:05:54,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 652 transitions. [2023-11-19 08:05:54,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 0 states have call successors, (0), 0 states 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 08:05:54,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 261.0) internal successors, (1827), 7 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states 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 08:05:54,482 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 261.0) internal successors, (1827), 7 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states 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 08:05:54,482 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 191 flow. Second operand 6 states and 652 transitions. [2023-11-19 08:05:54,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 54 transitions, 328 flow [2023-11-19 08:05:54,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 54 transitions, 327 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 08:05:54,492 INFO L231 Difference]: Finished difference. Result has 53 places, 30 transitions, 133 flow [2023-11-19 08:05:54,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=133, PETRI_PLACES=53, PETRI_TRANSITIONS=30} [2023-11-19 08:05:54,495 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places. [2023-11-19 08:05:54,496 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 30 transitions, 133 flow [2023-11-19 08:05:54,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 0 states have call successors, (0), 0 states 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 08:05:54,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:05:54,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:05:54,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 08:05:54,497 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 08:05:54,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:54,498 INFO L85 PathProgramCache]: Analyzing trace with hash -523855297, now seen corresponding path program 1 times [2023-11-19 08:05:54,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:54,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485007127] [2023-11-19 08:05:54,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:54,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:55,214 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 08:05:55,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:55,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485007127] [2023-11-19 08:05:55,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485007127] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:05:55,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:05:55,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:05:55,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841183236] [2023-11-19 08:05:55,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:05:55,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:05:55,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:55,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:05:55,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:05:55,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 261 [2023-11-19 08:05:55,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 30 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 0 states have call successors, (0), 0 states 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 08:05:55,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:05:55,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 261 [2023-11-19 08:05:55,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:05:55,881 INFO L124 PetriNetUnfolderBase]: 1554/2560 cut-off events. [2023-11-19 08:05:55,882 INFO L125 PetriNetUnfolderBase]: For 2454/2483 co-relation queries the response was YES. [2023-11-19 08:05:55,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6863 conditions, 2560 events. 1554/2560 cut-off events. For 2454/2483 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 14686 event pairs, 682 based on Foata normal form. 94/2593 useless extension candidates. Maximal degree in co-relation 6851. Up to 1985 conditions per place. [2023-11-19 08:05:55,920 INFO L140 encePairwiseOnDemand]: 254/261 looper letters, 41 selfloop transitions, 8 changer transitions 14/69 dead transitions. [2023-11-19 08:05:55,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 69 transitions, 391 flow [2023-11-19 08:05:55,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:05:55,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 08:05:55,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 718 transitions. [2023-11-19 08:05:55,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45849297573435505 [2023-11-19 08:05:55,926 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 718 transitions. [2023-11-19 08:05:55,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 718 transitions. [2023-11-19 08:05:55,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:05:55,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 718 transitions. [2023-11-19 08:05:55,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.66666666666667) internal successors, (718), 6 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 08:05:55,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 261.0) internal successors, (1827), 7 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states 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 08:05:55,934 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 261.0) internal successors, (1827), 7 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states 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 08:05:55,934 INFO L175 Difference]: Start difference. First operand has 53 places, 30 transitions, 133 flow. Second operand 6 states and 718 transitions. [2023-11-19 08:05:55,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 69 transitions, 391 flow [2023-11-19 08:05:55,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 69 transitions, 369 flow, removed 2 selfloop flow, removed 6 redundant places. [2023-11-19 08:05:55,945 INFO L231 Difference]: Finished difference. Result has 53 places, 37 transitions, 195 flow [2023-11-19 08:05:55,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=195, PETRI_PLACES=53, PETRI_TRANSITIONS=37} [2023-11-19 08:05:55,946 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places. [2023-11-19 08:05:55,946 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 37 transitions, 195 flow [2023-11-19 08:05:55,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 0 states have call successors, (0), 0 states 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 08:05:55,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:05:55,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:05:55,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 08:05:55,947 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 08:05:55,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:55,947 INFO L85 PathProgramCache]: Analyzing trace with hash -769731766, now seen corresponding path program 1 times [2023-11-19 08:05:55,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:55,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296977949] [2023-11-19 08:05:55,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:55,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:56,580 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 08:05:56,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:56,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296977949] [2023-11-19 08:05:56,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296977949] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:05:56,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:05:56,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 08:05:56,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650418512] [2023-11-19 08:05:56,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:05:56,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 08:05:56,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:56,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 08:05:56,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 08:05:56,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 261 [2023-11-19 08:05:56,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 37 transitions, 195 flow. Second operand has 7 states, 7 states have (on average 99.28571428571429) internal successors, (695), 7 states have internal predecessors, (695), 0 states have call successors, (0), 0 states 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 08:05:56,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:05:56,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 261 [2023-11-19 08:05:56,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:05:57,987 INFO L124 PetriNetUnfolderBase]: 3319/4930 cut-off events. [2023-11-19 08:05:57,987 INFO L125 PetriNetUnfolderBase]: For 6209/6209 co-relation queries the response was YES. [2023-11-19 08:05:58,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15354 conditions, 4930 events. 3319/4930 cut-off events. For 6209/6209 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 24033 event pairs, 1163 based on Foata normal form. 106/5036 useless extension candidates. Maximal degree in co-relation 15340. Up to 4182 conditions per place. [2023-11-19 08:05:58,031 INFO L140 encePairwiseOnDemand]: 248/261 looper letters, 79 selfloop transitions, 36 changer transitions 16/131 dead transitions. [2023-11-19 08:05:58,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 131 transitions, 862 flow [2023-11-19 08:05:58,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 08:05:58,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-19 08:05:58,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1083 transitions. [2023-11-19 08:05:58,037 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4149425287356322 [2023-11-19 08:05:58,037 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1083 transitions. [2023-11-19 08:05:58,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1083 transitions. [2023-11-19 08:05:58,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:05:58,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1083 transitions. [2023-11-19 08:05:58,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 108.3) internal successors, (1083), 10 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states 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 08:05:58,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 261.0) internal successors, (2871), 11 states have internal predecessors, (2871), 0 states have call successors, (0), 0 states 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 08:05:58,048 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 261.0) internal successors, (2871), 11 states have internal predecessors, (2871), 0 states have call successors, (0), 0 states 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 08:05:58,048 INFO L175 Difference]: Start difference. First operand has 53 places, 37 transitions, 195 flow. Second operand 10 states and 1083 transitions. [2023-11-19 08:05:58,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 131 transitions, 862 flow [2023-11-19 08:05:58,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 131 transitions, 858 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-19 08:05:58,070 INFO L231 Difference]: Finished difference. Result has 65 places, 70 transitions, 522 flow [2023-11-19 08:05:58,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=522, PETRI_PLACES=65, PETRI_TRANSITIONS=70} [2023-11-19 08:05:58,072 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 21 predicate places. [2023-11-19 08:05:58,073 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 70 transitions, 522 flow [2023-11-19 08:05:58,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 99.28571428571429) internal successors, (695), 7 states have internal predecessors, (695), 0 states have call successors, (0), 0 states 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 08:05:58,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:05:58,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:05:58,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 08:05:58,075 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 08:05:58,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:58,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1228997624, now seen corresponding path program 2 times [2023-11-19 08:05:58,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:58,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666544094] [2023-11-19 08:05:58,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:58,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:58,703 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 08:05:58,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:58,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666544094] [2023-11-19 08:05:58,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666544094] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:05:58,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:05:58,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 08:05:58,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062083996] [2023-11-19 08:05:58,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:05:58,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 08:05:58,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:58,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 08:05:58,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 08:05:58,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 261 [2023-11-19 08:05:58,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 70 transitions, 522 flow. Second operand has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 0 states have call successors, (0), 0 states 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 08:05:58,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:05:58,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 261 [2023-11-19 08:05:58,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:05:59,615 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L851-->L18-1: Formula: (let ((.cse2 (= (mod v_~x$r_buff1_thd0~0_84 256) 0)) (.cse9 (= (mod v_~x$r_buff0_thd0~0_80 256) 0))) (let ((.cse10 (not .cse9)) (.cse5 (and .cse2 .cse9)) (.cse6 (and .cse9 (= (mod v_~x$w_buff1_used~0_143 256) 0))) (.cse12 (= (mod v_~x$w_buff0_used~0_170 256) 0))) (let ((.cse7 (or .cse5 .cse6 .cse12)) (.cse8 (and .cse10 (not .cse12)))) (let ((.cse3 (= (mod v_~x$w_buff1_used~0_142 256) 0)) (.cse4 (= (mod v_~x$w_buff0_used~0_169 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_38 256) 0))) (.cse11 (ite .cse7 v_~x~0_104 (ite .cse8 v_~x$w_buff0~0_92 v_~x$w_buff1~0_77)))) (and (= v_~x$mem_tmp~0_22 v_~x~0_104) (= v_~x$r_buff1_thd0~0_83 (ite .cse0 v_~x$r_buff1_thd0~0_84 (ite (let ((.cse1 (= 0 (mod v_~x$r_buff0_thd0~0_79 256)))) (or (and .cse1 .cse2) (and .cse1 .cse3) .cse4)) v_~x$r_buff1_thd0~0_84 0))) (= (mod v_~main$tmp_guard1~0_20 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_10|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_10| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_18|) (= v_~x$w_buff1~0_77 v_~x$w_buff1~0_76) (= v_~x$w_buff1_used~0_142 (ite .cse0 v_~x$w_buff1_used~0_143 (ite (or .cse5 .cse6 .cse4) v_~x$w_buff1_used~0_143 0))) (= (ite .cse0 v_~x$w_buff0_used~0_170 (ite .cse7 v_~x$w_buff0_used~0_170 (ite .cse8 0 v_~x$w_buff0_used~0_170))) v_~x$w_buff0_used~0_169) (= v_~x$r_buff0_thd0~0_79 (ite .cse0 v_~x$r_buff0_thd0~0_80 (ite (or .cse5 (and .cse3 .cse9) .cse4) v_~x$r_buff0_thd0~0_80 (ite (and .cse10 (not .cse4)) 0 v_~x$r_buff0_thd0~0_80)))) (= (ite .cse0 v_~x$mem_tmp~0_22 .cse11) v_~x~0_103) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_20 1) (= 2 .cse11) (= v_~__unbuffered_p2_EBX~0_20 0) (= v_~__unbuffered_p1_EAX~0_18 1) (= v_~__unbuffered_p1_EBX~0_18 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_20) (= v_~x$flush_delayed~0_35 0) (= v_~x$w_buff0~0_92 v_~x$w_buff0~0_91)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_92, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_80, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~x$w_buff1~0=v_~x$w_buff1~0_77, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_84, ~x~0=v_~x~0_104, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_170} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_91, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_79, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_18|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_34|, ~x$flush_delayed~0=v_~x$flush_delayed~0_35, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_28|, ~x$w_buff1~0=v_~x$w_buff1~0_76, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_22, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_83, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_169, ~weak$$choice0~0=v_~weak$$choice0~0_21, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_10|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~weak$$choice2~0=v_~weak$$choice2~0_38, ~x~0=v_~x~0_103} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet9#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~weak$$choice2~0, ~x~0][92], [P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 201#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 199#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 196#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 165#(and (not (= |ULTIMATE.start_main_~#t299~0#1.base| |ULTIMATE.start_main_~#t301~0#1.base|)) (not (= |ULTIMATE.start_main_~#t300~0#1.base| |ULTIMATE.start_main_~#t301~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t299~0#1.base| 0) |ULTIMATE.start_main_~#t300~0#1.base| 0) |ULTIMATE.start_main_~#t301~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t300~0#1.base| |ULTIMATE.start_main_~#t299~0#1.base|))), 21#L788true, Black: 151#(= ~__unbuffered_p1_EAX~0 0), Black: 211#(and (= 0 ~x$w_buff1~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 142#true, Black: 213#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 215#(and (= 0 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 219#(and (or (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0)) (not (= ~__unbuffered_p1_EAX~0 1))) (or (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= ~__unbuffered_p1_EAX~0 1)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 217#(and (= 0 ~x$w_buff0~0) (= ~x~0 1) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= 0 ~x$r_buff0_thd0~0)), Black: 212#(and (or (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0)) (not (= ~__unbuffered_p1_EAX~0 1))) (or (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= ~__unbuffered_p1_EAX~0 1)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 1)))), 193#true, Black: 163#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t300~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t299~0#1.base|) 0)) (= (store (store |#valid| |ULTIMATE.start_main_~#t299~0#1.base| 0) |ULTIMATE.start_main_~#t300~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t300~0#1.base| |ULTIMATE.start_main_~#t299~0#1.base|)) (not (= ~__unbuffered_p1_EAX~0 1))), 191#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t301~0#1.base| 0) |ULTIMATE.start_main_~#t299~0#1.base| 0) |ULTIMATE.start_main_~#t300~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t299~0#1.base| |ULTIMATE.start_main_~#t301~0#1.base|)) (not (= |ULTIMATE.start_main_~#t300~0#1.base| |ULTIMATE.start_main_~#t301~0#1.base|)) (not (= |ULTIMATE.start_main_~#t300~0#1.base| |ULTIMATE.start_main_~#t299~0#1.base|))), 57#L18-1true, 40#L808true, 116#P0EXITtrue, 227#true, Black: 171#(and (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 177#(and (= ~x$w_buff0_used~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 172#(and (= ~x$w_buff0_used~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0)), 169#true, 207#true]) [2023-11-19 08:05:59,616 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is not cut-off event [2023-11-19 08:05:59,616 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2023-11-19 08:05:59,616 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2023-11-19 08:05:59,617 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2023-11-19 08:05:59,870 INFO L124 PetriNetUnfolderBase]: 2352/3851 cut-off events. [2023-11-19 08:05:59,870 INFO L125 PetriNetUnfolderBase]: For 13207/13438 co-relation queries the response was YES. [2023-11-19 08:05:59,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15169 conditions, 3851 events. 2352/3851 cut-off events. For 13207/13438 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 22499 event pairs, 573 based on Foata normal form. 169/3848 useless extension candidates. Maximal degree in co-relation 15149. Up to 2453 conditions per place. [2023-11-19 08:05:59,925 INFO L140 encePairwiseOnDemand]: 252/261 looper letters, 54 selfloop transitions, 35 changer transitions 12/114 dead transitions. [2023-11-19 08:05:59,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 114 transitions, 918 flow [2023-11-19 08:05:59,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 08:05:59,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-19 08:05:59,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 949 transitions. [2023-11-19 08:05:59,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45450191570881227 [2023-11-19 08:05:59,933 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 949 transitions. [2023-11-19 08:05:59,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 949 transitions. [2023-11-19 08:05:59,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:05:59,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 949 transitions. [2023-11-19 08:05:59,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 118.625) internal successors, (949), 8 states have internal predecessors, (949), 0 states have call successors, (0), 0 states 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 08:05:59,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 261.0) internal successors, (2349), 9 states have internal predecessors, (2349), 0 states have call successors, (0), 0 states 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 08:05:59,945 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 261.0) internal successors, (2349), 9 states have internal predecessors, (2349), 0 states have call successors, (0), 0 states 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 08:05:59,945 INFO L175 Difference]: Start difference. First operand has 65 places, 70 transitions, 522 flow. Second operand 8 states and 949 transitions. [2023-11-19 08:05:59,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 114 transitions, 918 flow [2023-11-19 08:06:00,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 114 transitions, 868 flow, removed 25 selfloop flow, removed 1 redundant places. [2023-11-19 08:06:00,007 INFO L231 Difference]: Finished difference. Result has 72 places, 73 transitions, 607 flow [2023-11-19 08:06:00,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=607, PETRI_PLACES=72, PETRI_TRANSITIONS=73} [2023-11-19 08:06:00,009 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 28 predicate places. [2023-11-19 08:06:00,009 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 73 transitions, 607 flow [2023-11-19 08:06:00,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 0 states have call successors, (0), 0 states 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 08:06:00,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:06:00,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:06:00,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 08:06:00,010 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 08:06:00,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:06:00,011 INFO L85 PathProgramCache]: Analyzing trace with hash -450997822, now seen corresponding path program 1 times [2023-11-19 08:06:00,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:06:00,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297811198] [2023-11-19 08:06:00,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:06:00,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:06:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:00,260 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 08:06:00,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:06:00,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297811198] [2023-11-19 08:06:00,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297811198] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:06:00,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:06:00,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:06:00,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513175449] [2023-11-19 08:06:00,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:06:00,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:06:00,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:06:00,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:06:00,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:06:00,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 261 [2023-11-19 08:06:00,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 73 transitions, 607 flow. Second operand has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states 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 08:06:00,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:06:00,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 261 [2023-11-19 08:06:00,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:06:01,494 INFO L124 PetriNetUnfolderBase]: 3532/5761 cut-off events. [2023-11-19 08:06:01,495 INFO L125 PetriNetUnfolderBase]: For 28204/28292 co-relation queries the response was YES. [2023-11-19 08:06:01,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25611 conditions, 5761 events. 3532/5761 cut-off events. For 28204/28292 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 36474 event pairs, 604 based on Foata normal form. 123/5825 useless extension candidates. Maximal degree in co-relation 25588. Up to 2326 conditions per place. [2023-11-19 08:06:01,569 INFO L140 encePairwiseOnDemand]: 257/261 looper letters, 102 selfloop transitions, 3 changer transitions 19/139 dead transitions. [2023-11-19 08:06:01,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 139 transitions, 1438 flow [2023-11-19 08:06:01,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 08:06:01,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 08:06:01,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2023-11-19 08:06:01,573 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45440613026819926 [2023-11-19 08:06:01,573 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 593 transitions. [2023-11-19 08:06:01,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 593 transitions. [2023-11-19 08:06:01,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:06:01,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 593 transitions. [2023-11-19 08:06:01,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 0 states have call successors, (0), 0 states 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 08:06:01,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states 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 08:06:01,580 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states 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 08:06:01,581 INFO L175 Difference]: Start difference. First operand has 72 places, 73 transitions, 607 flow. Second operand 5 states and 593 transitions. [2023-11-19 08:06:01,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 139 transitions, 1438 flow [2023-11-19 08:06:01,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 139 transitions, 1302 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-11-19 08:06:01,658 INFO L231 Difference]: Finished difference. Result has 72 places, 75 transitions, 577 flow [2023-11-19 08:06:01,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=577, PETRI_PLACES=72, PETRI_TRANSITIONS=75} [2023-11-19 08:06:01,660 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 28 predicate places. [2023-11-19 08:06:01,660 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 75 transitions, 577 flow [2023-11-19 08:06:01,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states 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 08:06:01,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:06:01,661 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:06:01,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 08:06:01,661 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 08:06:01,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:06:01,662 INFO L85 PathProgramCache]: Analyzing trace with hash 570506274, now seen corresponding path program 2 times [2023-11-19 08:06:01,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:06:01,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180144075] [2023-11-19 08:06:01,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:06:01,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:06:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:01,835 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 08:06:01,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:06:01,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180144075] [2023-11-19 08:06:01,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180144075] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:06:01,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:06:01,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:06:01,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711194690] [2023-11-19 08:06:01,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:06:01,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:06:01,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:06:01,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:06:01,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:06:01,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 261 [2023-11-19 08:06:01,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 75 transitions, 577 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states 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 08:06:01,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:06:01,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 261 [2023-11-19 08:06:01,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:06:02,467 INFO L124 PetriNetUnfolderBase]: 1650/2944 cut-off events. [2023-11-19 08:06:02,467 INFO L125 PetriNetUnfolderBase]: For 15387/15495 co-relation queries the response was YES. [2023-11-19 08:06:02,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13160 conditions, 2944 events. 1650/2944 cut-off events. For 15387/15495 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 18807 event pairs, 514 based on Foata normal form. 142/2949 useless extension candidates. Maximal degree in co-relation 13135. Up to 2256 conditions per place. [2023-11-19 08:06:02,510 INFO L140 encePairwiseOnDemand]: 256/261 looper letters, 65 selfloop transitions, 4 changer transitions 8/93 dead transitions. [2023-11-19 08:06:02,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 93 transitions, 843 flow [2023-11-19 08:06:02,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:06:02,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:06:02,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2023-11-19 08:06:02,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4789272030651341 [2023-11-19 08:06:02,513 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2023-11-19 08:06:02,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2023-11-19 08:06:02,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:06:02,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2023-11-19 08:06:02,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states 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 08:06:02,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states 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 08:06:02,517 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states 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 08:06:02,518 INFO L175 Difference]: Start difference. First operand has 72 places, 75 transitions, 577 flow. Second operand 3 states and 375 transitions. [2023-11-19 08:06:02,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 93 transitions, 843 flow [2023-11-19 08:06:02,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 93 transitions, 815 flow, removed 13 selfloop flow, removed 3 redundant places. [2023-11-19 08:06:02,561 INFO L231 Difference]: Finished difference. Result has 72 places, 66 transitions, 485 flow [2023-11-19 08:06:02,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=485, PETRI_PLACES=72, PETRI_TRANSITIONS=66} [2023-11-19 08:06:02,562 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 28 predicate places. [2023-11-19 08:06:02,562 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 66 transitions, 485 flow [2023-11-19 08:06:02,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states 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 08:06:02,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:06:02,563 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 08:06:02,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 08:06:02,563 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 08:06:02,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:06:02,564 INFO L85 PathProgramCache]: Analyzing trace with hash -519724369, now seen corresponding path program 1 times [2023-11-19 08:06:02,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:06:02,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997448015] [2023-11-19 08:06:02,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:06:02,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:06:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:02,774 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 08:06:02,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:06:02,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997448015] [2023-11-19 08:06:02,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997448015] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:06:02,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:06:02,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:06:02,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773479164] [2023-11-19 08:06:02,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:06:02,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:06:02,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:06:02,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:06:02,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:06:02,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 261 [2023-11-19 08:06:02,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 66 transitions, 485 flow. Second operand has 4 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 0 states have call successors, (0), 0 states 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 08:06:02,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:06:02,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 261 [2023-11-19 08:06:02,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:06:03,112 INFO L124 PetriNetUnfolderBase]: 672/1364 cut-off events. [2023-11-19 08:06:03,112 INFO L125 PetriNetUnfolderBase]: For 4582/4639 co-relation queries the response was YES. [2023-11-19 08:06:03,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6006 conditions, 1364 events. 672/1364 cut-off events. For 4582/4639 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8287 event pairs, 130 based on Foata normal form. 158/1485 useless extension candidates. Maximal degree in co-relation 5982. Up to 461 conditions per place. [2023-11-19 08:06:03,131 INFO L140 encePairwiseOnDemand]: 256/261 looper letters, 68 selfloop transitions, 7 changer transitions 7/98 dead transitions. [2023-11-19 08:06:03,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 98 transitions, 865 flow [2023-11-19 08:06:03,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:06:03,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:06:03,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 500 transitions. [2023-11-19 08:06:03,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4789272030651341 [2023-11-19 08:06:03,136 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 500 transitions. [2023-11-19 08:06:03,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 500 transitions. [2023-11-19 08:06:03,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:06:03,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 500 transitions. [2023-11-19 08:06:03,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states 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 08:06:03,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 261.0) internal successors, (1305), 5 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states 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 08:06:03,142 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 261.0) internal successors, (1305), 5 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states 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 08:06:03,142 INFO L175 Difference]: Start difference. First operand has 72 places, 66 transitions, 485 flow. Second operand 4 states and 500 transitions. [2023-11-19 08:06:03,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 98 transitions, 865 flow [2023-11-19 08:06:03,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 98 transitions, 847 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-19 08:06:03,153 INFO L231 Difference]: Finished difference. Result has 72 places, 65 transitions, 485 flow [2023-11-19 08:06:03,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=485, PETRI_PLACES=72, PETRI_TRANSITIONS=65} [2023-11-19 08:06:03,154 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 28 predicate places. [2023-11-19 08:06:03,155 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 485 flow [2023-11-19 08:06:03,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 0 states have call successors, (0), 0 states 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 08:06:03,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:06:03,155 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 08:06:03,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 08:06:03,156 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 08:06:03,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:06:03,156 INFO L85 PathProgramCache]: Analyzing trace with hash -409876565, now seen corresponding path program 1 times [2023-11-19 08:06:03,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:06:03,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68930654] [2023-11-19 08:06:03,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:06:03,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:06:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:03,383 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 08:06:03,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:06:03,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68930654] [2023-11-19 08:06:03,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68930654] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:06:03,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:06:03,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:06:03,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831670374] [2023-11-19 08:06:03,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:06:03,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:06:03,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:06:03,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:06:03,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:06:03,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 261 [2023-11-19 08:06:03,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 485 flow. Second operand has 5 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 08:06:03,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:06:03,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 261 [2023-11-19 08:06:03,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:06:03,683 INFO L124 PetriNetUnfolderBase]: 554/1104 cut-off events. [2023-11-19 08:06:03,683 INFO L125 PetriNetUnfolderBase]: For 4362/4419 co-relation queries the response was YES. [2023-11-19 08:06:03,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5076 conditions, 1104 events. 554/1104 cut-off events. For 4362/4419 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6613 event pairs, 108 based on Foata normal form. 58/1129 useless extension candidates. Maximal degree in co-relation 5053. Up to 383 conditions per place. [2023-11-19 08:06:03,693 INFO L140 encePairwiseOnDemand]: 256/261 looper letters, 54 selfloop transitions, 10 changer transitions 22/97 dead transitions. [2023-11-19 08:06:03,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 97 transitions, 869 flow [2023-11-19 08:06:03,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 08:06:03,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 08:06:03,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 614 transitions. [2023-11-19 08:06:03,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4704980842911877 [2023-11-19 08:06:03,697 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 614 transitions. [2023-11-19 08:06:03,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 614 transitions. [2023-11-19 08:06:03,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:06:03,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 614 transitions. [2023-11-19 08:06:03,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 states 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 08:06:03,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states 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 08:06:03,704 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states 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 08:06:03,704 INFO L175 Difference]: Start difference. First operand has 72 places, 65 transitions, 485 flow. Second operand 5 states and 614 transitions. [2023-11-19 08:06:03,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 97 transitions, 869 flow [2023-11-19 08:06:03,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 97 transitions, 830 flow, removed 10 selfloop flow, removed 4 redundant places. [2023-11-19 08:06:03,720 INFO L231 Difference]: Finished difference. Result has 73 places, 54 transitions, 395 flow [2023-11-19 08:06:03,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=68, 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=395, PETRI_PLACES=73, PETRI_TRANSITIONS=54} [2023-11-19 08:06:03,722 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 29 predicate places. [2023-11-19 08:06:03,722 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 54 transitions, 395 flow [2023-11-19 08:06:03,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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 08:06:03,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:06:03,723 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 08:06:03,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 08:06:03,723 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 08:06:03,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:06:03,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1716874450, now seen corresponding path program 1 times [2023-11-19 08:06:03,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:06:03,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449537814] [2023-11-19 08:06:03,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:06:03,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:06:03,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:04,220 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 08:06:04,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:06:04,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449537814] [2023-11-19 08:06:04,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449537814] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:06:04,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:06:04,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 08:06:04,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233909177] [2023-11-19 08:06:04,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:06:04,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:06:04,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:06:04,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:06:04,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:06:04,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 261 [2023-11-19 08:06:04,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 54 transitions, 395 flow. Second operand has 6 states, 6 states have (on average 102.83333333333333) internal successors, (617), 6 states have internal predecessors, (617), 0 states have call successors, (0), 0 states 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 08:06:04,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:06:04,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 261 [2023-11-19 08:06:04,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:06:04,789 INFO L124 PetriNetUnfolderBase]: 611/1148 cut-off events. [2023-11-19 08:06:04,789 INFO L125 PetriNetUnfolderBase]: For 4054/4056 co-relation queries the response was YES. [2023-11-19 08:06:04,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5295 conditions, 1148 events. 611/1148 cut-off events. For 4054/4056 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5946 event pairs, 161 based on Foata normal form. 2/1150 useless extension candidates. Maximal degree in co-relation 5273. Up to 721 conditions per place. [2023-11-19 08:06:04,797 INFO L140 encePairwiseOnDemand]: 254/261 looper letters, 45 selfloop transitions, 3 changer transitions 58/108 dead transitions. [2023-11-19 08:06:04,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 108 transitions, 975 flow [2023-11-19 08:06:04,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 08:06:04,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 08:06:04,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 752 transitions. [2023-11-19 08:06:04,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41160372194854955 [2023-11-19 08:06:04,802 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 752 transitions. [2023-11-19 08:06:04,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 752 transitions. [2023-11-19 08:06:04,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:06:04,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 752 transitions. [2023-11-19 08:06:04,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.42857142857143) internal successors, (752), 7 states have internal predecessors, (752), 0 states have call successors, (0), 0 states 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 08:06:04,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 261.0) internal successors, (2088), 8 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states 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 08:06:04,811 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 261.0) internal successors, (2088), 8 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states 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 08:06:04,811 INFO L175 Difference]: Start difference. First operand has 73 places, 54 transitions, 395 flow. Second operand 7 states and 752 transitions. [2023-11-19 08:06:04,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 108 transitions, 975 flow [2023-11-19 08:06:04,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 108 transitions, 867 flow, removed 27 selfloop flow, removed 9 redundant places. [2023-11-19 08:06:04,828 INFO L231 Difference]: Finished difference. Result has 71 places, 40 transitions, 250 flow [2023-11-19 08:06:04,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=250, PETRI_PLACES=71, PETRI_TRANSITIONS=40} [2023-11-19 08:06:04,830 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 27 predicate places. [2023-11-19 08:06:04,830 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 40 transitions, 250 flow [2023-11-19 08:06:04,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.83333333333333) internal successors, (617), 6 states have internal predecessors, (617), 0 states have call successors, (0), 0 states 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 08:06:04,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:06:04,831 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 08:06:04,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 08:06:04,831 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 08:06:04,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:06:04,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1503828446, now seen corresponding path program 2 times [2023-11-19 08:06:04,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:06:04,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53365960] [2023-11-19 08:06:04,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:06:04,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:06:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:06:04,900 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:06:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:06:05,003 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:06:05,003 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 08:06:05,005 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-19 08:06:05,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-19 08:06:05,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-19 08:06:05,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-19 08:06:05,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-19 08:06:05,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-19 08:06:05,008 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-19 08:06:05,008 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-19 08:06:05,008 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-19 08:06:05,008 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-19 08:06:05,008 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-19 08:06:05,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-19 08:06:05,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-19 08:06:05,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 08:06:05,009 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:06:05,017 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 08:06:05,017 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 08:06:05,093 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-19 08:06:05,095 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 08:06:05,098 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 08:06:05,118 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-19 08:06:05,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:06:05 BasicIcfg [2023-11-19 08:06:05,141 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 08:06:05,141 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 08:06:05,141 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 08:06:05,142 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 08:06:05,142 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:05:40" (3/4) ... [2023-11-19 08:06:05,144 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 08:06:05,145 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 08:06:05,146 INFO L158 Benchmark]: Toolchain (without parser) took 26720.22ms. Allocated memory was 138.4MB in the beginning and 539.0MB in the end (delta: 400.6MB). Free memory was 87.1MB in the beginning and 256.3MB in the end (delta: -169.2MB). Peak memory consumption was 233.4MB. Max. memory is 16.1GB. [2023-11-19 08:06:05,146 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 113.2MB. Free memory is still 69.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 08:06:05,146 INFO L158 Benchmark]: CACSL2BoogieTranslator took 787.42ms. Allocated memory is still 138.4MB. Free memory was 86.9MB in the beginning and 107.1MB in the end (delta: -20.2MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. [2023-11-19 08:06:05,147 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.30ms. Allocated memory is still 138.4MB. Free memory was 107.1MB in the beginning and 104.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 08:06:05,147 INFO L158 Benchmark]: Boogie Preprocessor took 41.30ms. Allocated memory is still 138.4MB. Free memory was 104.3MB in the beginning and 102.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 08:06:05,148 INFO L158 Benchmark]: RCFGBuilder took 885.27ms. Allocated memory is still 138.4MB. Free memory was 102.3MB in the beginning and 64.5MB in the end (delta: 37.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2023-11-19 08:06:05,148 INFO L158 Benchmark]: TraceAbstraction took 24924.00ms. Allocated memory was 138.4MB in the beginning and 539.0MB in the end (delta: 400.6MB). Free memory was 64.1MB in the beginning and 256.3MB in the end (delta: -192.2MB). Peak memory consumption was 208.4MB. Max. memory is 16.1GB. [2023-11-19 08:06:05,149 INFO L158 Benchmark]: Witness Printer took 3.92ms. Allocated memory is still 539.0MB. Free memory is still 256.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 08:06:05,151 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.35ms. Allocated memory is still 113.2MB. Free memory is still 69.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 787.42ms. Allocated memory is still 138.4MB. Free memory was 86.9MB in the beginning and 107.1MB in the end (delta: -20.2MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.30ms. Allocated memory is still 138.4MB. Free memory was 107.1MB in the beginning and 104.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.30ms. Allocated memory is still 138.4MB. Free memory was 104.3MB in the beginning and 102.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 885.27ms. Allocated memory is still 138.4MB. Free memory was 102.3MB in the beginning and 64.5MB in the end (delta: 37.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 24924.00ms. Allocated memory was 138.4MB in the beginning and 539.0MB in the end (delta: 400.6MB). Free memory was 64.1MB in the beginning and 256.3MB in the end (delta: -192.2MB). Peak memory consumption was 208.4MB. Max. memory is 16.1GB. * Witness Printer took 3.92ms. Allocated memory is still 539.0MB. Free memory is still 256.3MB. 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.1s, 136 PlacesBefore, 44 PlacesAfterwards, 130 TransitionsBefore, 35 TransitionsAfterwards, 3024 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 65 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 3 ChoiceCompositions, 128 TotalNumberOfCompositions, 8208 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4006, independent: 3787, independent conditional: 0, independent unconditional: 3787, dependent: 219, dependent conditional: 0, dependent unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1601, independent: 1564, independent conditional: 0, independent unconditional: 1564, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4006, independent: 2223, independent conditional: 0, independent unconditional: 2223, dependent: 182, dependent conditional: 0, dependent unconditional: 182, unknown: 1601, unknown conditional: 0, unknown unconditional: 1601] , Statistics on independence cache: Total cache size (in pairs): 160, Positive cache size: 141, Positive conditional cache size: 0, Positive unconditional cache size: 141, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, 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; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L724] 0 _Bool x$flush_delayed; [L725] 0 int x$mem_tmp; [L726] 0 _Bool x$r_buff0_thd0; [L727] 0 _Bool x$r_buff0_thd1; [L728] 0 _Bool x$r_buff0_thd2; [L729] 0 _Bool x$r_buff0_thd3; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$read_delayed; [L735] 0 int *x$read_delayed_var; [L736] 0 int x$w_buff0; [L737] 0 _Bool x$w_buff0_used; [L738] 0 int x$w_buff1; [L739] 0 _Bool x$w_buff1_used; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L835] 0 pthread_t t299; [L836] FCALL, FORK 0 pthread_create(&t299, ((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}, main$tmp_guard0=0, main$tmp_guard1=0, t299={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] [L837] 0 pthread_t t300; [L838] FCALL, FORK 0 pthread_create(&t300, ((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}, main$tmp_guard0=0, main$tmp_guard1=0, t299={5:0}, t300={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] [L839] 0 pthread_t t301; [L840] FCALL, FORK 0 pthread_create(&t301, ((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}, main$tmp_guard0=0, main$tmp_guard1=0, t299={5:0}, t300={6:0}, t301={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] [L769] 2 x$w_buff1 = x$w_buff0 [L770] 2 x$w_buff0 = 2 [L771] 2 x$w_buff1_used = x$w_buff0_used [L772] 2 x$w_buff0_used = (_Bool)1 [L773] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L773] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L774] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L775] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L776] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L777] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L778] 2 x$r_buff0_thd2 = (_Bool)1 [L781] 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}, 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] [L784] 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}, 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] [L787] 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}, 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] [L804] 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}, 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] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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] [L810] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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] [L749] 1 a = 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}, 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] [L752] 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}, 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] [L813] 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) [L814] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] 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 [L816] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] 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 [__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}, 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] [L790] 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) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 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 [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_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}, 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] [L755] 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) [L756] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L757] 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 [L758] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L759] 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}, 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] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L844] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L844] RET 0 assume_abort_if_not(main$tmp_guard0) [L846] 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) [L847] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L848] 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 [L849] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L850] 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}, main$tmp_guard0=1, main$tmp_guard1=0, t299={5:0}, t300={6:0}, t301={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] [L853] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 0 x$flush_delayed = weak$$choice2 [L856] 0 x$mem_tmp = x [L857] 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) [L858] 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)) [L859] 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)) [L860] 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)) [L861] 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)) [L862] 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)) [L863] 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)) [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L865] 0 x = x$flush_delayed ? x$mem_tmp : x [L866] 0 x$flush_delayed = (_Bool)0 [L868] 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", "mix011_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}, 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: 833]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 840]: 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: 838]: 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: 836]: 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, 161 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: 24.6s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 11.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 924 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 691 mSDsluCounter, 637 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 524 mSDsCounter, 122 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2126 IncrementalHoareTripleChecker+Invalid, 2248 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 122 mSolverCounterUnsat, 113 mSDtfsCounter, 2126 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=607occurred in iteration=9, InterpolantAutomatonStates: 77, 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.4s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 213 NumberOfCodeBlocks, 213 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 175 ConstructedInterpolants, 0 QuantifiedInterpolants, 1844 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 08:06:05,204 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938dd06d-9569-4706-914c-a275092e5809/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_938dd06d-9569-4706-914c-a275092e5809/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938dd06d-9569-4706-914c-a275092e5809/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_938dd06d-9569-4706-914c-a275092e5809/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938dd06d-9569-4706-914c-a275092e5809/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix011_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938dd06d-9569-4706-914c-a275092e5809/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_938dd06d-9569-4706-914c-a275092e5809/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 a4d86e141dde5935b04f74715dd2fbb14b0de9136d07674e0b6c5447ac95e0ef --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 08:06:07,931 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 08:06:08,080 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938dd06d-9569-4706-914c-a275092e5809/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-19 08:06:08,090 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 08:06:08,091 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 08:06:08,138 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 08:06:08,139 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 08:06:08,140 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 08:06:08,141 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 08:06:08,146 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 08:06:08,147 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 08:06:08,147 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 08:06:08,147 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 08:06:08,149 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 08:06:08,150 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 08:06:08,150 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 08:06:08,151 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 08:06:08,151 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 08:06:08,151 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 08:06:08,152 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 08:06:08,152 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 08:06:08,153 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 08:06:08,153 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 08:06:08,154 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-19 08:06:08,154 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-19 08:06:08,155 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 08:06:08,155 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 08:06:08,156 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 08:06:08,157 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 08:06:08,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 08:06:08,158 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 08:06:08,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:06:08,159 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 08:06:08,160 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 08:06:08,160 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-19 08:06:08,160 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-19 08:06:08,160 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 08:06:08,161 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 08:06:08,161 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 08:06:08,162 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-19 08:06:08,162 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 08:06:08,163 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_938dd06d-9569-4706-914c-a275092e5809/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_938dd06d-9569-4706-914c-a275092e5809/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 -> a4d86e141dde5935b04f74715dd2fbb14b0de9136d07674e0b6c5447ac95e0ef [2023-11-19 08:06:08,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 08:06:08,640 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 08:06:08,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 08:06:08,644 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 08:06:08,646 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 08:06:08,648 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938dd06d-9569-4706-914c-a275092e5809/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix011_tso.oepc.i [2023-11-19 08:06:12,051 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 08:06:12,451 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 08:06:12,452 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938dd06d-9569-4706-914c-a275092e5809/sv-benchmarks/c/pthread-wmm/mix011_tso.oepc.i [2023-11-19 08:06:12,475 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938dd06d-9569-4706-914c-a275092e5809/bin/uautomizer-verify-uCwYo4JHxu/data/95235a7c2/284a6956645144ec8a05355ffd11fa08/FLAGf65f7eeb4 [2023-11-19 08:06:12,498 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938dd06d-9569-4706-914c-a275092e5809/bin/uautomizer-verify-uCwYo4JHxu/data/95235a7c2/284a6956645144ec8a05355ffd11fa08 [2023-11-19 08:06:12,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 08:06:12,506 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 08:06:12,509 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 08:06:12,510 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 08:06:12,515 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 08:06:12,517 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:06:12" (1/1) ... [2023-11-19 08:06:12,518 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@404de66f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:12, skipping insertion in model container [2023-11-19 08:06:12,518 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:06:12" (1/1) ... [2023-11-19 08:06:12,600 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 08:06:13,148 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:06:13,178 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 08:06:13,276 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:06:13,344 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 08:06:13,345 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 08:06:13,352 INFO L206 MainTranslator]: Completed translation [2023-11-19 08:06:13,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:13 WrapperNode [2023-11-19 08:06:13,353 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 08:06:13,354 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 08:06:13,354 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 08:06:13,354 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 08:06:13,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:13" (1/1) ... [2023-11-19 08:06:13,397 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:13" (1/1) ... [2023-11-19 08:06:13,428 INFO L138 Inliner]: procedures = 179, calls = 61, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 160 [2023-11-19 08:06:13,428 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 08:06:13,429 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 08:06:13,429 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 08:06:13,430 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 08:06:13,439 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:13" (1/1) ... [2023-11-19 08:06:13,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:13" (1/1) ... [2023-11-19 08:06:13,443 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:13" (1/1) ... [2023-11-19 08:06:13,444 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:13" (1/1) ... [2023-11-19 08:06:13,455 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:13" (1/1) ... [2023-11-19 08:06:13,478 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:13" (1/1) ... [2023-11-19 08:06:13,481 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:13" (1/1) ... [2023-11-19 08:06:13,484 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:13" (1/1) ... [2023-11-19 08:06:13,489 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 08:06:13,502 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 08:06:13,503 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 08:06:13,503 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 08:06:13,504 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:13" (1/1) ... [2023-11-19 08:06:13,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:06:13,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938dd06d-9569-4706-914c-a275092e5809/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:06:13,535 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938dd06d-9569-4706-914c-a275092e5809/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 08:06:13,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938dd06d-9569-4706-914c-a275092e5809/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 08:06:13,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 08:06:13,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 08:06:13,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 08:06:13,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 08:06:13,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-19 08:06:13,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-19 08:06:13,581 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 08:06:13,581 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 08:06:13,581 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 08:06:13,582 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 08:06:13,582 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 08:06:13,582 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 08:06:13,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 08:06:13,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 08:06:13,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 08:06:13,586 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 08:06:13,810 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 08:06:13,812 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 08:06:14,245 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 08:06:14,431 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 08:06:14,431 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 08:06:14,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:06:14 BoogieIcfgContainer [2023-11-19 08:06:14,438 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 08:06:14,442 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 08:06:14,442 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 08:06:14,445 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 08:06:14,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:06:12" (1/3) ... [2023-11-19 08:06:14,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40c431e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:06:14, skipping insertion in model container [2023-11-19 08:06:14,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:13" (2/3) ... [2023-11-19 08:06:14,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40c431e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:06:14, skipping insertion in model container [2023-11-19 08:06:14,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:06:14" (3/3) ... [2023-11-19 08:06:14,449 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011_tso.oepc.i [2023-11-19 08:06:14,469 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 08:06:14,469 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-19 08:06:14,469 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 08:06:14,555 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 08:06:14,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 134 transitions, 280 flow [2023-11-19 08:06:14,708 INFO L124 PetriNetUnfolderBase]: 4/131 cut-off events. [2023-11-19 08:06:14,708 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:06:14,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 131 events. 4/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-11-19 08:06:14,716 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 134 transitions, 280 flow [2023-11-19 08:06:14,726 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 131 transitions, 271 flow [2023-11-19 08:06:14,730 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 08:06:14,746 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 131 transitions, 271 flow [2023-11-19 08:06:14,751 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 131 transitions, 271 flow [2023-11-19 08:06:14,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 131 transitions, 271 flow [2023-11-19 08:06:14,808 INFO L124 PetriNetUnfolderBase]: 4/131 cut-off events. [2023-11-19 08:06:14,808 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:06:14,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 131 events. 4/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-11-19 08:06:14,813 INFO L119 LiptonReduction]: Number of co-enabled transitions 3024