./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe018_rmo.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_c9de75e8-447b-4b8f-ac6f-31b2c5502382/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9de75e8-447b-4b8f-ac6f-31b2c5502382/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_c9de75e8-447b-4b8f-ac6f-31b2c5502382/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9de75e8-447b-4b8f-ac6f-31b2c5502382/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe018_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9de75e8-447b-4b8f-ac6f-31b2c5502382/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_c9de75e8-447b-4b8f-ac6f-31b2c5502382/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 6f413b41672ef8cb3f594e0d22a82a07ab4d735f8bfa69fff7e94198d51bd0eb --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 08:00:11,314 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 08:00:11,410 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9de75e8-447b-4b8f-ac6f-31b2c5502382/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-19 08:00:11,417 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 08:00:11,418 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 08:00:11,453 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 08:00:11,454 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 08:00:11,455 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 08:00:11,456 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 08:00:11,456 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 08:00:11,457 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 08:00:11,458 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 08:00:11,458 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 08:00:11,459 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 08:00:11,460 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 08:00:11,460 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 08:00:11,461 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 08:00:11,461 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 08:00:11,462 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 08:00:11,462 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 08:00:11,463 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 08:00:11,464 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 08:00:11,465 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 08:00:11,465 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 08:00:11,466 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 08:00:11,467 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 08:00:11,467 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 08:00:11,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 08:00:11,468 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 08:00:11,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:00:11,470 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 08:00:11,470 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 08:00:11,471 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 08:00:11,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 08:00:11,472 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 08:00:11,473 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 08:00:11,474 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 08:00:11,474 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 08:00:11,475 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_c9de75e8-447b-4b8f-ac6f-31b2c5502382/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_c9de75e8-447b-4b8f-ac6f-31b2c5502382/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 -> 6f413b41672ef8cb3f594e0d22a82a07ab4d735f8bfa69fff7e94198d51bd0eb [2023-11-19 08:00:11,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 08:00:11,752 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 08:00:11,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 08:00:11,756 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 08:00:11,757 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 08:00:11,758 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9de75e8-447b-4b8f-ac6f-31b2c5502382/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/safe018_rmo.oepc.i [2023-11-19 08:00:14,967 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 08:00:15,309 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 08:00:15,313 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9de75e8-447b-4b8f-ac6f-31b2c5502382/sv-benchmarks/c/pthread-wmm/safe018_rmo.oepc.i [2023-11-19 08:00:15,330 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9de75e8-447b-4b8f-ac6f-31b2c5502382/bin/uautomizer-verify-uCwYo4JHxu/data/f4caa63a0/a518bb2b15df478794f7747e150cce32/FLAGf4fa53820 [2023-11-19 08:00:15,345 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9de75e8-447b-4b8f-ac6f-31b2c5502382/bin/uautomizer-verify-uCwYo4JHxu/data/f4caa63a0/a518bb2b15df478794f7747e150cce32 [2023-11-19 08:00:15,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 08:00:15,349 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 08:00:15,350 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 08:00:15,351 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 08:00:15,356 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 08:00:15,357 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:00:15" (1/1) ... [2023-11-19 08:00:15,358 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c274e81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:15, skipping insertion in model container [2023-11-19 08:00:15,358 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:00:15" (1/1) ... [2023-11-19 08:00:15,409 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 08:00:15,924 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:00:15,942 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 08:00:16,023 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:00:16,083 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 08:00:16,084 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 08:00:16,092 INFO L206 MainTranslator]: Completed translation [2023-11-19 08:00:16,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:16 WrapperNode [2023-11-19 08:00:16,093 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 08:00:16,094 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 08:00:16,095 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 08:00:16,095 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 08:00:16,103 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:00:16" (1/1) ... [2023-11-19 08:00:16,157 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:00:16" (1/1) ... [2023-11-19 08:00:16,184 INFO L138 Inliner]: procedures = 176, calls = 66, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2023-11-19 08:00:16,184 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 08:00:16,185 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 08:00:16,185 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 08:00:16,186 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 08:00:16,201 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:16" (1/1) ... [2023-11-19 08:00:16,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:16" (1/1) ... [2023-11-19 08:00:16,205 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:16" (1/1) ... [2023-11-19 08:00:16,206 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:16" (1/1) ... [2023-11-19 08:00:16,216 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:16" (1/1) ... [2023-11-19 08:00:16,233 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:16" (1/1) ... [2023-11-19 08:00:16,248 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:16" (1/1) ... [2023-11-19 08:00:16,252 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:16" (1/1) ... [2023-11-19 08:00:16,260 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 08:00:16,261 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 08:00:16,261 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 08:00:16,262 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 08:00:16,263 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:16" (1/1) ... [2023-11-19 08:00:16,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:00:16,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9de75e8-447b-4b8f-ac6f-31b2c5502382/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:00:16,304 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9de75e8-447b-4b8f-ac6f-31b2c5502382/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:00:16,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9de75e8-447b-4b8f-ac6f-31b2c5502382/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:00:16,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 08:00:16,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 08:00:16,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 08:00:16,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 08:00:16,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 08:00:16,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 08:00:16,355 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 08:00:16,355 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 08:00:16,356 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 08:00:16,356 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 08:00:16,356 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 08:00:16,356 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 08:00:16,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 08:00:16,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 08:00:16,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 08:00:16,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 08:00:16,360 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:00:16,554 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 08:00:16,557 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 08:00:17,045 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 08:00:17,494 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 08:00:17,494 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 08:00:17,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:00:17 BoogieIcfgContainer [2023-11-19 08:00:17,505 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 08:00:17,509 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 08:00:17,510 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 08:00:17,513 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 08:00:17,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:00:15" (1/3) ... [2023-11-19 08:00:17,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@335b473d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:00:17, skipping insertion in model container [2023-11-19 08:00:17,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:16" (2/3) ... [2023-11-19 08:00:17,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@335b473d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:00:17, skipping insertion in model container [2023-11-19 08:00:17,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:00:17" (3/3) ... [2023-11-19 08:00:17,519 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_rmo.oepc.i [2023-11-19 08:00:17,539 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 08:00:17,539 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2023-11-19 08:00:17,540 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 08:00:17,731 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 08:00:17,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 187 transitions, 386 flow [2023-11-19 08:00:17,937 INFO L124 PetriNetUnfolderBase]: 23/184 cut-off events. [2023-11-19 08:00:17,937 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:00:17,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 184 events. 23/184 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 246 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 127. Up to 3 conditions per place. [2023-11-19 08:00:17,949 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 187 transitions, 386 flow [2023-11-19 08:00:17,961 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 171 places, 184 transitions, 377 flow [2023-11-19 08:00:17,965 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 08:00:17,985 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 184 transitions, 377 flow [2023-11-19 08:00:17,990 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 171 places, 184 transitions, 377 flow [2023-11-19 08:00:17,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 171 places, 184 transitions, 377 flow [2023-11-19 08:00:18,076 INFO L124 PetriNetUnfolderBase]: 23/184 cut-off events. [2023-11-19 08:00:18,076 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:00:18,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 184 events. 23/184 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 246 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 127. Up to 3 conditions per place. [2023-11-19 08:00:18,089 INFO L119 LiptonReduction]: Number of co-enabled transitions 8040 [2023-11-19 08:00:28,361 INFO L134 LiptonReduction]: Checked pairs total: 21237 [2023-11-19 08:00:28,361 INFO L136 LiptonReduction]: Total number of compositions: 201 [2023-11-19 08:00:28,377 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:00:28,384 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;@27a2164e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:00:28,384 INFO L358 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2023-11-19 08:00:28,386 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 08:00:28,386 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-19 08:00:28,386 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:00:28,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:00:28,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-19 08:00:28,388 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-19 08:00:28,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:28,393 INFO L85 PathProgramCache]: Analyzing trace with hash 926, now seen corresponding path program 1 times [2023-11-19 08:00:28,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:28,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559082395] [2023-11-19 08:00:28,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:28,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:28,518 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:00:28,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:28,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559082395] [2023-11-19 08:00:28,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559082395] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:28,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:28,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 08:00:28,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840620048] [2023-11-19 08:00:28,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:28,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 08:00:28,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:28,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 08:00:28,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 08:00:28,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 388 [2023-11-19 08:00:28,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 59 transitions, 127 flow. Second operand has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 0 states have call successors, (0), 0 states 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:00:28,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:00:28,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 388 [2023-11-19 08:00:28,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:00:30,175 INFO L124 PetriNetUnfolderBase]: 5794/8331 cut-off events. [2023-11-19 08:00:30,175 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:00:30,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16708 conditions, 8331 events. 5794/8331 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 45612 event pairs, 5794 based on Foata normal form. 0/4646 useless extension candidates. Maximal degree in co-relation 16697. Up to 8331 conditions per place. [2023-11-19 08:00:30,252 INFO L140 encePairwiseOnDemand]: 370/388 looper letters, 38 selfloop transitions, 0 changer transitions 0/39 dead transitions. [2023-11-19 08:00:30,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 163 flow [2023-11-19 08:00:30,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 08:00:30,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 08:00:30,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 318 transitions. [2023-11-19 08:00:30,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4097938144329897 [2023-11-19 08:00:30,275 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 318 transitions. [2023-11-19 08:00:30,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 318 transitions. [2023-11-19 08:00:30,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:00:30,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 318 transitions. [2023-11-19 08:00:30,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 159.0) internal successors, (318), 2 states have internal predecessors, (318), 0 states have call successors, (0), 0 states 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:00:30,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 388.0) internal successors, (1164), 3 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states 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:00:30,296 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 388.0) internal successors, (1164), 3 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states 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:00:30,297 INFO L175 Difference]: Start difference. First operand has 67 places, 59 transitions, 127 flow. Second operand 2 states and 318 transitions. [2023-11-19 08:00:30,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 163 flow [2023-11-19 08:00:30,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 39 transitions, 160 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-19 08:00:30,306 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 84 flow [2023-11-19 08:00:30,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2023-11-19 08:00:30,312 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -20 predicate places. [2023-11-19 08:00:30,312 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 84 flow [2023-11-19 08:00:30,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 0 states have call successors, (0), 0 states 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:00:30,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:00:30,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-19 08:00:30,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 08:00:30,314 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-19 08:00:30,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:30,325 INFO L85 PathProgramCache]: Analyzing trace with hash 911145, now seen corresponding path program 1 times [2023-11-19 08:00:30,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:30,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958995973] [2023-11-19 08:00:30,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:30,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:30,642 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:00:30,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:30,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958995973] [2023-11-19 08:00:30,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958995973] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:30,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:30,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:00:30,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064146969] [2023-11-19 08:00:30,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:30,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:00:30,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:30,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:00:30,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:00:30,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 388 [2023-11-19 08:00:30,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states 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:00:30,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:00:30,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 388 [2023-11-19 08:00:30,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:00:31,866 INFO L124 PetriNetUnfolderBase]: 4193/6283 cut-off events. [2023-11-19 08:00:31,866 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:00:31,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12530 conditions, 6283 events. 4193/6283 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 35418 event pairs, 2712 based on Foata normal form. 0/4146 useless extension candidates. Maximal degree in co-relation 12527. Up to 3970 conditions per place. [2023-11-19 08:00:31,926 INFO L140 encePairwiseOnDemand]: 374/388 looper letters, 43 selfloop transitions, 8 changer transitions 0/52 dead transitions. [2023-11-19 08:00:31,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 52 transitions, 212 flow [2023-11-19 08:00:31,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:00:31,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:00:31,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2023-11-19 08:00:31,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37628865979381443 [2023-11-19 08:00:31,932 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 438 transitions. [2023-11-19 08:00:31,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions. [2023-11-19 08:00:31,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:00:31,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions. [2023-11-19 08:00:31,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states 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:00:31,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 388.0) internal successors, (1552), 4 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states 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:00:31,943 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 388.0) internal successors, (1552), 4 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states 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:00:31,945 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 84 flow. Second operand 3 states and 438 transitions. [2023-11-19 08:00:31,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 52 transitions, 212 flow [2023-11-19 08:00:31,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 52 transitions, 212 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:00:31,948 INFO L231 Difference]: Finished difference. Result has 49 places, 43 transitions, 144 flow [2023-11-19 08:00:31,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2023-11-19 08:00:31,950 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -18 predicate places. [2023-11-19 08:00:31,951 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 144 flow [2023-11-19 08:00:31,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states 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:00:31,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:00:31,958 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-19 08:00:31,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 08:00:31,959 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-19 08:00:31,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:31,963 INFO L85 PathProgramCache]: Analyzing trace with hash 911146, now seen corresponding path program 1 times [2023-11-19 08:00:31,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:31,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613455111] [2023-11-19 08:00:31,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:31,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:32,163 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:00:32,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:32,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613455111] [2023-11-19 08:00:32,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613455111] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:32,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:32,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:00:32,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699296261] [2023-11-19 08:00:32,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:32,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:00:32,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:32,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:00:32,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:00:32,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 388 [2023-11-19 08:00:32,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states 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:00:32,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:00:32,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 388 [2023-11-19 08:00:32,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:00:32,848 INFO L124 PetriNetUnfolderBase]: 1885/2946 cut-off events. [2023-11-19 08:00:32,848 INFO L125 PetriNetUnfolderBase]: For 596/596 co-relation queries the response was YES. [2023-11-19 08:00:32,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7613 conditions, 2946 events. 1885/2946 cut-off events. For 596/596 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 15831 event pairs, 1579 based on Foata normal form. 408/3008 useless extension candidates. Maximal degree in co-relation 7608. Up to 2885 conditions per place. [2023-11-19 08:00:32,882 INFO L140 encePairwiseOnDemand]: 381/388 looper letters, 35 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2023-11-19 08:00:32,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 37 transitions, 204 flow [2023-11-19 08:00:32,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:00:32,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:00:32,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2023-11-19 08:00:32,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36597938144329895 [2023-11-19 08:00:32,888 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 426 transitions. [2023-11-19 08:00:32,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions. [2023-11-19 08:00:32,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:00:32,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions. [2023-11-19 08:00:32,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states 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:00:32,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 388.0) internal successors, (1552), 4 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states 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:00:32,902 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 388.0) internal successors, (1552), 4 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states 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:00:32,902 INFO L175 Difference]: Start difference. First operand has 49 places, 43 transitions, 144 flow. Second operand 3 states and 426 transitions. [2023-11-19 08:00:32,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 37 transitions, 204 flow [2023-11-19 08:00:32,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 37 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:00:32,914 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 118 flow [2023-11-19 08:00:32,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2023-11-19 08:00:32,915 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -24 predicate places. [2023-11-19 08:00:32,915 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 118 flow [2023-11-19 08:00:32,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states 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:00:32,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:00:32,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:00:32,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 08:00:32,917 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-19 08:00:32,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:32,918 INFO L85 PathProgramCache]: Analyzing trace with hash -382907835, now seen corresponding path program 1 times [2023-11-19 08:00:32,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:32,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184111651] [2023-11-19 08:00:32,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:32,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:33,106 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:00:33,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:33,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184111651] [2023-11-19 08:00:33,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184111651] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:33,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:33,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:00:33,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089053087] [2023-11-19 08:00:33,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:33,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:00:33,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:33,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:00:33,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:00:33,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 388 [2023-11-19 08:00:33,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states 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:00:33,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:00:33,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 388 [2023-11-19 08:00:33,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:00:33,802 INFO L124 PetriNetUnfolderBase]: 1811/2964 cut-off events. [2023-11-19 08:00:33,802 INFO L125 PetriNetUnfolderBase]: For 251/251 co-relation queries the response was YES. [2023-11-19 08:00:33,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7050 conditions, 2964 events. 1811/2964 cut-off events. For 251/251 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 16988 event pairs, 641 based on Foata normal form. 0/2457 useless extension candidates. Maximal degree in co-relation 7045. Up to 1891 conditions per place. [2023-11-19 08:00:33,826 INFO L140 encePairwiseOnDemand]: 384/388 looper letters, 61 selfloop transitions, 3 changer transitions 0/65 dead transitions. [2023-11-19 08:00:33,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 65 transitions, 334 flow [2023-11-19 08:00:33,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:00:33,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:00:33,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2023-11-19 08:00:33,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38230240549828176 [2023-11-19 08:00:33,830 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2023-11-19 08:00:33,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2023-11-19 08:00:33,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:00:33,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2023-11-19 08:00:33,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states 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:00:33,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 388.0) internal successors, (1552), 4 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states 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:00:33,839 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 388.0) internal successors, (1552), 4 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states 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:00:33,839 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 118 flow. Second operand 3 states and 445 transitions. [2023-11-19 08:00:33,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 65 transitions, 334 flow [2023-11-19 08:00:33,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 65 transitions, 333 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 08:00:33,843 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 130 flow [2023-11-19 08:00:33,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2023-11-19 08:00:33,846 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -22 predicate places. [2023-11-19 08:00:33,846 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 130 flow [2023-11-19 08:00:33,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states 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:00:33,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:00:33,847 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:00:33,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 08:00:33,847 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-19 08:00:33,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:33,848 INFO L85 PathProgramCache]: Analyzing trace with hash -382907569, now seen corresponding path program 1 times [2023-11-19 08:00:33,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:33,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438834782] [2023-11-19 08:00:33,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:33,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:34,166 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:00:34,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:34,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438834782] [2023-11-19 08:00:34,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438834782] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:34,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:34,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:00:34,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609606290] [2023-11-19 08:00:34,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:34,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:00:34,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:34,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:00:34,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:00:34,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 388 [2023-11-19 08:00:34,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states 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:00:34,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:00:34,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 388 [2023-11-19 08:00:34,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:00:34,657 INFO L124 PetriNetUnfolderBase]: 1790/2801 cut-off events. [2023-11-19 08:00:34,657 INFO L125 PetriNetUnfolderBase]: For 538/538 co-relation queries the response was YES. [2023-11-19 08:00:34,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7348 conditions, 2801 events. 1790/2801 cut-off events. For 538/538 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 15245 event pairs, 363 based on Foata normal form. 0/2428 useless extension candidates. Maximal degree in co-relation 7342. Up to 2412 conditions per place. [2023-11-19 08:00:34,681 INFO L140 encePairwiseOnDemand]: 385/388 looper letters, 52 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-19 08:00:34,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 55 transitions, 304 flow [2023-11-19 08:00:34,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:00:34,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:00:34,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions. [2023-11-19 08:00:34,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3711340206185567 [2023-11-19 08:00:34,685 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 432 transitions. [2023-11-19 08:00:34,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 432 transitions. [2023-11-19 08:00:34,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:00:34,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 432 transitions. [2023-11-19 08:00:34,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states 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:00:34,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 388.0) internal successors, (1552), 4 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states 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:00:34,692 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 388.0) internal successors, (1552), 4 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states 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:00:34,693 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 130 flow. Second operand 3 states and 432 transitions. [2023-11-19 08:00:34,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 55 transitions, 304 flow [2023-11-19 08:00:34,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 55 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:00:34,696 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 132 flow [2023-11-19 08:00:34,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2023-11-19 08:00:34,749 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -21 predicate places. [2023-11-19 08:00:34,749 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 132 flow [2023-11-19 08:00:34,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states 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:00:34,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:00:34,750 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:00:34,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 08:00:34,750 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-19 08:00:34,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:34,751 INFO L85 PathProgramCache]: Analyzing trace with hash 2133495393, now seen corresponding path program 1 times [2023-11-19 08:00:34,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:34,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371040684] [2023-11-19 08:00:34,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:34,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:34,932 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:00:34,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:34,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371040684] [2023-11-19 08:00:34,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371040684] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:34,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:34,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:00:34,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573489352] [2023-11-19 08:00:34,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:34,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:00:34,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:34,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:00:34,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:00:35,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 388 [2023-11-19 08:00:35,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 132 flow. Second operand has 5 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:00:35,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:00:35,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 388 [2023-11-19 08:00:35,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:00:35,634 INFO L124 PetriNetUnfolderBase]: 1731/2842 cut-off events. [2023-11-19 08:00:35,634 INFO L125 PetriNetUnfolderBase]: For 398/398 co-relation queries the response was YES. [2023-11-19 08:00:35,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7307 conditions, 2842 events. 1731/2842 cut-off events. For 398/398 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 16220 event pairs, 525 based on Foata normal form. 0/2440 useless extension candidates. Maximal degree in co-relation 7300. Up to 1117 conditions per place. [2023-11-19 08:00:35,659 INFO L140 encePairwiseOnDemand]: 380/388 looper letters, 60 selfloop transitions, 8 changer transitions 0/69 dead transitions. [2023-11-19 08:00:35,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 69 transitions, 370 flow [2023-11-19 08:00:35,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:00:35,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:00:35,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 555 transitions. [2023-11-19 08:00:35,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35760309278350516 [2023-11-19 08:00:35,663 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 555 transitions. [2023-11-19 08:00:35,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 555 transitions. [2023-11-19 08:00:35,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:00:35,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 555 transitions. [2023-11-19 08:00:35,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states 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:00:35,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 388.0) internal successors, (1940), 5 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states 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:00:35,672 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 388.0) internal successors, (1940), 5 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states 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:00:35,672 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 132 flow. Second operand 4 states and 555 transitions. [2023-11-19 08:00:35,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 69 transitions, 370 flow [2023-11-19 08:00:35,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 69 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:00:35,676 INFO L231 Difference]: Finished difference. Result has 48 places, 42 transitions, 190 flow [2023-11-19 08:00:35,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=48, PETRI_TRANSITIONS=42} [2023-11-19 08:00:35,677 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -19 predicate places. [2023-11-19 08:00:35,677 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 42 transitions, 190 flow [2023-11-19 08:00:35,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:00:35,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:00:35,678 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:00:35,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 08:00:35,679 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-19 08:00:35,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:35,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1014765166, now seen corresponding path program 1 times [2023-11-19 08:00:35,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:35,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872920899] [2023-11-19 08:00:35,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:35,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:36,109 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:00:36,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:36,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872920899] [2023-11-19 08:00:36,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872920899] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:36,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:36,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:00:36,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701039873] [2023-11-19 08:00:36,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:36,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:00:36,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:36,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:00:36,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:00:36,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 388 [2023-11-19 08:00:36,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 42 transitions, 190 flow. Second operand has 5 states, 5 states have (on average 131.4) internal successors, (657), 5 states have internal predecessors, (657), 0 states have call successors, (0), 0 states 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:00:36,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:00:36,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 388 [2023-11-19 08:00:36,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:00:36,719 INFO L124 PetriNetUnfolderBase]: 1546/2543 cut-off events. [2023-11-19 08:00:36,719 INFO L125 PetriNetUnfolderBase]: For 1578/1578 co-relation queries the response was YES. [2023-11-19 08:00:36,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7151 conditions, 2543 events. 1546/2543 cut-off events. For 1578/1578 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 14046 event pairs, 530 based on Foata normal form. 30/2429 useless extension candidates. Maximal degree in co-relation 7142. Up to 1562 conditions per place. [2023-11-19 08:00:36,740 INFO L140 encePairwiseOnDemand]: 384/388 looper letters, 57 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2023-11-19 08:00:36,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 61 transitions, 365 flow [2023-11-19 08:00:36,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:00:36,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:00:36,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 568 transitions. [2023-11-19 08:00:36,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36597938144329895 [2023-11-19 08:00:36,744 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 568 transitions. [2023-11-19 08:00:36,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 568 transitions. [2023-11-19 08:00:36,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:00:36,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 568 transitions. [2023-11-19 08:00:36,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states 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:00:36,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 388.0) internal successors, (1940), 5 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states 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:00:36,751 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 388.0) internal successors, (1940), 5 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states 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:00:36,751 INFO L175 Difference]: Start difference. First operand has 48 places, 42 transitions, 190 flow. Second operand 4 states and 568 transitions. [2023-11-19 08:00:36,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 61 transitions, 365 flow [2023-11-19 08:00:36,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 61 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:00:36,763 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 183 flow [2023-11-19 08:00:36,764 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2023-11-19 08:00:36,764 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -20 predicate places. [2023-11-19 08:00:36,765 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 183 flow [2023-11-19 08:00:36,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.4) internal successors, (657), 5 states have internal predecessors, (657), 0 states have call successors, (0), 0 states 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:00:36,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:00:36,765 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:00:36,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 08:00:36,766 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-19 08:00:36,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:36,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1014745932, now seen corresponding path program 1 times [2023-11-19 08:00:36,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:36,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817574032] [2023-11-19 08:00:36,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:36,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:37,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:00:37,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:37,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817574032] [2023-11-19 08:00:37,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817574032] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:37,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:37,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:00:37,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918952656] [2023-11-19 08:00:37,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:37,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:00:37,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:37,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:00:37,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:00:37,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 388 [2023-11-19 08:00:37,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 183 flow. Second operand has 5 states, 5 states have (on average 129.4) internal successors, (647), 5 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:00:37,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:00:37,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 388 [2023-11-19 08:00:37,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:00:37,876 INFO L124 PetriNetUnfolderBase]: 2241/3531 cut-off events. [2023-11-19 08:00:37,876 INFO L125 PetriNetUnfolderBase]: For 3358/3358 co-relation queries the response was YES. [2023-11-19 08:00:37,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10400 conditions, 3531 events. 2241/3531 cut-off events. For 3358/3358 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 21384 event pairs, 309 based on Foata normal form. 36/3338 useless extension candidates. Maximal degree in co-relation 10392. Up to 1600 conditions per place. [2023-11-19 08:00:37,908 INFO L140 encePairwiseOnDemand]: 384/388 looper letters, 95 selfloop transitions, 3 changer transitions 0/99 dead transitions. [2023-11-19 08:00:37,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 99 transitions, 676 flow [2023-11-19 08:00:37,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:00:37,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:00:37,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 572 transitions. [2023-11-19 08:00:37,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36855670103092786 [2023-11-19 08:00:37,913 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 572 transitions. [2023-11-19 08:00:37,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 572 transitions. [2023-11-19 08:00:37,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:00:37,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 572 transitions. [2023-11-19 08:00:37,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states 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:00:37,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 388.0) internal successors, (1940), 5 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states 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:00:37,921 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 388.0) internal successors, (1940), 5 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states 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:00:37,921 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 183 flow. Second operand 4 states and 572 transitions. [2023-11-19 08:00:37,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 99 transitions, 676 flow [2023-11-19 08:00:37,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 99 transitions, 668 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:00:37,937 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 198 flow [2023-11-19 08:00:37,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=198, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2023-11-19 08:00:37,938 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -17 predicate places. [2023-11-19 08:00:37,939 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 198 flow [2023-11-19 08:00:37,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.4) internal successors, (647), 5 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:00:37,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:00:37,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:00:37,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 08:00:37,940 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-19 08:00:37,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:37,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1392978535, now seen corresponding path program 1 times [2023-11-19 08:00:37,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:37,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647620576] [2023-11-19 08:00:37,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:37,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:37,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:38,374 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:00:38,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:38,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647620576] [2023-11-19 08:00:38,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647620576] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:38,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:38,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:00:38,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410858862] [2023-11-19 08:00:38,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:38,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:00:38,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:38,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:00:38,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:00:38,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 388 [2023-11-19 08:00:38,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states 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:00:38,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:00:38,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 388 [2023-11-19 08:00:38,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:00:39,066 INFO L124 PetriNetUnfolderBase]: 2223/3700 cut-off events. [2023-11-19 08:00:39,066 INFO L125 PetriNetUnfolderBase]: For 2617/2617 co-relation queries the response was YES. [2023-11-19 08:00:39,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11243 conditions, 3700 events. 2223/3700 cut-off events. For 2617/2617 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 22850 event pairs, 777 based on Foata normal form. 8/3480 useless extension candidates. Maximal degree in co-relation 11233. Up to 2269 conditions per place. [2023-11-19 08:00:39,095 INFO L140 encePairwiseOnDemand]: 385/388 looper letters, 58 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2023-11-19 08:00:39,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 62 transitions, 391 flow [2023-11-19 08:00:39,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:00:39,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:00:39,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 439 transitions. [2023-11-19 08:00:39,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37714776632302405 [2023-11-19 08:00:39,099 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 439 transitions. [2023-11-19 08:00:39,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 439 transitions. [2023-11-19 08:00:39,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:00:39,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 439 transitions. [2023-11-19 08:00:39,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states 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:00:39,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 388.0) internal successors, (1552), 4 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states 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:00:39,105 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 388.0) internal successors, (1552), 4 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states 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:00:39,105 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 198 flow. Second operand 3 states and 439 transitions. [2023-11-19 08:00:39,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 62 transitions, 391 flow [2023-11-19 08:00:39,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 62 transitions, 385 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:00:39,125 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 205 flow [2023-11-19 08:00:39,125 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=205, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-11-19 08:00:39,126 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -16 predicate places. [2023-11-19 08:00:39,126 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 205 flow [2023-11-19 08:00:39,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states 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:00:39,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:00:39,127 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:00:39,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 08:00:39,127 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-19 08:00:39,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:39,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1393034069, now seen corresponding path program 1 times [2023-11-19 08:00:39,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:39,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819448751] [2023-11-19 08:00:39,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:39,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:39,296 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:00:39,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:39,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819448751] [2023-11-19 08:00:39,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819448751] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:39,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:39,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:00:39,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974636548] [2023-11-19 08:00:39,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:39,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:00:39,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:39,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:00:39,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:00:39,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 388 [2023-11-19 08:00:39,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 205 flow. Second operand has 6 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 0 states have call successors, (0), 0 states 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:00:39,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:00:39,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 388 [2023-11-19 08:00:39,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:00:40,005 INFO L124 PetriNetUnfolderBase]: 2033/3239 cut-off events. [2023-11-19 08:00:40,005 INFO L125 PetriNetUnfolderBase]: For 2499/2499 co-relation queries the response was YES. [2023-11-19 08:00:40,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10684 conditions, 3239 events. 2033/3239 cut-off events. For 2499/2499 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 18410 event pairs, 322 based on Foata normal form. 53/3063 useless extension candidates. Maximal degree in co-relation 10673. Up to 1241 conditions per place. [2023-11-19 08:00:40,033 INFO L140 encePairwiseOnDemand]: 376/388 looper letters, 50 selfloop transitions, 19 changer transitions 0/70 dead transitions. [2023-11-19 08:00:40,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 70 transitions, 480 flow [2023-11-19 08:00:40,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 08:00:40,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 08:00:40,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 656 transitions. [2023-11-19 08:00:40,037 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33814432989690724 [2023-11-19 08:00:40,037 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 656 transitions. [2023-11-19 08:00:40,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 656 transitions. [2023-11-19 08:00:40,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:00:40,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 656 transitions. [2023-11-19 08:00:40,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.2) internal successors, (656), 5 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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:00:40,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 388.0) internal successors, (2328), 6 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states 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:00:40,045 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 388.0) internal successors, (2328), 6 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states 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:00:40,045 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 205 flow. Second operand 5 states and 656 transitions. [2023-11-19 08:00:40,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 70 transitions, 480 flow [2023-11-19 08:00:40,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 70 transitions, 468 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:00:40,064 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 351 flow [2023-11-19 08:00:40,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=351, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2023-11-19 08:00:40,065 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -11 predicate places. [2023-11-19 08:00:40,065 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 351 flow [2023-11-19 08:00:40,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 0 states have call successors, (0), 0 states 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:00:40,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:00:40,066 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:00:40,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 08:00:40,066 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-19 08:00:40,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:40,067 INFO L85 PathProgramCache]: Analyzing trace with hash 560810979, now seen corresponding path program 1 times [2023-11-19 08:00:40,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:40,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812053985] [2023-11-19 08:00:40,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:40,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:41,364 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:00:41,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:41,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812053985] [2023-11-19 08:00:41,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812053985] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:41,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:41,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 08:00:41,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358191329] [2023-11-19 08:00:41,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:41,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 08:00:41,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:41,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 08:00:41,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-19 08:00:41,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 388 [2023-11-19 08:00:41,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 351 flow. Second operand has 8 states, 8 states have (on average 116.75) internal successors, (934), 8 states have internal predecessors, (934), 0 states have call successors, (0), 0 states 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:00:41,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:00:41,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 388 [2023-11-19 08:00:41,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:00:42,339 INFO L124 PetriNetUnfolderBase]: 2365/3752 cut-off events. [2023-11-19 08:00:42,340 INFO L125 PetriNetUnfolderBase]: For 4658/4658 co-relation queries the response was YES. [2023-11-19 08:00:42,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13731 conditions, 3752 events. 2365/3752 cut-off events. For 4658/4658 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 21867 event pairs, 1114 based on Foata normal form. 4/3502 useless extension candidates. Maximal degree in co-relation 13718. Up to 3248 conditions per place. [2023-11-19 08:00:42,375 INFO L140 encePairwiseOnDemand]: 378/388 looper letters, 76 selfloop transitions, 14 changer transitions 0/91 dead transitions. [2023-11-19 08:00:42,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 91 transitions, 734 flow [2023-11-19 08:00:42,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 08:00:42,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-19 08:00:42,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 984 transitions. [2023-11-19 08:00:42,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3170103092783505 [2023-11-19 08:00:42,380 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 984 transitions. [2023-11-19 08:00:42,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 984 transitions. [2023-11-19 08:00:42,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:00:42,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 984 transitions. [2023-11-19 08:00:42,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 123.0) internal successors, (984), 8 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:00:42,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 388.0) internal successors, (3492), 9 states have internal predecessors, (3492), 0 states have call successors, (0), 0 states 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:00:42,437 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 388.0) internal successors, (3492), 9 states have internal predecessors, (3492), 0 states have call successors, (0), 0 states 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:00:42,437 INFO L175 Difference]: Start difference. First operand has 56 places, 50 transitions, 351 flow. Second operand 8 states and 984 transitions. [2023-11-19 08:00:42,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 91 transitions, 734 flow [2023-11-19 08:00:42,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 91 transitions, 734 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:00:42,468 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 506 flow [2023-11-19 08:00:42,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=506, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2023-11-19 08:00:42,469 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 1 predicate places. [2023-11-19 08:00:42,469 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 506 flow [2023-11-19 08:00:42,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 116.75) internal successors, (934), 8 states have internal predecessors, (934), 0 states have call successors, (0), 0 states 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:00:42,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:00:42,471 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:00:42,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 08:00:42,472 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-19 08:00:42,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:42,473 INFO L85 PathProgramCache]: Analyzing trace with hash 581203933, now seen corresponding path program 2 times [2023-11-19 08:00:42,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:42,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917948972] [2023-11-19 08:00:42,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:42,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:43,843 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:00:43,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:43,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917948972] [2023-11-19 08:00:43,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917948972] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:43,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:43,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 08:00:43,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256554730] [2023-11-19 08:00:43,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:43,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 08:00:43,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:43,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 08:00:43,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-19 08:00:44,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 388 [2023-11-19 08:00:44,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 506 flow. Second operand has 9 states, 9 states have (on average 116.55555555555556) internal successors, (1049), 9 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states 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:00:44,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:00:44,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 388 [2023-11-19 08:00:44,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:00:45,360 INFO L124 PetriNetUnfolderBase]: 2688/4248 cut-off events. [2023-11-19 08:00:45,360 INFO L125 PetriNetUnfolderBase]: For 6924/6924 co-relation queries the response was YES. [2023-11-19 08:00:45,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16545 conditions, 4248 events. 2688/4248 cut-off events. For 6924/6924 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 25351 event pairs, 669 based on Foata normal form. 4/3972 useless extension candidates. Maximal degree in co-relation 16526. Up to 3287 conditions per place. [2023-11-19 08:00:45,401 INFO L140 encePairwiseOnDemand]: 378/388 looper letters, 78 selfloop transitions, 26 changer transitions 0/105 dead transitions. [2023-11-19 08:00:45,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 105 transitions, 952 flow [2023-11-19 08:00:45,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 08:00:45,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-19 08:00:45,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1102 transitions. [2023-11-19 08:00:45,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31557846506300113 [2023-11-19 08:00:45,407 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1102 transitions. [2023-11-19 08:00:45,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1102 transitions. [2023-11-19 08:00:45,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:00:45,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1102 transitions. [2023-11-19 08:00:45,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 122.44444444444444) internal successors, (1102), 9 states have internal predecessors, (1102), 0 states have call successors, (0), 0 states 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:00:45,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 388.0) internal successors, (3880), 10 states have internal predecessors, (3880), 0 states have call successors, (0), 0 states 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:00:45,422 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 388.0) internal successors, (3880), 10 states have internal predecessors, (3880), 0 states have call successors, (0), 0 states 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:00:45,422 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 506 flow. Second operand 9 states and 1102 transitions. [2023-11-19 08:00:45,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 105 transitions, 952 flow [2023-11-19 08:00:45,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 105 transitions, 946 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-11-19 08:00:45,464 INFO L231 Difference]: Finished difference. Result has 80 places, 76 transitions, 719 flow [2023-11-19 08:00:45,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=719, PETRI_PLACES=80, PETRI_TRANSITIONS=76} [2023-11-19 08:00:45,465 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 13 predicate places. [2023-11-19 08:00:45,465 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 76 transitions, 719 flow [2023-11-19 08:00:45,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 116.55555555555556) internal successors, (1049), 9 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states 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:00:45,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:00:45,466 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:00:45,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 08:00:45,467 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-19 08:00:45,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:45,467 INFO L85 PathProgramCache]: Analyzing trace with hash -917739755, now seen corresponding path program 3 times [2023-11-19 08:00:45,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:45,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259873669] [2023-11-19 08:00:45,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:45,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:45,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:46,697 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:00:46,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:46,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259873669] [2023-11-19 08:00:46,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259873669] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:46,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:46,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 08:00:46,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554242007] [2023-11-19 08:00:46,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:46,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 08:00:46,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:46,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 08:00:46,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-19 08:00:46,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 388 [2023-11-19 08:00:46,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 76 transitions, 719 flow. Second operand has 9 states, 9 states have (on average 115.55555555555556) internal successors, (1040), 9 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states 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:00:46,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:00:46,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 388 [2023-11-19 08:00:46,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:00:48,094 INFO L124 PetriNetUnfolderBase]: 2680/4236 cut-off events. [2023-11-19 08:00:48,094 INFO L125 PetriNetUnfolderBase]: For 9207/9207 co-relation queries the response was YES. [2023-11-19 08:00:48,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17703 conditions, 4236 events. 2680/4236 cut-off events. For 9207/9207 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 25279 event pairs, 317 based on Foata normal form. 4/3960 useless extension candidates. Maximal degree in co-relation 17679. Up to 2553 conditions per place. [2023-11-19 08:00:48,142 INFO L140 encePairwiseOnDemand]: 379/388 looper letters, 87 selfloop transitions, 47 changer transitions 0/135 dead transitions. [2023-11-19 08:00:48,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 135 transitions, 1354 flow [2023-11-19 08:00:48,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-19 08:00:48,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-19 08:00:48,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1339 transitions. [2023-11-19 08:00:48,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.313730084348641 [2023-11-19 08:00:48,149 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1339 transitions. [2023-11-19 08:00:48,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1339 transitions. [2023-11-19 08:00:48,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:00:48,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1339 transitions. [2023-11-19 08:00:48,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 121.72727272727273) internal successors, (1339), 11 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states 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:00:48,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 388.0) internal successors, (4656), 12 states have internal predecessors, (4656), 0 states have call successors, (0), 0 states 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:00:48,165 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 388.0) internal successors, (4656), 12 states have internal predecessors, (4656), 0 states have call successors, (0), 0 states 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:00:48,165 INFO L175 Difference]: Start difference. First operand has 80 places, 76 transitions, 719 flow. Second operand 11 states and 1339 transitions. [2023-11-19 08:00:48,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 135 transitions, 1354 flow [2023-11-19 08:00:48,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 135 transitions, 1306 flow, removed 22 selfloop flow, removed 1 redundant places. [2023-11-19 08:00:48,224 INFO L231 Difference]: Finished difference. Result has 93 places, 93 transitions, 1017 flow [2023-11-19 08:00:48,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1017, PETRI_PLACES=93, PETRI_TRANSITIONS=93} [2023-11-19 08:00:48,225 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 26 predicate places. [2023-11-19 08:00:48,225 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 93 transitions, 1017 flow [2023-11-19 08:00:48,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.55555555555556) internal successors, (1040), 9 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states 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:00:48,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:00:48,226 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:00:48,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 08:00:48,227 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-19 08:00:48,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:48,227 INFO L85 PathProgramCache]: Analyzing trace with hash 234383526, now seen corresponding path program 1 times [2023-11-19 08:00:48,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:48,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071666931] [2023-11-19 08:00:48,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:48,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:48,728 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:00:48,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:48,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071666931] [2023-11-19 08:00:48,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071666931] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:48,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:48,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 08:00:48,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003653627] [2023-11-19 08:00:48,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:48,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 08:00:48,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:48,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 08:00:48,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-19 08:00:49,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 388 [2023-11-19 08:00:49,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 93 transitions, 1017 flow. Second operand has 9 states, 9 states have (on average 115.55555555555556) internal successors, (1040), 9 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states 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:00:49,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:00:49,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 388 [2023-11-19 08:00:49,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:00:50,081 INFO L124 PetriNetUnfolderBase]: 2117/3375 cut-off events. [2023-11-19 08:00:50,081 INFO L125 PetriNetUnfolderBase]: For 10446/10446 co-relation queries the response was YES. [2023-11-19 08:00:50,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14869 conditions, 3375 events. 2117/3375 cut-off events. For 10446/10446 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 19472 event pairs, 109 based on Foata normal form. 0/3375 useless extension candidates. Maximal degree in co-relation 14841. Up to 1008 conditions per place. [2023-11-19 08:00:50,111 INFO L140 encePairwiseOnDemand]: 380/388 looper letters, 87 selfloop transitions, 29 changer transitions 8/125 dead transitions. [2023-11-19 08:00:50,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 125 transitions, 1395 flow [2023-11-19 08:00:50,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 08:00:50,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-19 08:00:50,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 980 transitions. [2023-11-19 08:00:50,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31572164948453607 [2023-11-19 08:00:50,119 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 980 transitions. [2023-11-19 08:00:50,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 980 transitions. [2023-11-19 08:00:50,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:00:50,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 980 transitions. [2023-11-19 08:00:50,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 122.5) internal successors, (980), 8 states have internal predecessors, (980), 0 states have call successors, (0), 0 states 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:00:50,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 388.0) internal successors, (3492), 9 states have internal predecessors, (3492), 0 states have call successors, (0), 0 states 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:00:50,132 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 388.0) internal successors, (3492), 9 states have internal predecessors, (3492), 0 states have call successors, (0), 0 states 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:00:50,132 INFO L175 Difference]: Start difference. First operand has 93 places, 93 transitions, 1017 flow. Second operand 8 states and 980 transitions. [2023-11-19 08:00:50,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 125 transitions, 1395 flow [2023-11-19 08:00:50,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 125 transitions, 1349 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-11-19 08:00:50,196 INFO L231 Difference]: Finished difference. Result has 96 places, 79 transitions, 863 flow [2023-11-19 08:00:50,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=887, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=863, PETRI_PLACES=96, PETRI_TRANSITIONS=79} [2023-11-19 08:00:50,197 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 29 predicate places. [2023-11-19 08:00:50,197 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 79 transitions, 863 flow [2023-11-19 08:00:50,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.55555555555556) internal successors, (1040), 9 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states 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:00:50,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:00:50,198 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:00:50,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 08:00:50,199 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-19 08:00:50,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:50,199 INFO L85 PathProgramCache]: Analyzing trace with hash 234383451, now seen corresponding path program 1 times [2023-11-19 08:00:50,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:50,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640174378] [2023-11-19 08:00:50,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:50,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:50,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:50,500 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:00:50,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:50,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640174378] [2023-11-19 08:00:50,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640174378] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:50,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:50,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 08:00:50,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731947338] [2023-11-19 08:00:50,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:50,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 08:00:50,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:50,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 08:00:50,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-19 08:00:50,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 388 [2023-11-19 08:00:50,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 79 transitions, 863 flow. Second operand has 8 states, 8 states have (on average 118.75) internal successors, (950), 8 states have internal predecessors, (950), 0 states have call successors, (0), 0 states 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:00:50,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:00:50,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 388 [2023-11-19 08:00:50,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:00:51,524 INFO L124 PetriNetUnfolderBase]: 1815/2959 cut-off events. [2023-11-19 08:00:51,525 INFO L125 PetriNetUnfolderBase]: For 10053/10053 co-relation queries the response was YES. [2023-11-19 08:00:51,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12984 conditions, 2959 events. 1815/2959 cut-off events. For 10053/10053 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 17079 event pairs, 211 based on Foata normal form. 73/3032 useless extension candidates. Maximal degree in co-relation 12956. Up to 1008 conditions per place. [2023-11-19 08:00:51,550 INFO L140 encePairwiseOnDemand]: 376/388 looper letters, 80 selfloop transitions, 29 changer transitions 0/110 dead transitions. [2023-11-19 08:00:51,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 110 transitions, 1238 flow [2023-11-19 08:00:51,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 08:00:51,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 08:00:51,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 882 transitions. [2023-11-19 08:00:51,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3247422680412371 [2023-11-19 08:00:51,556 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 882 transitions. [2023-11-19 08:00:51,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 882 transitions. [2023-11-19 08:00:51,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:00:51,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 882 transitions. [2023-11-19 08:00:51,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.0) internal successors, (882), 7 states have internal predecessors, (882), 0 states have call successors, (0), 0 states 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:00:51,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 388.0) internal successors, (3104), 8 states have internal predecessors, (3104), 0 states have call successors, (0), 0 states 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:00:51,568 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 388.0) internal successors, (3104), 8 states have internal predecessors, (3104), 0 states have call successors, (0), 0 states 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:00:51,569 INFO L175 Difference]: Start difference. First operand has 96 places, 79 transitions, 863 flow. Second operand 7 states and 882 transitions. [2023-11-19 08:00:51,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 110 transitions, 1238 flow [2023-11-19 08:00:51,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 110 transitions, 1178 flow, removed 2 selfloop flow, removed 7 redundant places. [2023-11-19 08:00:51,624 INFO L231 Difference]: Finished difference. Result has 97 places, 81 transitions, 921 flow [2023-11-19 08:00:51,625 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=921, PETRI_PLACES=97, PETRI_TRANSITIONS=81} [2023-11-19 08:00:51,625 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 30 predicate places. [2023-11-19 08:00:51,626 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 81 transitions, 921 flow [2023-11-19 08:00:51,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 118.75) internal successors, (950), 8 states have internal predecessors, (950), 0 states have call successors, (0), 0 states 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:00:51,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:00:51,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:00:51,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 08:00:51,628 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-19 08:00:51,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:51,628 INFO L85 PathProgramCache]: Analyzing trace with hash -262765564, now seen corresponding path program 1 times [2023-11-19 08:00:51,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:51,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021561330] [2023-11-19 08:00:51,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:51,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:51,806 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:00:51,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:51,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021561330] [2023-11-19 08:00:51,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021561330] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:51,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:51,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:00:51,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082981420] [2023-11-19 08:00:51,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:51,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:00:51,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:51,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:00:51,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:00:51,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 388 [2023-11-19 08:00:51,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 81 transitions, 921 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states 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:00:51,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:00:51,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 388 [2023-11-19 08:00:51,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:00:52,210 INFO L124 PetriNetUnfolderBase]: 993/1785 cut-off events. [2023-11-19 08:00:52,210 INFO L125 PetriNetUnfolderBase]: For 7240/7240 co-relation queries the response was YES. [2023-11-19 08:00:52,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8263 conditions, 1785 events. 993/1785 cut-off events. For 7240/7240 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10182 event pairs, 198 based on Foata normal form. 32/1816 useless extension candidates. Maximal degree in co-relation 8234. Up to 1653 conditions per place. [2023-11-19 08:00:52,222 INFO L140 encePairwiseOnDemand]: 383/388 looper letters, 102 selfloop transitions, 4 changer transitions 0/107 dead transitions. [2023-11-19 08:00:52,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 107 transitions, 1322 flow [2023-11-19 08:00:52,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:00:52,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:00:52,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2023-11-19 08:00:52,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36254295532646047 [2023-11-19 08:00:52,227 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2023-11-19 08:00:52,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2023-11-19 08:00:52,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:00:52,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2023-11-19 08:00:52,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:00:52,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 388.0) internal successors, (1552), 4 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states 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:00:52,233 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 388.0) internal successors, (1552), 4 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states 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:00:52,233 INFO L175 Difference]: Start difference. First operand has 97 places, 81 transitions, 921 flow. Second operand 3 states and 422 transitions. [2023-11-19 08:00:52,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 107 transitions, 1322 flow [2023-11-19 08:00:52,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 107 transitions, 1266 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-11-19 08:00:52,263 INFO L231 Difference]: Finished difference. Result has 95 places, 84 transitions, 897 flow [2023-11-19 08:00:52,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=871, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=897, PETRI_PLACES=95, PETRI_TRANSITIONS=84} [2023-11-19 08:00:52,264 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 28 predicate places. [2023-11-19 08:00:52,265 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 84 transitions, 897 flow [2023-11-19 08:00:52,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states 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:00:52,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:00:52,265 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:00:52,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 08:00:52,266 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-19 08:00:52,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:52,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1170638442, now seen corresponding path program 1 times [2023-11-19 08:00:52,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:52,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194898485] [2023-11-19 08:00:52,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:52,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:52,459 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:00:52,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:52,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194898485] [2023-11-19 08:00:52,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194898485] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:52,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:52,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:00:52,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103516005] [2023-11-19 08:00:52,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:52,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:00:52,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:52,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:00:52,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:00:52,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 388 [2023-11-19 08:00:52,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 84 transitions, 897 flow. Second operand has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states 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:00:52,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:00:52,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 388 [2023-11-19 08:00:52,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:00:52,738 INFO L124 PetriNetUnfolderBase]: 311/660 cut-off events. [2023-11-19 08:00:52,739 INFO L125 PetriNetUnfolderBase]: For 2220/2220 co-relation queries the response was YES. [2023-11-19 08:00:52,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3212 conditions, 660 events. 311/660 cut-off events. For 2220/2220 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3255 event pairs, 29 based on Foata normal form. 47/706 useless extension candidates. Maximal degree in co-relation 3181. Up to 374 conditions per place. [2023-11-19 08:00:52,746 INFO L140 encePairwiseOnDemand]: 383/388 looper letters, 94 selfloop transitions, 7 changer transitions 4/106 dead transitions. [2023-11-19 08:00:52,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 106 transitions, 1206 flow [2023-11-19 08:00:52,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:00:52,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:00:52,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 560 transitions. [2023-11-19 08:00:52,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36082474226804123 [2023-11-19 08:00:52,750 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 560 transitions. [2023-11-19 08:00:52,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 560 transitions. [2023-11-19 08:00:52,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:00:52,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 560 transitions. [2023-11-19 08:00:52,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states 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:00:52,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 388.0) internal successors, (1940), 5 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states 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:00:52,757 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 388.0) internal successors, (1940), 5 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states 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:00:52,757 INFO L175 Difference]: Start difference. First operand has 95 places, 84 transitions, 897 flow. Second operand 4 states and 560 transitions. [2023-11-19 08:00:52,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 106 transitions, 1206 flow [2023-11-19 08:00:52,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 106 transitions, 1151 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-11-19 08:00:52,771 INFO L231 Difference]: Finished difference. Result has 93 places, 68 transitions, 658 flow [2023-11-19 08:00:52,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=658, PETRI_PLACES=93, PETRI_TRANSITIONS=68} [2023-11-19 08:00:52,772 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 26 predicate places. [2023-11-19 08:00:52,772 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 68 transitions, 658 flow [2023-11-19 08:00:52,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states 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:00:52,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:00:52,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:00:52,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-19 08:00:52,774 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-19 08:00:52,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:52,774 INFO L85 PathProgramCache]: Analyzing trace with hash -252359676, now seen corresponding path program 1 times [2023-11-19 08:00:52,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:52,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016638669] [2023-11-19 08:00:52,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:52,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:53,167 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:00:53,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:53,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016638669] [2023-11-19 08:00:53,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016638669] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:53,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:53,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:00:53,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856351547] [2023-11-19 08:00:53,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:53,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:00:53,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:53,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:00:53,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:00:53,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 388 [2023-11-19 08:00:53,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 68 transitions, 658 flow. Second operand has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 0 states 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:00:53,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:00:53,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 388 [2023-11-19 08:00:53,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:00:53,730 INFO L124 PetriNetUnfolderBase]: 794/1655 cut-off events. [2023-11-19 08:00:53,730 INFO L125 PetriNetUnfolderBase]: For 5203/5203 co-relation queries the response was YES. [2023-11-19 08:00:53,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7724 conditions, 1655 events. 794/1655 cut-off events. For 5203/5203 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 9951 event pairs, 200 based on Foata normal form. 5/1660 useless extension candidates. Maximal degree in co-relation 7695. Up to 569 conditions per place. [2023-11-19 08:00:53,744 INFO L140 encePairwiseOnDemand]: 383/388 looper letters, 156 selfloop transitions, 9 changer transitions 5/170 dead transitions. [2023-11-19 08:00:53,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 170 transitions, 1933 flow [2023-11-19 08:00:53,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:00:53,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 08:00:53,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 832 transitions. [2023-11-19 08:00:53,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35738831615120276 [2023-11-19 08:00:53,749 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 832 transitions. [2023-11-19 08:00:53,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 832 transitions. [2023-11-19 08:00:53,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:00:53,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 832 transitions. [2023-11-19 08:00:53,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 138.66666666666666) internal successors, (832), 6 states have internal predecessors, (832), 0 states have call successors, (0), 0 states 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:00:53,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 388.0) internal successors, (2716), 7 states have internal predecessors, (2716), 0 states have call successors, (0), 0 states 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:00:53,759 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 388.0) internal successors, (2716), 7 states have internal predecessors, (2716), 0 states have call successors, (0), 0 states 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:00:53,759 INFO L175 Difference]: Start difference. First operand has 93 places, 68 transitions, 658 flow. Second operand 6 states and 832 transitions. [2023-11-19 08:00:53,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 170 transitions, 1933 flow [2023-11-19 08:00:53,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 170 transitions, 1855 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-11-19 08:00:53,784 INFO L231 Difference]: Finished difference. Result has 97 places, 70 transitions, 673 flow [2023-11-19 08:00:53,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=673, PETRI_PLACES=97, PETRI_TRANSITIONS=70} [2023-11-19 08:00:53,785 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 30 predicate places. [2023-11-19 08:00:53,785 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 70 transitions, 673 flow [2023-11-19 08:00:53,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 0 states 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:00:53,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:00:53,786 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:00:53,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-19 08:00:53,786 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-19 08:00:53,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:53,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1952124536, now seen corresponding path program 2 times [2023-11-19 08:00:53,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:53,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691238668] [2023-11-19 08:00:53,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:53,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:53,985 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:00:53,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:53,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691238668] [2023-11-19 08:00:53,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691238668] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:53,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:53,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:00:53,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002868584] [2023-11-19 08:00:53,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:53,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:00:53,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:53,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:00:53,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:00:53,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 388 [2023-11-19 08:00:53,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 70 transitions, 673 flow. Second operand has 5 states, 5 states have (on average 130.4) internal successors, (652), 5 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:00:53,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:00:53,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 388 [2023-11-19 08:00:53,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:00:54,229 INFO L124 PetriNetUnfolderBase]: 346/724 cut-off events. [2023-11-19 08:00:54,229 INFO L125 PetriNetUnfolderBase]: For 2461/2489 co-relation queries the response was YES. [2023-11-19 08:00:54,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3322 conditions, 724 events. 346/724 cut-off events. For 2461/2489 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4055 event pairs, 25 based on Foata normal form. 74/779 useless extension candidates. Maximal degree in co-relation 3291. Up to 313 conditions per place. [2023-11-19 08:00:54,234 INFO L140 encePairwiseOnDemand]: 383/388 looper letters, 64 selfloop transitions, 10 changer transitions 9/84 dead transitions. [2023-11-19 08:00:54,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 84 transitions, 842 flow [2023-11-19 08:00:54,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 08:00:54,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 08:00:54,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 684 transitions. [2023-11-19 08:00:54,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3525773195876289 [2023-11-19 08:00:54,237 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 684 transitions. [2023-11-19 08:00:54,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 684 transitions. [2023-11-19 08:00:54,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:00:54,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 684 transitions. [2023-11-19 08:00:54,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:00:54,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 388.0) internal successors, (2328), 6 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states 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:00:54,244 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 388.0) internal successors, (2328), 6 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states 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:00:54,245 INFO L175 Difference]: Start difference. First operand has 97 places, 70 transitions, 673 flow. Second operand 5 states and 684 transitions. [2023-11-19 08:00:54,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 84 transitions, 842 flow [2023-11-19 08:00:54,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 84 transitions, 678 flow, removed 8 selfloop flow, removed 20 redundant places. [2023-11-19 08:00:54,252 INFO L231 Difference]: Finished difference. Result has 73 places, 42 transitions, 290 flow [2023-11-19 08:00:54,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=290, PETRI_PLACES=73, PETRI_TRANSITIONS=42} [2023-11-19 08:00:54,253 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 6 predicate places. [2023-11-19 08:00:54,253 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 42 transitions, 290 flow [2023-11-19 08:00:54,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.4) internal successors, (652), 5 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:00:54,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:00:54,254 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:00:54,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-19 08:00:54,254 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-19 08:00:54,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:54,254 INFO L85 PathProgramCache]: Analyzing trace with hash 477874075, now seen corresponding path program 1 times [2023-11-19 08:00:54,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:54,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965734891] [2023-11-19 08:00:54,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:54,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:00:54,322 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:00:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:00:54,413 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:00:54,414 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 08:00:54,415 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (52 of 53 remaining) [2023-11-19 08:00:54,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 53 remaining) [2023-11-19 08:00:54,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 53 remaining) [2023-11-19 08:00:54,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 53 remaining) [2023-11-19 08:00:54,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 53 remaining) [2023-11-19 08:00:54,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 53 remaining) [2023-11-19 08:00:54,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 53 remaining) [2023-11-19 08:00:54,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 53 remaining) [2023-11-19 08:00:54,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 53 remaining) [2023-11-19 08:00:54,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 53 remaining) [2023-11-19 08:00:54,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 53 remaining) [2023-11-19 08:00:54,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 53 remaining) [2023-11-19 08:00:54,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 53 remaining) [2023-11-19 08:00:54,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 53 remaining) [2023-11-19 08:00:54,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 53 remaining) [2023-11-19 08:00:54,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 53 remaining) [2023-11-19 08:00:54,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 53 remaining) [2023-11-19 08:00:54,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 53 remaining) [2023-11-19 08:00:54,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 53 remaining) [2023-11-19 08:00:54,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 53 remaining) [2023-11-19 08:00:54,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 53 remaining) [2023-11-19 08:00:54,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 53 remaining) [2023-11-19 08:00:54,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 53 remaining) [2023-11-19 08:00:54,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 53 remaining) [2023-11-19 08:00:54,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 53 remaining) [2023-11-19 08:00:54,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 53 remaining) [2023-11-19 08:00:54,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 53 remaining) [2023-11-19 08:00:54,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 53 remaining) [2023-11-19 08:00:54,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 53 remaining) [2023-11-19 08:00:54,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 53 remaining) [2023-11-19 08:00:54,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 53 remaining) [2023-11-19 08:00:54,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (21 of 53 remaining) [2023-11-19 08:00:54,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 53 remaining) [2023-11-19 08:00:54,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 53 remaining) [2023-11-19 08:00:54,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 53 remaining) [2023-11-19 08:00:54,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 53 remaining) [2023-11-19 08:00:54,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 53 remaining) [2023-11-19 08:00:54,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 53 remaining) [2023-11-19 08:00:54,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 53 remaining) [2023-11-19 08:00:54,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 53 remaining) [2023-11-19 08:00:54,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 53 remaining) [2023-11-19 08:00:54,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 53 remaining) [2023-11-19 08:00:54,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 53 remaining) [2023-11-19 08:00:54,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 53 remaining) [2023-11-19 08:00:54,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 53 remaining) [2023-11-19 08:00:54,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 53 remaining) [2023-11-19 08:00:54,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 53 remaining) [2023-11-19 08:00:54,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 53 remaining) [2023-11-19 08:00:54,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 53 remaining) [2023-11-19 08:00:54,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 53 remaining) [2023-11-19 08:00:54,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 53 remaining) [2023-11-19 08:00:54,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 53 remaining) [2023-11-19 08:00:54,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 53 remaining) [2023-11-19 08:00:54,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-19 08:00:54,430 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:00:54,436 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 08:00:54,437 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 08:00:54,487 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated [2023-11-19 08:00:54,492 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre16 could not be translated [2023-11-19 08:00:54,495 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre18 could not be translated [2023-11-19 08:00:54,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:00:54 BasicIcfg [2023-11-19 08:00:54,515 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 08:00:54,516 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 08:00:54,516 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 08:00:54,516 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 08:00:54,517 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:00:17" (3/4) ... [2023-11-19 08:00:54,519 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 08:00:54,520 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 08:00:54,521 INFO L158 Benchmark]: Toolchain (without parser) took 39171.90ms. Allocated memory was 174.1MB in the beginning and 1.2GB in the end (delta: 998.2MB). Free memory was 125.4MB in the beginning and 448.0MB in the end (delta: -322.6MB). Peak memory consumption was 676.1MB. Max. memory is 16.1GB. [2023-11-19 08:00:54,521 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 130.0MB. Free memory is still 74.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 08:00:54,522 INFO L158 Benchmark]: CACSL2BoogieTranslator took 742.96ms. Allocated memory is still 174.1MB. Free memory was 124.9MB in the beginning and 102.3MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-19 08:00:54,522 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.40ms. Allocated memory is still 174.1MB. Free memory was 101.8MB in the beginning and 99.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 08:00:54,522 INFO L158 Benchmark]: Boogie Preprocessor took 74.88ms. Allocated memory is still 174.1MB. Free memory was 99.6MB in the beginning and 97.6MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 08:00:54,523 INFO L158 Benchmark]: RCFGBuilder took 1244.81ms. Allocated memory is still 174.1MB. Free memory was 97.6MB in the beginning and 77.5MB in the end (delta: 20.1MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2023-11-19 08:00:54,523 INFO L158 Benchmark]: TraceAbstraction took 37006.62ms. Allocated memory was 174.1MB in the beginning and 1.2GB in the end (delta: 998.2MB). Free memory was 76.5MB in the beginning and 448.0MB in the end (delta: -371.5MB). Peak memory consumption was 626.7MB. Max. memory is 16.1GB. [2023-11-19 08:00:54,523 INFO L158 Benchmark]: Witness Printer took 4.25ms. Allocated memory is still 1.2GB. Free memory is still 448.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 08:00:54,525 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 130.0MB. Free memory is still 74.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 742.96ms. Allocated memory is still 174.1MB. Free memory was 124.9MB in the beginning and 102.3MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.40ms. Allocated memory is still 174.1MB. Free memory was 101.8MB in the beginning and 99.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 74.88ms. Allocated memory is still 174.1MB. Free memory was 99.6MB in the beginning and 97.6MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1244.81ms. Allocated memory is still 174.1MB. Free memory was 97.6MB in the beginning and 77.5MB in the end (delta: 20.1MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. * TraceAbstraction took 37006.62ms. Allocated memory was 174.1MB in the beginning and 1.2GB in the end (delta: 998.2MB). Free memory was 76.5MB in the beginning and 448.0MB in the end (delta: -371.5MB). Peak memory consumption was 626.7MB. Max. memory is 16.1GB. * Witness Printer took 4.25ms. Allocated memory is still 1.2GB. Free memory is still 448.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre18 could not be translated - 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: 10.4s, 171 PlacesBefore, 67 PlacesAfterwards, 184 TransitionsBefore, 59 TransitionsAfterwards, 8040 CoEnabledTransitionPairs, 7 FixpointIterations, 69 TrivialSequentialCompositions, 96 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 21 ChoiceCompositions, 201 TotalNumberOfCompositions, 21237 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9170, independent: 8759, independent conditional: 0, independent unconditional: 8759, dependent: 411, dependent conditional: 0, dependent unconditional: 411, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3116, independent: 3041, independent conditional: 0, independent unconditional: 3041, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9170, independent: 5718, independent conditional: 0, independent unconditional: 5718, dependent: 336, dependent conditional: 0, dependent unconditional: 336, unknown: 3116, unknown conditional: 0, unknown unconditional: 3116] , Statistics on independence cache: Total cache size (in pairs): 286, Positive cache size: 253, Positive conditional cache size: 0, Positive unconditional cache size: 253, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L831] 0 pthread_t t2213; [L832] FCALL, FORK 0 pthread_create(&t2213, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2213={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] EXPR 1 \read(y) [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L766] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L767] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L768] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L769] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L771] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L833] 0 pthread_t t2214; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2213={7:0}, t2214={8:0}, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L834] FCALL, FORK 0 pthread_create(&t2214, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2213={7:0}, t2214={8:0}, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L779] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L791] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L835] 0 pthread_t t2215; [L836] FCALL, FORK 0 pthread_create(&t2215, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2213={7:0}, t2214={8:0}, t2215={5:0}, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L803] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L806] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L809] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L809] EXPR 3 \read(y) [L809] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L809] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L810] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L811] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L812] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L813] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 2 return 0; [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L842] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L842] EXPR 0 \read(y) [L842] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L842] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L842] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L843] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L844] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L845] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L846] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2213={7:0}, t2214={8:0}, t2215={5:0}, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L849] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L850] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L850] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L850] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L850] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L850] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L850] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L851] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe018_rmo.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - 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: -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: -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: -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: -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: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 832]: 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. - UnprovableResult [Line: 834]: 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, 209 locations, 53 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: 36.7s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 17.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1986 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1549 mSDsluCounter, 682 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 560 mSDsCounter, 290 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4309 IncrementalHoareTripleChecker+Invalid, 4599 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 290 mSolverCounterUnsat, 122 mSDtfsCounter, 4309 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1017occurred in iteration=13, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 248 NumberOfCodeBlocks, 248 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 209 ConstructedInterpolants, 0 QuantifiedInterpolants, 2199 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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:00:54,580 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9de75e8-447b-4b8f-ac6f-31b2c5502382/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...