./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix047_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c91b946b-a085-4140-abba-d498476d1077/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c91b946b-a085-4140-abba-d498476d1077/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c91b946b-a085-4140-abba-d498476d1077/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c91b946b-a085-4140-abba-d498476d1077/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix047_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c91b946b-a085-4140-abba-d498476d1077/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c91b946b-a085-4140-abba-d498476d1077/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dcc3fad0768415d67ba0b5226238487b935d262c55e83ab1790d239680fbb73d --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:38:15,383 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:38:15,454 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c91b946b-a085-4140-abba-d498476d1077/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:38:15,460 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:38:15,461 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:38:15,490 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:38:15,491 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:38:15,492 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:38:15,493 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:38:15,502 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:38:15,503 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:38:15,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:38:15,505 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:38:15,507 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:38:15,508 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:38:15,509 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:38:15,509 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:38:15,510 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:38:15,511 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:38:15,511 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:38:15,512 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:38:15,513 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:38:15,513 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:38:15,514 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:38:15,514 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:38:15,515 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:38:15,516 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:38:15,516 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:38:15,517 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:38:15,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:38:15,519 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:38:15,519 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:38:15,519 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:38:15,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:38:15,520 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:38:15,520 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:38:15,521 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:38:15,521 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:38:15,521 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_c91b946b-a085-4140-abba-d498476d1077/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c91b946b-a085-4140-abba-d498476d1077/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dcc3fad0768415d67ba0b5226238487b935d262c55e83ab1790d239680fbb73d [2023-11-06 22:38:15,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:38:15,863 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:38:15,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:38:15,874 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:38:15,875 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:38:15,876 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c91b946b-a085-4140-abba-d498476d1077/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix047_power.oepc_pso.oepc_rmo.oepc.i [2023-11-06 22:38:18,993 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:38:19,335 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:38:19,340 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c91b946b-a085-4140-abba-d498476d1077/sv-benchmarks/c/pthread-wmm/mix047_power.oepc_pso.oepc_rmo.oepc.i [2023-11-06 22:38:19,374 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c91b946b-a085-4140-abba-d498476d1077/bin/uautomizer-verify-WvqO1wxjHP/data/b8327e2e5/60aae15e765844a6b0094e7a49bf02b2/FLAG774f647a1 [2023-11-06 22:38:19,394 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c91b946b-a085-4140-abba-d498476d1077/bin/uautomizer-verify-WvqO1wxjHP/data/b8327e2e5/60aae15e765844a6b0094e7a49bf02b2 [2023-11-06 22:38:19,404 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:38:19,408 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:38:19,415 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:38:19,415 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:38:19,421 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:38:19,423 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:38:19" (1/1) ... [2023-11-06 22:38:19,424 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34346a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:19, skipping insertion in model container [2023-11-06 22:38:19,425 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:38:19" (1/1) ... [2023-11-06 22:38:19,514 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:38:19,981 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:38:19,995 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:38:20,062 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:38:20,105 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:38:20,106 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:38:20,113 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:38:20,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:20 WrapperNode [2023-11-06 22:38:20,114 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:38:20,116 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:38:20,116 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:38:20,116 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:38:20,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:20" (1/1) ... [2023-11-06 22:38:20,164 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:20" (1/1) ... [2023-11-06 22:38:20,220 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 149 [2023-11-06 22:38:20,226 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:38:20,227 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:38:20,227 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:38:20,227 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:38:20,239 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:20" (1/1) ... [2023-11-06 22:38:20,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:20" (1/1) ... [2023-11-06 22:38:20,252 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:20" (1/1) ... [2023-11-06 22:38:20,252 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:20" (1/1) ... [2023-11-06 22:38:20,264 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:20" (1/1) ... [2023-11-06 22:38:20,270 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:20" (1/1) ... [2023-11-06 22:38:20,290 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:20" (1/1) ... [2023-11-06 22:38:20,299 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:20" (1/1) ... [2023-11-06 22:38:20,303 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:38:20,318 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:38:20,318 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:38:20,318 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:38:20,319 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:20" (1/1) ... [2023-11-06 22:38:20,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:38:20,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c91b946b-a085-4140-abba-d498476d1077/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:20,359 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c91b946b-a085-4140-abba-d498476d1077/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:20,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c91b946b-a085-4140-abba-d498476d1077/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:38:20,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:38:20,416 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:38:20,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:38:20,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:38:20,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:38:20,417 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:38:20,417 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:38:20,417 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:38:20,418 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:38:20,418 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:38:20,418 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:38:20,418 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 22:38:20,419 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 22:38:20,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:38:20,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:38:20,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:38:20,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:38:20,423 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:38:20,625 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:38:20,627 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:38:21,027 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:38:21,197 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:38:21,197 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:38:21,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:38:21 BoogieIcfgContainer [2023-11-06 22:38:21,200 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:38:21,202 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:38:21,203 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:38:21,206 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:38:21,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:38:19" (1/3) ... [2023-11-06 22:38:21,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@712b4b06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:38:21, skipping insertion in model container [2023-11-06 22:38:21,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:20" (2/3) ... [2023-11-06 22:38:21,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@712b4b06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:38:21, skipping insertion in model container [2023-11-06 22:38:21,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:38:21" (3/3) ... [2023-11-06 22:38:21,216 INFO L112 eAbstractionObserver]: Analyzing ICFG mix047_power.oepc_pso.oepc_rmo.oepc.i [2023-11-06 22:38:21,233 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:38:21,233 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-06 22:38:21,234 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:38:21,308 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:38:21,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 151 transitions, 318 flow [2023-11-06 22:38:21,451 INFO L124 PetriNetUnfolderBase]: 3/147 cut-off events. [2023-11-06 22:38:21,452 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:38:21,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 3/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 123 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 107. Up to 2 conditions per place. [2023-11-06 22:38:21,458 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 151 transitions, 318 flow [2023-11-06 22:38:21,464 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 147 transitions, 306 flow [2023-11-06 22:38:21,468 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:38:21,479 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 147 transitions, 306 flow [2023-11-06 22:38:21,482 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 147 transitions, 306 flow [2023-11-06 22:38:21,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 147 transitions, 306 flow [2023-11-06 22:38:21,525 INFO L124 PetriNetUnfolderBase]: 3/147 cut-off events. [2023-11-06 22:38:21,526 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:38:21,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 3/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 123 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 107. Up to 2 conditions per place. [2023-11-06 22:38:21,531 INFO L119 LiptonReduction]: Number of co-enabled transitions 4194 [2023-11-06 22:38:27,563 INFO L134 LiptonReduction]: Checked pairs total: 10212 [2023-11-06 22:38:27,565 INFO L136 LiptonReduction]: Total number of compositions: 141 [2023-11-06 22:38:27,601 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:38:27,615 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;@6f6a36b6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:38:27,616 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-06 22:38:27,618 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:38:27,618 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-06 22:38:27,619 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:38:27,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:38:27,620 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:38:27,620 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:38:27,627 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:27,627 INFO L85 PathProgramCache]: Analyzing trace with hash 651, now seen corresponding path program 1 times [2023-11-06 22:38:27,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:38:27,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599420047] [2023-11-06 22:38:27,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:27,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:38:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:27,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:38:27,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:38:27,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599420047] [2023-11-06 22:38:27,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599420047] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:38:27,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:38:27,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:38:27,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60958483] [2023-11-06 22:38:27,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:38:27,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:38:27,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:38:27,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:38:27,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:38:27,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 292 [2023-11-06 22:38:27,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 135.5) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:38:27,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:38:27,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 292 [2023-11-06 22:38:27,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:38:30,093 INFO L124 PetriNetUnfolderBase]: 8719/11886 cut-off events. [2023-11-06 22:38:30,093 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-11-06 22:38:30,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23834 conditions, 11886 events. 8719/11886 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 62315 event pairs, 8719 based on Foata normal form. 0/10394 useless extension candidates. Maximal degree in co-relation 23822. Up to 11731 conditions per place. [2023-11-06 22:38:30,211 INFO L140 encePairwiseOnDemand]: 283/292 looper letters, 28 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2023-11-06 22:38:30,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 132 flow [2023-11-06 22:38:30,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:38:30,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:38:30,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 307 transitions. [2023-11-06 22:38:30,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5256849315068494 [2023-11-06 22:38:30,228 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 307 transitions. [2023-11-06 22:38:30,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 307 transitions. [2023-11-06 22:38:30,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:38:30,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 307 transitions. [2023-11-06 22:38:30,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 153.5) internal successors, (307), 2 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:38:30,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 292.0) internal successors, (876), 3 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:38:30,243 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 292.0) internal successors, (876), 3 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:38:30,245 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 2 states and 307 transitions. [2023-11-06 22:38:30,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 132 flow [2023-11-06 22:38:30,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:38:30,254 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2023-11-06 22:38:30,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-11-06 22:38:30,260 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2023-11-06 22:38:30,260 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2023-11-06 22:38:30,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 135.5) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:38:30,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:38:30,261 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 22:38:30,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:38:30,262 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:38:30,262 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:30,263 INFO L85 PathProgramCache]: Analyzing trace with hash 642018, now seen corresponding path program 1 times [2023-11-06 22:38:30,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:38:30,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320405434] [2023-11-06 22:38:30,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:30,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:38:30,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:30,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:38:30,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:38:30,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320405434] [2023-11-06 22:38:30,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320405434] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:38:30,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:38:30,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:38:30,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390222942] [2023-11-06 22:38:30,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:38:30,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:38:30,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:38:30,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:38:30,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:38:30,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 292 [2023-11-06 22:38:30,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:38:30,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:38:30,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 292 [2023-11-06 22:38:30,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:38:32,438 INFO L124 PetriNetUnfolderBase]: 6855/9897 cut-off events. [2023-11-06 22:38:32,438 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:38:32,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19334 conditions, 9897 events. 6855/9897 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 59903 event pairs, 1263 based on Foata normal form. 0/9239 useless extension candidates. Maximal degree in co-relation 19331. Up to 7399 conditions per place. [2023-11-06 22:38:32,525 INFO L140 encePairwiseOnDemand]: 289/292 looper letters, 45 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2023-11-06 22:38:32,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 218 flow [2023-11-06 22:38:32,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:38:32,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:38:32,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2023-11-06 22:38:32,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5159817351598174 [2023-11-06 22:38:32,535 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 452 transitions. [2023-11-06 22:38:32,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions. [2023-11-06 22:38:32,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:38:32,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions. [2023-11-06 22:38:32,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:38:32,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 292.0) internal successors, (1168), 4 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:38:32,547 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 292.0) internal successors, (1168), 4 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:38:32,547 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 452 transitions. [2023-11-06 22:38:32,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 218 flow [2023-11-06 22:38:32,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 218 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:38:32,550 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2023-11-06 22:38:32,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-11-06 22:38:32,551 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2023-11-06 22:38:32,551 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2023-11-06 22:38:32,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:38:32,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:38:32,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:38:32,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:38:32,553 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:38:32,553 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:32,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1885536303, now seen corresponding path program 1 times [2023-11-06 22:38:32,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:38:32,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607305380] [2023-11-06 22:38:32,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:32,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:38:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:33,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:38:33,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:38:33,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607305380] [2023-11-06 22:38:33,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607305380] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:38:33,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:38:33,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:38:33,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573927596] [2023-11-06 22:38:33,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:38:33,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:38:33,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:38:33,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:38:33,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:38:34,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 292 [2023-11-06 22:38:34,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 7 states, 7 states have (on average 117.71428571428571) internal successors, (824), 7 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:38:34,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:38:34,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 292 [2023-11-06 22:38:34,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:38:35,662 INFO L124 PetriNetUnfolderBase]: 5879/7985 cut-off events. [2023-11-06 22:38:35,662 INFO L125 PetriNetUnfolderBase]: For 521/521 co-relation queries the response was YES. [2023-11-06 22:38:35,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16650 conditions, 7985 events. 5879/7985 cut-off events. For 521/521 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 39791 event pairs, 288 based on Foata normal form. 0/7985 useless extension candidates. Maximal degree in co-relation 16646. Up to 5184 conditions per place. [2023-11-06 22:38:35,729 INFO L140 encePairwiseOnDemand]: 286/292 looper letters, 52 selfloop transitions, 5 changer transitions 0/60 dead transitions. [2023-11-06 22:38:35,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 60 transitions, 254 flow [2023-11-06 22:38:35,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:38:35,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:38:35,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 871 transitions. [2023-11-06 22:38:35,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4261252446183953 [2023-11-06 22:38:35,734 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 871 transitions. [2023-11-06 22:38:35,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 871 transitions. [2023-11-06 22:38:35,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:38:35,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 871 transitions. [2023-11-06 22:38:35,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.42857142857143) internal successors, (871), 7 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:38:35,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 292.0) internal successors, (2336), 8 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:38:35,747 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 292.0) internal successors, (2336), 8 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:38:35,747 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 7 states and 871 transitions. [2023-11-06 22:38:35,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 60 transitions, 254 flow [2023-11-06 22:38:35,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 60 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:38:35,750 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 76 flow [2023-11-06 22:38:35,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=76, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2023-11-06 22:38:35,752 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -8 predicate places. [2023-11-06 22:38:35,752 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 76 flow [2023-11-06 22:38:35,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.71428571428571) internal successors, (824), 7 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:38:35,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:38:35,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:38:35,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:38:35,754 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:38:35,755 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:35,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1885536335, now seen corresponding path program 1 times [2023-11-06 22:38:35,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:38:35,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593193369] [2023-11-06 22:38:35,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:35,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:38:35,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:35,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:38:35,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:38:35,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593193369] [2023-11-06 22:38:35,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593193369] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:38:35,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:38:35,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:38:35,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862704059] [2023-11-06 22:38:35,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:38:35,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:38:35,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:38:35,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:38:35,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:38:35,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 292 [2023-11-06 22:38:35,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:38:35,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:38:35,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 292 [2023-11-06 22:38:35,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:38:39,795 INFO L124 PetriNetUnfolderBase]: 24574/33203 cut-off events. [2023-11-06 22:38:39,795 INFO L125 PetriNetUnfolderBase]: For 1151/1151 co-relation queries the response was YES. [2023-11-06 22:38:39,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68456 conditions, 33203 events. 24574/33203 cut-off events. For 1151/1151 co-relation queries the response was YES. Maximal size of possible extension queue 1065. Compared 181066 event pairs, 8116 based on Foata normal form. 1374/34577 useless extension candidates. Maximal degree in co-relation 68452. Up to 14653 conditions per place. [2023-11-06 22:38:39,983 INFO L140 encePairwiseOnDemand]: 281/292 looper letters, 44 selfloop transitions, 9 changer transitions 35/88 dead transitions. [2023-11-06 22:38:39,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 88 transitions, 384 flow [2023-11-06 22:38:39,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:38:39,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:38:39,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 685 transitions. [2023-11-06 22:38:39,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4691780821917808 [2023-11-06 22:38:39,988 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 685 transitions. [2023-11-06 22:38:39,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 685 transitions. [2023-11-06 22:38:39,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:38:39,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 685 transitions. [2023-11-06 22:38:39,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.0) internal successors, (685), 5 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:38:39,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 292.0) internal successors, (1752), 6 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:38:39,997 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 292.0) internal successors, (1752), 6 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:38:39,997 INFO L175 Difference]: Start difference. First operand has 45 places, 29 transitions, 76 flow. Second operand 5 states and 685 transitions. [2023-11-06 22:38:39,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 88 transitions, 384 flow [2023-11-06 22:38:40,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 88 transitions, 368 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-06 22:38:40,020 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 158 flow [2023-11-06 22:38:40,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2023-11-06 22:38:40,022 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2023-11-06 22:38:40,023 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 158 flow [2023-11-06 22:38:40,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:38:40,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:38:40,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:38:40,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:38:40,024 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:38:40,025 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:40,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1677839962, now seen corresponding path program 1 times [2023-11-06 22:38:40,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:38:40,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880998357] [2023-11-06 22:38:40,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:40,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:38:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:40,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:38:40,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:38:40,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880998357] [2023-11-06 22:38:40,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880998357] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:38:40,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:38:40,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:38:40,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179459836] [2023-11-06 22:38:40,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:38:40,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:38:40,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:38:40,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:38:40,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:38:40,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 292 [2023-11-06 22:38:40,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 158 flow. Second operand has 5 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:38:40,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:38:40,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 292 [2023-11-06 22:38:40,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:38:44,234 INFO L124 PetriNetUnfolderBase]: 22916/31221 cut-off events. [2023-11-06 22:38:44,234 INFO L125 PetriNetUnfolderBase]: For 25641/25641 co-relation queries the response was YES. [2023-11-06 22:38:44,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90286 conditions, 31221 events. 22916/31221 cut-off events. For 25641/25641 co-relation queries the response was YES. Maximal size of possible extension queue 1018. Compared 173678 event pairs, 2477 based on Foata normal form. 1316/32537 useless extension candidates. Maximal degree in co-relation 90279. Up to 13366 conditions per place. [2023-11-06 22:38:44,433 INFO L140 encePairwiseOnDemand]: 281/292 looper letters, 63 selfloop transitions, 13 changer transitions 53/129 dead transitions. [2023-11-06 22:38:44,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 129 transitions, 790 flow [2023-11-06 22:38:44,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:38:44,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:38:44,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 952 transitions. [2023-11-06 22:38:44,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4657534246575342 [2023-11-06 22:38:44,438 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 952 transitions. [2023-11-06 22:38:44,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 952 transitions. [2023-11-06 22:38:44,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:38:44,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 952 transitions. [2023-11-06 22:38:44,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:38:44,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 292.0) internal successors, (2336), 8 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:38:44,449 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 292.0) internal successors, (2336), 8 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:38:44,449 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 158 flow. Second operand 7 states and 952 transitions. [2023-11-06 22:38:44,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 129 transitions, 790 flow [2023-11-06 22:38:44,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 129 transitions, 728 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:38:44,499 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 269 flow [2023-11-06 22:38:44,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=269, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2023-11-06 22:38:44,502 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2023-11-06 22:38:44,503 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 269 flow [2023-11-06 22:38:44,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:38:44,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:38:44,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:38:44,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:38:44,504 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:38:44,504 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:44,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1677863987, now seen corresponding path program 1 times [2023-11-06 22:38:44,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:38:44,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857866550] [2023-11-06 22:38:44,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:44,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:38:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:44,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:38:44,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:38:44,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857866550] [2023-11-06 22:38:44,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857866550] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:38:44,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:38:44,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:38:44,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917493125] [2023-11-06 22:38:44,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:38:44,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:38:44,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:38:44,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:38:44,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:38:44,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 292 [2023-11-06 22:38:44,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 269 flow. Second operand has 5 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:38:44,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:38:44,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 292 [2023-11-06 22:38:44,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:38:48,865 INFO L124 PetriNetUnfolderBase]: 21764/29659 cut-off events. [2023-11-06 22:38:48,866 INFO L125 PetriNetUnfolderBase]: For 68821/68821 co-relation queries the response was YES. [2023-11-06 22:38:48,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97405 conditions, 29659 events. 21764/29659 cut-off events. For 68821/68821 co-relation queries the response was YES. Maximal size of possible extension queue 935. Compared 163479 event pairs, 4065 based on Foata normal form. 1098/30757 useless extension candidates. Maximal degree in co-relation 97393. Up to 13003 conditions per place. [2023-11-06 22:38:49,089 INFO L140 encePairwiseOnDemand]: 281/292 looper letters, 69 selfloop transitions, 22 changer transitions 49/140 dead transitions. [2023-11-06 22:38:49,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 140 transitions, 985 flow [2023-11-06 22:38:49,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:38:49,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:38:49,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 953 transitions. [2023-11-06 22:38:49,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4662426614481409 [2023-11-06 22:38:49,096 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 953 transitions. [2023-11-06 22:38:49,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 953 transitions. [2023-11-06 22:38:49,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:38:49,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 953 transitions. [2023-11-06 22:38:49,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.14285714285714) internal successors, (953), 7 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:38:49,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 292.0) internal successors, (2336), 8 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:38:49,106 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 292.0) internal successors, (2336), 8 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:38:49,106 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 269 flow. Second operand 7 states and 953 transitions. [2023-11-06 22:38:49,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 140 transitions, 985 flow [2023-11-06 22:38:49,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 140 transitions, 977 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-11-06 22:38:49,322 INFO L231 Difference]: Finished difference. Result has 65 places, 58 transitions, 482 flow [2023-11-06 22:38:49,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=482, PETRI_PLACES=65, PETRI_TRANSITIONS=58} [2023-11-06 22:38:49,323 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 12 predicate places. [2023-11-06 22:38:49,323 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 58 transitions, 482 flow [2023-11-06 22:38:49,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:38:49,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:38:49,324 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:38:49,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:38:49,324 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:38:49,325 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:49,325 INFO L85 PathProgramCache]: Analyzing trace with hash 473379498, now seen corresponding path program 1 times [2023-11-06 22:38:49,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:38:49,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099741015] [2023-11-06 22:38:49,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:49,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:38:49,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:49,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:38:49,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:38:49,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099741015] [2023-11-06 22:38:49,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099741015] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:38:49,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:38:49,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:38:49,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944821765] [2023-11-06 22:38:49,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:38:49,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:38:49,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:38:49,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:38:49,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:38:49,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 292 [2023-11-06 22:38:49,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 58 transitions, 482 flow. Second operand has 5 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:38:49,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:38:49,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 292 [2023-11-06 22:38:49,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:38:53,418 INFO L124 PetriNetUnfolderBase]: 19932/27213 cut-off events. [2023-11-06 22:38:53,418 INFO L125 PetriNetUnfolderBase]: For 114088/114088 co-relation queries the response was YES. [2023-11-06 22:38:53,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100958 conditions, 27213 events. 19932/27213 cut-off events. For 114088/114088 co-relation queries the response was YES. Maximal size of possible extension queue 847. Compared 145408 event pairs, 3428 based on Foata normal form. 1140/28353 useless extension candidates. Maximal degree in co-relation 100940. Up to 9745 conditions per place. [2023-11-06 22:38:53,643 INFO L140 encePairwiseOnDemand]: 282/292 looper letters, 80 selfloop transitions, 21 changer transitions 52/153 dead transitions. [2023-11-06 22:38:53,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 153 transitions, 1410 flow [2023-11-06 22:38:53,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:38:53,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:38:53,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 942 transitions. [2023-11-06 22:38:53,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4608610567514677 [2023-11-06 22:38:53,649 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 942 transitions. [2023-11-06 22:38:53,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 942 transitions. [2023-11-06 22:38:53,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:38:53,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 942 transitions. [2023-11-06 22:38:53,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.57142857142858) internal successors, (942), 7 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:38:53,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 292.0) internal successors, (2336), 8 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:38:53,661 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 292.0) internal successors, (2336), 8 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:38:53,662 INFO L175 Difference]: Start difference. First operand has 65 places, 58 transitions, 482 flow. Second operand 7 states and 942 transitions. [2023-11-06 22:38:53,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 153 transitions, 1410 flow [2023-11-06 22:38:54,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 153 transitions, 1372 flow, removed 19 selfloop flow, removed 2 redundant places. [2023-11-06 22:38:54,150 INFO L231 Difference]: Finished difference. Result has 72 places, 71 transitions, 734 flow [2023-11-06 22:38:54,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=734, PETRI_PLACES=72, PETRI_TRANSITIONS=71} [2023-11-06 22:38:54,152 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 19 predicate places. [2023-11-06 22:38:54,152 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 71 transitions, 734 flow [2023-11-06 22:38:54,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:38:54,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:38:54,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:38:54,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:38:54,153 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:38:54,154 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:54,154 INFO L85 PathProgramCache]: Analyzing trace with hash -22151709, now seen corresponding path program 1 times [2023-11-06 22:38:54,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:38:54,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647648402] [2023-11-06 22:38:54,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:54,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:38:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:54,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:38:54,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:38:54,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647648402] [2023-11-06 22:38:54,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647648402] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:38:54,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:38:54,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:38:54,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788626492] [2023-11-06 22:38:54,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:38:54,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:38:54,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:38:54,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:38:54,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:38:54,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 292 [2023-11-06 22:38:54,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 71 transitions, 734 flow. Second operand has 5 states, 5 states have (on average 122.2) internal successors, (611), 5 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:38:54,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:38:54,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 292 [2023-11-06 22:38:54,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:38:59,719 INFO L124 PetriNetUnfolderBase]: 26100/35784 cut-off events. [2023-11-06 22:38:59,719 INFO L125 PetriNetUnfolderBase]: For 186430/186430 co-relation queries the response was YES. [2023-11-06 22:38:59,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136847 conditions, 35784 events. 26100/35784 cut-off events. For 186430/186430 co-relation queries the response was YES. Maximal size of possible extension queue 1092. Compared 204768 event pairs, 4304 based on Foata normal form. 963/36747 useless extension candidates. Maximal degree in co-relation 136825. Up to 13446 conditions per place. [2023-11-06 22:38:59,959 INFO L140 encePairwiseOnDemand]: 281/292 looper letters, 71 selfloop transitions, 41 changer transitions 44/156 dead transitions. [2023-11-06 22:38:59,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 156 transitions, 1518 flow [2023-11-06 22:38:59,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:38:59,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:38:59,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 949 transitions. [2023-11-06 22:38:59,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2023-11-06 22:38:59,964 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 949 transitions. [2023-11-06 22:38:59,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 949 transitions. [2023-11-06 22:38:59,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:38:59,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 949 transitions. [2023-11-06 22:38:59,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.57142857142858) internal successors, (949), 7 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:38:59,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 292.0) internal successors, (2336), 8 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:38:59,973 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 292.0) internal successors, (2336), 8 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:38:59,974 INFO L175 Difference]: Start difference. First operand has 72 places, 71 transitions, 734 flow. Second operand 7 states and 949 transitions. [2023-11-06 22:38:59,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 156 transitions, 1518 flow [2023-11-06 22:39:00,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 156 transitions, 1479 flow, removed 16 selfloop flow, removed 4 redundant places. [2023-11-06 22:39:00,926 INFO L231 Difference]: Finished difference. Result has 77 places, 76 transitions, 977 flow [2023-11-06 22:39:00,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=977, PETRI_PLACES=77, PETRI_TRANSITIONS=76} [2023-11-06 22:39:00,927 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 24 predicate places. [2023-11-06 22:39:00,927 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 76 transitions, 977 flow [2023-11-06 22:39:00,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.2) internal successors, (611), 5 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:39:00,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:39:00,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:00,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:39:00,928 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:39:00,928 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:00,928 INFO L85 PathProgramCache]: Analyzing trace with hash -349825568, now seen corresponding path program 1 times [2023-11-06 22:39:00,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:00,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866419709] [2023-11-06 22:39:00,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:00,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:00,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:01,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:39:01,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:01,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866419709] [2023-11-06 22:39:01,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866419709] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:01,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:01,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:39:01,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727270576] [2023-11-06 22:39:01,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:01,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:39:01,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:01,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:39:01,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:39:01,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 292 [2023-11-06 22:39:01,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 76 transitions, 977 flow. Second operand has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:39:01,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:39:01,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 292 [2023-11-06 22:39:01,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:39:03,286 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([469] L827-->L843: Formula: (let ((.cse3 (= (mod v_~b$r_buff1_thd4~0_62 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse7)) (.cse12 (= (mod v_~b$w_buff0_used~0_154 256) 0)) (.cse5 (and .cse3 .cse7)) (.cse6 (and .cse7 (= (mod v_~b$w_buff1_used~0_141 256) 0)))) (let ((.cse9 (or .cse12 .cse5 .cse6)) (.cse10 (and .cse8 (not .cse12)))) (let ((.cse1 (= (mod v_~b$w_buff1_used~0_140 256) 0)) (.cse4 (= (mod v_~b$w_buff0_used~0_153 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse11 (ite .cse9 v_~b~0_78 (ite .cse10 v_~b$w_buff0~0_51 v_~b$w_buff1~0_46)))) (and (= v_~b$mem_tmp~0_18 v_~b~0_78) (= v_~b$flush_delayed~0_25 0) (= v_~b$r_buff1_thd4~0_61 (ite .cse0 v_~b$r_buff1_thd4~0_62 (ite (let ((.cse2 (= (mod v_~b$r_buff0_thd4~0_61 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse2) .cse4)) v_~b$r_buff1_thd4~0_62 0))) (= v_~b$w_buff0~0_51 v_~b$w_buff0~0_50) (= (ite .cse0 v_~b$w_buff1_used~0_141 (ite (or .cse4 .cse5 .cse6) v_~b$w_buff1_used~0_141 0)) v_~b$w_buff1_used~0_140) (= (ite .cse0 v_~b$r_buff0_thd4~0_62 (ite (or .cse4 .cse5 (and .cse1 .cse7)) v_~b$r_buff0_thd4~0_62 (ite (and .cse8 (not .cse4)) 0 v_~b$r_buff0_thd4~0_62))) v_~b$r_buff0_thd4~0_61) (= v_~b$w_buff1~0_45 v_~b$w_buff1~0_46) (= v_~b$w_buff0_used~0_153 (ite .cse0 v_~b$w_buff0_used~0_154 (ite .cse9 v_~b$w_buff0_used~0_154 (ite .cse10 0 v_~b$w_buff0_used~0_154)))) (= .cse11 v_~__unbuffered_p3_EBX~0_16) (= v_~b~0_76 (ite .cse0 v_~b$mem_tmp~0_18 .cse11))))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_154, ~b~0=v_~b~0_78, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_141, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_62, ~b$w_buff1~0=v_~b$w_buff1~0_46, ~b$w_buff0~0=v_~b$w_buff0~0_51, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_62} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_153, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~b~0=v_~b~0_76, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_140, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_61, ~b$w_buff1~0=v_~b$w_buff1~0_45, ~b$w_buff0~0=v_~b$w_buff0~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3][160], [113#L764true, 240#(= ~y~0 1), 164#true, 190#true, Black: 193#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 192#(= ~y~0 0), Black: 196#(and (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), 177#(and (not (= |ULTIMATE.start_main_~#t1251~0#1.base| |ULTIMATE.start_main_~#t1250~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1249~0#1.base| 0) |ULTIMATE.start_main_~#t1250~0#1.base| 0) |ULTIMATE.start_main_~#t1252~0#1.base| 0) |ULTIMATE.start_main_~#t1251~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1252~0#1.base| |ULTIMATE.start_main_~#t1249~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1252~0#1.base| |ULTIMATE.start_main_~#t1251~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1252~0#1.base| |ULTIMATE.start_main_~#t1250~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1250~0#1.base| |ULTIMATE.start_main_~#t1249~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1251~0#1.base| |ULTIMATE.start_main_~#t1249~0#1.base|))), 49#L843true, 138#L784true, Black: 208#(<= ~x~0 0), 58#L878true, P0Thread1of1ForFork3InUse, Black: 209#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 222#true, Black: 212#(and (<= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), P2Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, Black: 225#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 224#(= ~__unbuffered_p3_EAX~0 0), Black: 230#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), 254#true, Black: 226#(<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|), 74#P2EXITtrue, Black: 241#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 242#(<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|), Black: 182#(<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|), 206#true, Black: 244#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (= ~y~0 1)), Black: 238#true, Black: 181#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 246#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), Black: 184#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|))]) [2023-11-06 22:39:03,286 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-06 22:39:03,286 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 22:39:03,286 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 22:39:03,287 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 22:39:03,564 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([454] L784-->L791: Formula: (let ((.cse3 (not (= (mod v_~b$r_buff1_thd2~0_18 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd2~0_20 256) 0))) (.cse2 (not (= (mod v_~b$w_buff0_used~0_103 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse0 (and .cse5 (not (= (mod v_~b$w_buff0_used~0_104 256) 0)))) (.cse4 (and .cse3 (not (= (mod v_~b$w_buff1_used~0_97 256) 0))))) (and (= v_~b$w_buff0_used~0_103 (ite .cse0 0 v_~b$w_buff0_used~0_104)) (= (ite .cse1 0 v_~b$r_buff0_thd2~0_20) v_~b$r_buff0_thd2~0_19) (= v_~b$r_buff1_thd2~0_17 (ite (or (and .cse2 (not (= (mod v_~b$r_buff0_thd2~0_19 256) 0))) (and (not (= (mod v_~b$w_buff1_used~0_96 256) 0)) .cse3)) 0 v_~b$r_buff1_thd2~0_18)) (= (ite (or .cse1 .cse4) 0 v_~b$w_buff1_used~0_97) v_~b$w_buff1_used~0_96) (= v_~b~0_44 (ite .cse0 v_~b$w_buff0~0_24 (ite .cse4 v_~b$w_buff1~0_23 v_~b~0_45)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_104, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_20, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_97, ~b~0=v_~b~0_45, ~b$w_buff1~0=v_~b$w_buff1~0_23, ~b$w_buff0~0=v_~b$w_buff0~0_24, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_18} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_103, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_19, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_96, ~b~0=v_~b~0_44, ~b$w_buff1~0=v_~b$w_buff1~0_23, ~b$w_buff0~0=v_~b$w_buff0~0_24, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_17} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd2~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd2~0][39], [240#(= ~y~0 1), 164#true, 145#L791true, Black: 190#true, Black: 192#(= ~y~0 0), Black: 196#(and (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), 209#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 177#(and (not (= |ULTIMATE.start_main_~#t1251~0#1.base| |ULTIMATE.start_main_~#t1250~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1249~0#1.base| 0) |ULTIMATE.start_main_~#t1250~0#1.base| 0) |ULTIMATE.start_main_~#t1252~0#1.base| 0) |ULTIMATE.start_main_~#t1251~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1252~0#1.base| |ULTIMATE.start_main_~#t1249~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1252~0#1.base| |ULTIMATE.start_main_~#t1251~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1252~0#1.base| |ULTIMATE.start_main_~#t1250~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1250~0#1.base| |ULTIMATE.start_main_~#t1249~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1251~0#1.base| |ULTIMATE.start_main_~#t1249~0#1.base|))), 225#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 61#L771true, Black: 208#(<= ~x~0 0), 98#L827true, 58#L878true, Black: 206#true, P0Thread1of1ForFork3InUse, Black: 212#(and (<= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), P2Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 193#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 224#(= ~__unbuffered_p3_EAX~0 0), Black: 230#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), Black: 226#(<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|), 254#true, Black: 222#true, 74#P2EXITtrue, Black: 241#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 242#(<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|), Black: 182#(<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|), Black: 244#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (= ~y~0 1)), Black: 179#true, Black: 238#true, Black: 246#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), Black: 184#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|))]) [2023-11-06 22:39:03,564 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-06 22:39:03,564 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:39:03,564 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:39:03,564 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:39:03,565 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([469] L827-->L843: Formula: (let ((.cse3 (= (mod v_~b$r_buff1_thd4~0_62 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse7)) (.cse12 (= (mod v_~b$w_buff0_used~0_154 256) 0)) (.cse5 (and .cse3 .cse7)) (.cse6 (and .cse7 (= (mod v_~b$w_buff1_used~0_141 256) 0)))) (let ((.cse9 (or .cse12 .cse5 .cse6)) (.cse10 (and .cse8 (not .cse12)))) (let ((.cse1 (= (mod v_~b$w_buff1_used~0_140 256) 0)) (.cse4 (= (mod v_~b$w_buff0_used~0_153 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse11 (ite .cse9 v_~b~0_78 (ite .cse10 v_~b$w_buff0~0_51 v_~b$w_buff1~0_46)))) (and (= v_~b$mem_tmp~0_18 v_~b~0_78) (= v_~b$flush_delayed~0_25 0) (= v_~b$r_buff1_thd4~0_61 (ite .cse0 v_~b$r_buff1_thd4~0_62 (ite (let ((.cse2 (= (mod v_~b$r_buff0_thd4~0_61 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse2) .cse4)) v_~b$r_buff1_thd4~0_62 0))) (= v_~b$w_buff0~0_51 v_~b$w_buff0~0_50) (= (ite .cse0 v_~b$w_buff1_used~0_141 (ite (or .cse4 .cse5 .cse6) v_~b$w_buff1_used~0_141 0)) v_~b$w_buff1_used~0_140) (= (ite .cse0 v_~b$r_buff0_thd4~0_62 (ite (or .cse4 .cse5 (and .cse1 .cse7)) v_~b$r_buff0_thd4~0_62 (ite (and .cse8 (not .cse4)) 0 v_~b$r_buff0_thd4~0_62))) v_~b$r_buff0_thd4~0_61) (= v_~b$w_buff1~0_45 v_~b$w_buff1~0_46) (= v_~b$w_buff0_used~0_153 (ite .cse0 v_~b$w_buff0_used~0_154 (ite .cse9 v_~b$w_buff0_used~0_154 (ite .cse10 0 v_~b$w_buff0_used~0_154)))) (= .cse11 v_~__unbuffered_p3_EBX~0_16) (= v_~b~0_76 (ite .cse0 v_~b$mem_tmp~0_18 .cse11))))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_154, ~b~0=v_~b~0_78, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_141, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_62, ~b$w_buff1~0=v_~b$w_buff1~0_46, ~b$w_buff0~0=v_~b$w_buff0~0_51, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_62} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_153, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~b~0=v_~b~0_76, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_140, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_61, ~b$w_buff1~0=v_~b$w_buff1~0_45, ~b$w_buff0~0=v_~b$w_buff0~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3][160], [240#(= ~y~0 1), 164#true, 190#true, Black: 193#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 192#(= ~y~0 0), Black: 196#(and (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), 177#(and (not (= |ULTIMATE.start_main_~#t1251~0#1.base| |ULTIMATE.start_main_~#t1250~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1249~0#1.base| 0) |ULTIMATE.start_main_~#t1250~0#1.base| 0) |ULTIMATE.start_main_~#t1252~0#1.base| 0) |ULTIMATE.start_main_~#t1251~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1252~0#1.base| |ULTIMATE.start_main_~#t1249~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1252~0#1.base| |ULTIMATE.start_main_~#t1251~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1252~0#1.base| |ULTIMATE.start_main_~#t1250~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1250~0#1.base| |ULTIMATE.start_main_~#t1249~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1251~0#1.base| |ULTIMATE.start_main_~#t1249~0#1.base|))), 61#L771true, 49#L843true, 138#L784true, Black: 208#(<= ~x~0 0), 58#L878true, Black: 209#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork3InUse, 222#true, Black: 212#(and (<= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), P2Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, Black: 225#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 224#(= ~__unbuffered_p3_EAX~0 0), Black: 230#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), Black: 226#(<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|), 254#true, 74#P2EXITtrue, Black: 241#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 242#(<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|), 206#true, Black: 182#(<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|), Black: 244#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (= ~y~0 1)), Black: 238#true, Black: 181#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 246#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), Black: 184#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|))]) [2023-11-06 22:39:03,565 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-06 22:39:03,565 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:39:03,565 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:39:03,565 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:39:03,566 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([469] L827-->L843: Formula: (let ((.cse3 (= (mod v_~b$r_buff1_thd4~0_62 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse7)) (.cse12 (= (mod v_~b$w_buff0_used~0_154 256) 0)) (.cse5 (and .cse3 .cse7)) (.cse6 (and .cse7 (= (mod v_~b$w_buff1_used~0_141 256) 0)))) (let ((.cse9 (or .cse12 .cse5 .cse6)) (.cse10 (and .cse8 (not .cse12)))) (let ((.cse1 (= (mod v_~b$w_buff1_used~0_140 256) 0)) (.cse4 (= (mod v_~b$w_buff0_used~0_153 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse11 (ite .cse9 v_~b~0_78 (ite .cse10 v_~b$w_buff0~0_51 v_~b$w_buff1~0_46)))) (and (= v_~b$mem_tmp~0_18 v_~b~0_78) (= v_~b$flush_delayed~0_25 0) (= v_~b$r_buff1_thd4~0_61 (ite .cse0 v_~b$r_buff1_thd4~0_62 (ite (let ((.cse2 (= (mod v_~b$r_buff0_thd4~0_61 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse2) .cse4)) v_~b$r_buff1_thd4~0_62 0))) (= v_~b$w_buff0~0_51 v_~b$w_buff0~0_50) (= (ite .cse0 v_~b$w_buff1_used~0_141 (ite (or .cse4 .cse5 .cse6) v_~b$w_buff1_used~0_141 0)) v_~b$w_buff1_used~0_140) (= (ite .cse0 v_~b$r_buff0_thd4~0_62 (ite (or .cse4 .cse5 (and .cse1 .cse7)) v_~b$r_buff0_thd4~0_62 (ite (and .cse8 (not .cse4)) 0 v_~b$r_buff0_thd4~0_62))) v_~b$r_buff0_thd4~0_61) (= v_~b$w_buff1~0_45 v_~b$w_buff1~0_46) (= v_~b$w_buff0_used~0_153 (ite .cse0 v_~b$w_buff0_used~0_154 (ite .cse9 v_~b$w_buff0_used~0_154 (ite .cse10 0 v_~b$w_buff0_used~0_154)))) (= .cse11 v_~__unbuffered_p3_EBX~0_16) (= v_~b~0_76 (ite .cse0 v_~b$mem_tmp~0_18 .cse11))))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_154, ~b~0=v_~b~0_78, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_141, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_62, ~b$w_buff1~0=v_~b$w_buff1~0_46, ~b$w_buff0~0=v_~b$w_buff0~0_51, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_62} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_153, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~b~0=v_~b~0_76, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_140, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_61, ~b$w_buff1~0=v_~b$w_buff1~0_45, ~b$w_buff0~0=v_~b$w_buff0~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3][160], [113#L764true, 240#(= ~y~0 1), 164#true, 190#true, Black: 193#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 192#(= ~y~0 0), Black: 196#(and (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), 65#L885true, 177#(and (not (= |ULTIMATE.start_main_~#t1251~0#1.base| |ULTIMATE.start_main_~#t1250~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1249~0#1.base| 0) |ULTIMATE.start_main_~#t1250~0#1.base| 0) |ULTIMATE.start_main_~#t1252~0#1.base| 0) |ULTIMATE.start_main_~#t1251~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1252~0#1.base| |ULTIMATE.start_main_~#t1249~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1252~0#1.base| |ULTIMATE.start_main_~#t1251~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1252~0#1.base| |ULTIMATE.start_main_~#t1250~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1250~0#1.base| |ULTIMATE.start_main_~#t1249~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1251~0#1.base| |ULTIMATE.start_main_~#t1249~0#1.base|))), 49#L843true, 138#L784true, Black: 208#(<= ~x~0 0), P0Thread1of1ForFork3InUse, Black: 209#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 222#true, Black: 212#(and (<= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), P2Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, Black: 225#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 224#(= ~__unbuffered_p3_EAX~0 0), Black: 230#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), Black: 226#(<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|), 254#true, 74#P2EXITtrue, Black: 241#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 242#(<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|), 206#true, Black: 182#(<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|), Black: 244#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (= ~y~0 1)), Black: 181#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 238#true, Black: 184#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), Black: 246#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|))]) [2023-11-06 22:39:03,566 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-06 22:39:03,567 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:39:03,567 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:39:03,567 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:39:03,865 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([454] L784-->L791: Formula: (let ((.cse3 (not (= (mod v_~b$r_buff1_thd2~0_18 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd2~0_20 256) 0))) (.cse2 (not (= (mod v_~b$w_buff0_used~0_103 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse0 (and .cse5 (not (= (mod v_~b$w_buff0_used~0_104 256) 0)))) (.cse4 (and .cse3 (not (= (mod v_~b$w_buff1_used~0_97 256) 0))))) (and (= v_~b$w_buff0_used~0_103 (ite .cse0 0 v_~b$w_buff0_used~0_104)) (= (ite .cse1 0 v_~b$r_buff0_thd2~0_20) v_~b$r_buff0_thd2~0_19) (= v_~b$r_buff1_thd2~0_17 (ite (or (and .cse2 (not (= (mod v_~b$r_buff0_thd2~0_19 256) 0))) (and (not (= (mod v_~b$w_buff1_used~0_96 256) 0)) .cse3)) 0 v_~b$r_buff1_thd2~0_18)) (= (ite (or .cse1 .cse4) 0 v_~b$w_buff1_used~0_97) v_~b$w_buff1_used~0_96) (= v_~b~0_44 (ite .cse0 v_~b$w_buff0~0_24 (ite .cse4 v_~b$w_buff1~0_23 v_~b~0_45)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_104, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_20, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_97, ~b~0=v_~b~0_45, ~b$w_buff1~0=v_~b$w_buff1~0_23, ~b$w_buff0~0=v_~b$w_buff0~0_24, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_18} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_103, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_19, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_96, ~b~0=v_~b~0_44, ~b$w_buff1~0=v_~b$w_buff1~0_23, ~b$w_buff0~0=v_~b$w_buff0~0_24, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_17} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd2~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd2~0][39], [240#(= ~y~0 1), 164#true, 145#L791true, Black: 190#true, Black: 192#(= ~y~0 0), Black: 196#(and (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), 209#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 65#L885true, 225#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 177#(and (not (= |ULTIMATE.start_main_~#t1251~0#1.base| |ULTIMATE.start_main_~#t1250~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1249~0#1.base| 0) |ULTIMATE.start_main_~#t1250~0#1.base| 0) |ULTIMATE.start_main_~#t1252~0#1.base| 0) |ULTIMATE.start_main_~#t1251~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1252~0#1.base| |ULTIMATE.start_main_~#t1249~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1252~0#1.base| |ULTIMATE.start_main_~#t1251~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1252~0#1.base| |ULTIMATE.start_main_~#t1250~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1250~0#1.base| |ULTIMATE.start_main_~#t1249~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1251~0#1.base| |ULTIMATE.start_main_~#t1249~0#1.base|))), 61#L771true, Black: 208#(<= ~x~0 0), 98#L827true, Black: 206#true, P0Thread1of1ForFork3InUse, Black: 212#(and (<= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), P2Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 193#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 224#(= ~__unbuffered_p3_EAX~0 0), Black: 230#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), Black: 226#(<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|), 254#true, Black: 222#true, 74#P2EXITtrue, Black: 241#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 242#(<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|), Black: 182#(<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|), Black: 244#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (= ~y~0 1)), Black: 179#true, Black: 238#true, Black: 184#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), Black: 246#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|))]) [2023-11-06 22:39:03,865 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-06 22:39:03,865 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:39:03,865 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:39:03,865 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:39:03,866 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([469] L827-->L843: Formula: (let ((.cse3 (= (mod v_~b$r_buff1_thd4~0_62 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse7)) (.cse12 (= (mod v_~b$w_buff0_used~0_154 256) 0)) (.cse5 (and .cse3 .cse7)) (.cse6 (and .cse7 (= (mod v_~b$w_buff1_used~0_141 256) 0)))) (let ((.cse9 (or .cse12 .cse5 .cse6)) (.cse10 (and .cse8 (not .cse12)))) (let ((.cse1 (= (mod v_~b$w_buff1_used~0_140 256) 0)) (.cse4 (= (mod v_~b$w_buff0_used~0_153 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse11 (ite .cse9 v_~b~0_78 (ite .cse10 v_~b$w_buff0~0_51 v_~b$w_buff1~0_46)))) (and (= v_~b$mem_tmp~0_18 v_~b~0_78) (= v_~b$flush_delayed~0_25 0) (= v_~b$r_buff1_thd4~0_61 (ite .cse0 v_~b$r_buff1_thd4~0_62 (ite (let ((.cse2 (= (mod v_~b$r_buff0_thd4~0_61 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse2) .cse4)) v_~b$r_buff1_thd4~0_62 0))) (= v_~b$w_buff0~0_51 v_~b$w_buff0~0_50) (= (ite .cse0 v_~b$w_buff1_used~0_141 (ite (or .cse4 .cse5 .cse6) v_~b$w_buff1_used~0_141 0)) v_~b$w_buff1_used~0_140) (= (ite .cse0 v_~b$r_buff0_thd4~0_62 (ite (or .cse4 .cse5 (and .cse1 .cse7)) v_~b$r_buff0_thd4~0_62 (ite (and .cse8 (not .cse4)) 0 v_~b$r_buff0_thd4~0_62))) v_~b$r_buff0_thd4~0_61) (= v_~b$w_buff1~0_45 v_~b$w_buff1~0_46) (= v_~b$w_buff0_used~0_153 (ite .cse0 v_~b$w_buff0_used~0_154 (ite .cse9 v_~b$w_buff0_used~0_154 (ite .cse10 0 v_~b$w_buff0_used~0_154)))) (= .cse11 v_~__unbuffered_p3_EBX~0_16) (= v_~b~0_76 (ite .cse0 v_~b$mem_tmp~0_18 .cse11))))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_154, ~b~0=v_~b~0_78, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_141, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_62, ~b$w_buff1~0=v_~b$w_buff1~0_46, ~b$w_buff0~0=v_~b$w_buff0~0_51, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_62} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_153, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~b~0=v_~b~0_76, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_140, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_61, ~b$w_buff1~0=v_~b$w_buff1~0_45, ~b$w_buff0~0=v_~b$w_buff0~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3][160], [240#(= ~y~0 1), 164#true, 190#true, Black: 193#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 192#(= ~y~0 0), Black: 196#(and (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), 65#L885true, 177#(and (not (= |ULTIMATE.start_main_~#t1251~0#1.base| |ULTIMATE.start_main_~#t1250~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1249~0#1.base| 0) |ULTIMATE.start_main_~#t1250~0#1.base| 0) |ULTIMATE.start_main_~#t1252~0#1.base| 0) |ULTIMATE.start_main_~#t1251~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1252~0#1.base| |ULTIMATE.start_main_~#t1249~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1252~0#1.base| |ULTIMATE.start_main_~#t1251~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1252~0#1.base| |ULTIMATE.start_main_~#t1250~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1250~0#1.base| |ULTIMATE.start_main_~#t1249~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1251~0#1.base| |ULTIMATE.start_main_~#t1249~0#1.base|))), 61#L771true, 49#L843true, 138#L784true, Black: 208#(<= ~x~0 0), P0Thread1of1ForFork3InUse, Black: 209#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 212#(and (<= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), 222#true, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, Black: 225#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 224#(= ~__unbuffered_p3_EAX~0 0), Black: 230#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), Black: 226#(<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|), 254#true, 74#P2EXITtrue, Black: 241#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 242#(<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|), Black: 182#(<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|), 206#true, Black: 244#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (= ~y~0 1)), Black: 238#true, Black: 181#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 184#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), Black: 246#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|))]) [2023-11-06 22:39:03,866 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-06 22:39:03,866 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:39:03,866 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:39:03,866 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:39:04,800 INFO L124 PetriNetUnfolderBase]: 14435/21393 cut-off events. [2023-11-06 22:39:04,800 INFO L125 PetriNetUnfolderBase]: For 125594/130952 co-relation queries the response was YES. [2023-11-06 22:39:04,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78222 conditions, 21393 events. 14435/21393 cut-off events. For 125594/130952 co-relation queries the response was YES. Maximal size of possible extension queue 1029. Compared 141958 event pairs, 2476 based on Foata normal form. 2288/23332 useless extension candidates. Maximal degree in co-relation 78197. Up to 13773 conditions per place. [2023-11-06 22:39:04,970 INFO L140 encePairwiseOnDemand]: 285/292 looper letters, 147 selfloop transitions, 10 changer transitions 0/185 dead transitions. [2023-11-06 22:39:04,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 185 transitions, 2533 flow [2023-11-06 22:39:04,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:39:04,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:39:04,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 713 transitions. [2023-11-06 22:39:04,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48835616438356166 [2023-11-06 22:39:04,974 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 713 transitions. [2023-11-06 22:39:04,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 713 transitions. [2023-11-06 22:39:04,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:39:04,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 713 transitions. [2023-11-06 22:39:04,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.6) internal successors, (713), 5 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:39:04,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 292.0) internal successors, (1752), 6 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:39:04,982 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 292.0) internal successors, (1752), 6 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:39:04,982 INFO L175 Difference]: Start difference. First operand has 77 places, 76 transitions, 977 flow. Second operand 5 states and 713 transitions. [2023-11-06 22:39:04,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 185 transitions, 2533 flow [2023-11-06 22:39:05,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 185 transitions, 2505 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-11-06 22:39:05,120 INFO L231 Difference]: Finished difference. Result has 77 places, 85 transitions, 1036 flow [2023-11-06 22:39:05,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=961, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1036, PETRI_PLACES=77, PETRI_TRANSITIONS=85} [2023-11-06 22:39:05,121 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 24 predicate places. [2023-11-06 22:39:05,121 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 85 transitions, 1036 flow [2023-11-06 22:39:05,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:39:05,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:39:05,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:05,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:39:05,122 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:39:05,123 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:05,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1649391756, now seen corresponding path program 1 times [2023-11-06 22:39:05,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:05,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659738217] [2023-11-06 22:39:05,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:05,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:05,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:05,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:39:05,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:05,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659738217] [2023-11-06 22:39:05,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659738217] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:05,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:05,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:39:05,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816644729] [2023-11-06 22:39:05,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:05,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:39:05,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:05,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:39:05,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:39:05,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 292 [2023-11-06 22:39:05,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 85 transitions, 1036 flow. Second operand has 5 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:39:05,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:39:05,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 292 [2023-11-06 22:39:05,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:39:12,009 INFO L124 PetriNetUnfolderBase]: 28447/40984 cut-off events. [2023-11-06 22:39:12,009 INFO L125 PetriNetUnfolderBase]: For 267678/267678 co-relation queries the response was YES. [2023-11-06 22:39:12,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189692 conditions, 40984 events. 28447/40984 cut-off events. For 267678/267678 co-relation queries the response was YES. Maximal size of possible extension queue 1436. Compared 268931 event pairs, 7517 based on Foata normal form. 612/41596 useless extension candidates. Maximal degree in co-relation 189667. Up to 16904 conditions per place. [2023-11-06 22:39:12,300 INFO L140 encePairwiseOnDemand]: 281/292 looper letters, 90 selfloop transitions, 38 changer transitions 72/200 dead transitions. [2023-11-06 22:39:12,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 200 transitions, 2384 flow [2023-11-06 22:39:12,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:39:12,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:39:12,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 948 transitions. [2023-11-06 22:39:12,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4637964774951076 [2023-11-06 22:39:12,306 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 948 transitions. [2023-11-06 22:39:12,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 948 transitions. [2023-11-06 22:39:12,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:39:12,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 948 transitions. [2023-11-06 22:39:12,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.42857142857142) internal successors, (948), 7 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:39:12,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 292.0) internal successors, (2336), 8 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:39:12,317 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 292.0) internal successors, (2336), 8 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:39:12,318 INFO L175 Difference]: Start difference. First operand has 77 places, 85 transitions, 1036 flow. Second operand 7 states and 948 transitions. [2023-11-06 22:39:12,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 200 transitions, 2384 flow [2023-11-06 22:39:12,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 200 transitions, 2367 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-06 22:39:12,973 INFO L231 Difference]: Finished difference. Result has 88 places, 82 transitions, 1235 flow [2023-11-06 22:39:12,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=1029, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1235, PETRI_PLACES=88, PETRI_TRANSITIONS=82} [2023-11-06 22:39:12,974 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 35 predicate places. [2023-11-06 22:39:12,974 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 82 transitions, 1235 flow [2023-11-06 22:39:12,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:39:12,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:39:12,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:12,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:39:12,975 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:39:12,976 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:12,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1361209245, now seen corresponding path program 1 times [2023-11-06 22:39:12,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:12,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062567604] [2023-11-06 22:39:12,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:12,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:13,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:39:13,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:13,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062567604] [2023-11-06 22:39:13,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062567604] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:13,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:13,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:39:13,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727200086] [2023-11-06 22:39:13,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:13,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:39:13,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:13,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:39:13,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:39:13,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 292 [2023-11-06 22:39:13,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 82 transitions, 1235 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-06 22:39:13,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:39:13,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 292 [2023-11-06 22:39:13,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:39:16,311 INFO L124 PetriNetUnfolderBase]: 10115/15882 cut-off events. [2023-11-06 22:39:16,311 INFO L125 PetriNetUnfolderBase]: For 107761/110807 co-relation queries the response was YES. [2023-11-06 22:39:16,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66713 conditions, 15882 events. 10115/15882 cut-off events. For 107761/110807 co-relation queries the response was YES. Maximal size of possible extension queue 804. Compared 111222 event pairs, 1366 based on Foata normal form. 1839/17427 useless extension candidates. Maximal degree in co-relation 66683. Up to 6082 conditions per place. [2023-11-06 22:39:16,431 INFO L140 encePairwiseOnDemand]: 285/292 looper letters, 170 selfloop transitions, 14 changer transitions 8/219 dead transitions. [2023-11-06 22:39:16,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 219 transitions, 3485 flow [2023-11-06 22:39:16,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:39:16,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:39:16,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 858 transitions. [2023-11-06 22:39:16,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4897260273972603 [2023-11-06 22:39:16,434 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 858 transitions. [2023-11-06 22:39:16,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 858 transitions. [2023-11-06 22:39:16,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:39:16,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 858 transitions. [2023-11-06 22:39:16,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 143.0) internal successors, (858), 6 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:39:16,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 292.0) internal successors, (2044), 7 states have internal predecessors, (2044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:39:16,442 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 292.0) internal successors, (2044), 7 states have internal predecessors, (2044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:39:16,443 INFO L175 Difference]: Start difference. First operand has 88 places, 82 transitions, 1235 flow. Second operand 6 states and 858 transitions. [2023-11-06 22:39:16,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 219 transitions, 3485 flow [2023-11-06 22:39:16,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 219 transitions, 3463 flow, removed 11 selfloop flow, removed 3 redundant places. [2023-11-06 22:39:16,675 INFO L231 Difference]: Finished difference. Result has 88 places, 91 transitions, 1341 flow [2023-11-06 22:39:16,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=1221, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1341, PETRI_PLACES=88, PETRI_TRANSITIONS=91} [2023-11-06 22:39:16,676 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 35 predicate places. [2023-11-06 22:39:16,676 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 91 transitions, 1341 flow [2023-11-06 22:39:16,676 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-06 22:39:16,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:39:16,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:16,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:39:16,677 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:39:16,677 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:16,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1141043291, now seen corresponding path program 1 times [2023-11-06 22:39:16,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:16,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402554001] [2023-11-06 22:39:16,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:16,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:16,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:39:16,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:16,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402554001] [2023-11-06 22:39:16,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402554001] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:16,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:16,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:39:16,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842543173] [2023-11-06 22:39:16,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:16,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:39:16,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:16,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:39:16,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:39:16,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 292 [2023-11-06 22:39:16,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 91 transitions, 1341 flow. Second operand has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:39:16,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:39:16,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 292 [2023-11-06 22:39:16,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand