./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix039.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc 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_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix039.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4df22382a468f75ea1bc6624bacd8789c0b9b9f8aa1bc2866cf2715dcbc507bc --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:28:26,000 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:28:26,071 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 05:28:26,076 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:28:26,077 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:28:26,106 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:28:26,107 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:28:26,107 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:28:26,108 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:28:26,109 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:28:26,109 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:28:26,110 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:28:26,111 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:28:26,111 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:28:26,112 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:28:26,113 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:28:26,113 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:28:26,114 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:28:26,114 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:28:26,115 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:28:26,115 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 05:28:26,116 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 05:28:26,117 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 05:28:26,117 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:28:26,118 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:28:26,118 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 05:28:26,119 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:28:26,119 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:28:26,120 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:28:26,120 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:28:26,120 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:28:26,121 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:28:26,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:28:26,122 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:28:26,122 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:28:26,122 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:28:26,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:28:26,123 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:28:26,123 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:28:26,123 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:28:26,124 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:28:26,124 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_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/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_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4df22382a468f75ea1bc6624bacd8789c0b9b9f8aa1bc2866cf2715dcbc507bc [2023-11-29 05:28:26,384 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:28:26,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:28:26,411 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:28:26,412 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:28:26,412 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:28:26,414 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix039.opt.i [2023-11-29 05:28:29,493 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:28:29,804 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:28:29,805 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/sv-benchmarks/c/pthread-wmm/mix039.opt.i [2023-11-29 05:28:29,820 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/data/2651a4735/952f3a2391854b6898433524143f9612/FLAGc5236e2ac [2023-11-29 05:28:29,837 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/data/2651a4735/952f3a2391854b6898433524143f9612 [2023-11-29 05:28:29,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:28:29,841 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:28:29,843 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:28:29,843 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:28:29,848 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:28:29,849 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:28:29" (1/1) ... [2023-11-29 05:28:29,850 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1be62c94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:28:29, skipping insertion in model container [2023-11-29 05:28:29,850 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:28:29" (1/1) ... [2023-11-29 05:28:29,906 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:28:30,277 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:28:30,291 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:28:30,357 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:28:30,398 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:28:30,398 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:28:30,408 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:28:30,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:28:30 WrapperNode [2023-11-29 05:28:30,408 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:28:30,409 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:28:30,410 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:28:30,410 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:28:30,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:28:30" (1/1) ... [2023-11-29 05:28:30,438 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:28:30" (1/1) ... [2023-11-29 05:28:30,467 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 157 [2023-11-29 05:28:30,467 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:28:30,468 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:28:30,468 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:28:30,469 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:28:30,483 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:28:30" (1/1) ... [2023-11-29 05:28:30,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:28:30" (1/1) ... [2023-11-29 05:28:30,488 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:28:30" (1/1) ... [2023-11-29 05:28:30,510 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2023-11-29 05:28:30,511 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:28:30" (1/1) ... [2023-11-29 05:28:30,511 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:28:30" (1/1) ... [2023-11-29 05:28:30,522 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:28:30" (1/1) ... [2023-11-29 05:28:30,525 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:28:30" (1/1) ... [2023-11-29 05:28:30,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:28:30" (1/1) ... [2023-11-29 05:28:30,532 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:28:30" (1/1) ... [2023-11-29 05:28:30,537 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:28:30,538 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:28:30,539 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:28:30,539 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:28:30,540 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:28:30" (1/1) ... [2023-11-29 05:28:30,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:28:30,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:28:30,576 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:28:30,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:28:30,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 05:28:30,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 05:28:30,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 05:28:30,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 05:28:30,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 05:28:30,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 05:28:30,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:28:30,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:28:30,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:28:30,612 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 05:28:30,613 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 05:28:30,613 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 05:28:30,613 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 05:28:30,613 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 05:28:30,614 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 05:28:30,614 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-29 05:28:30,614 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-29 05:28:30,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:28:30,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 05:28:30,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 05:28:30,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 05:28:30,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 05:28:30,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 05:28:30,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:28:30,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:28:30,618 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 05:28:30,798 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:28:30,801 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:28:31,152 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:28:31,375 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:28:31,375 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 05:28:31,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:28:31 BoogieIcfgContainer [2023-11-29 05:28:31,376 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:28:31,380 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:28:31,380 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:28:31,383 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:28:31,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:28:29" (1/3) ... [2023-11-29 05:28:31,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785b2ba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:28:31, skipping insertion in model container [2023-11-29 05:28:31,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:28:30" (2/3) ... [2023-11-29 05:28:31,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785b2ba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:28:31, skipping insertion in model container [2023-11-29 05:28:31,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:28:31" (3/3) ... [2023-11-29 05:28:31,386 INFO L112 eAbstractionObserver]: Analyzing ICFG mix039.opt.i [2023-11-29 05:28:31,404 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:28:31,405 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-29 05:28:31,405 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 05:28:31,465 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 05:28:31,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 67 transitions, 150 flow [2023-11-29 05:28:31,536 INFO L124 PetriNetUnfolderBase]: 2/63 cut-off events. [2023-11-29 05:28:31,536 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:28:31,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 63 events. 2/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 131 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2023-11-29 05:28:31,542 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 67 transitions, 150 flow [2023-11-29 05:28:31,546 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 63 transitions, 138 flow [2023-11-29 05:28:31,557 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:28:31,564 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;@13e8b205, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:28:31,565 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-29 05:28:31,568 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 05:28:31,568 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 05:28:31,568 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:28:31,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:28:31,569 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 05:28:31,570 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:28:31,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:28:31,575 INFO L85 PathProgramCache]: Analyzing trace with hash 13591, now seen corresponding path program 1 times [2023-11-29 05:28:31,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:28:31,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284316937] [2023-11-29 05:28:31,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:28:31,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:28:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:28:31,851 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-29 05:28:31,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:28:31,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284316937] [2023-11-29 05:28:31,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284316937] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:28:31,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:28:31,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:28:31,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805489425] [2023-11-29 05:28:31,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:28:31,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:28:31,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:28:31,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:28:31,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:28:31,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 67 [2023-11-29 05:28:31,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 63 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:31,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:28:31,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 67 [2023-11-29 05:28:31,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:28:32,530 INFO L124 PetriNetUnfolderBase]: 1175/2199 cut-off events. [2023-11-29 05:28:32,531 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-29 05:28:32,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3936 conditions, 2199 events. 1175/2199 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 17110 event pairs, 879 based on Foata normal form. 120/2134 useless extension candidates. Maximal degree in co-relation 3921. Up to 1277 conditions per place. [2023-11-29 05:28:32,564 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 30 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-11-29 05:28:32,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 67 transitions, 210 flow [2023-11-29 05:28:32,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:28:32,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:28:32,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2023-11-29 05:28:32,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7562189054726368 [2023-11-29 05:28:32,581 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 152 transitions. [2023-11-29 05:28:32,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 152 transitions. [2023-11-29 05:28:32,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:28:32,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 152 transitions. [2023-11-29 05:28:32,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:32,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:32,594 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:32,597 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 138 flow. Second operand 3 states and 152 transitions. [2023-11-29 05:28:32,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 67 transitions, 210 flow [2023-11-29 05:28:32,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 67 transitions, 206 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 05:28:32,606 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 130 flow [2023-11-29 05:28:32,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2023-11-29 05:28:32,613 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -4 predicate places. [2023-11-29 05:28:32,614 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 130 flow [2023-11-29 05:28:32,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:32,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:28:32,614 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 05:28:32,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:28:32,615 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:28:32,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:28:32,616 INFO L85 PathProgramCache]: Analyzing trace with hash 13592, now seen corresponding path program 1 times [2023-11-29 05:28:32,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:28:32,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723196325] [2023-11-29 05:28:32,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:28:32,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:28:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:28:32,753 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-29 05:28:32,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:28:32,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723196325] [2023-11-29 05:28:32,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723196325] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:28:32,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:28:32,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:28:32,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386401307] [2023-11-29 05:28:32,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:28:32,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:28:32,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:28:32,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:28:32,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:28:32,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 67 [2023-11-29 05:28:32,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:32,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:28:32,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 67 [2023-11-29 05:28:32,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:28:33,284 INFO L124 PetriNetUnfolderBase]: 1175/2198 cut-off events. [2023-11-29 05:28:33,285 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-29 05:28:33,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3992 conditions, 2198 events. 1175/2198 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16970 event pairs, 879 based on Foata normal form. 1/2014 useless extension candidates. Maximal degree in co-relation 3981. Up to 1276 conditions per place. [2023-11-29 05:28:33,311 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 29 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-11-29 05:28:33,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 66 transitions, 206 flow [2023-11-29 05:28:33,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:28:33,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:28:33,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2023-11-29 05:28:33,315 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7562189054726368 [2023-11-29 05:28:33,315 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 152 transitions. [2023-11-29 05:28:33,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 152 transitions. [2023-11-29 05:28:33,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:28:33,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 152 transitions. [2023-11-29 05:28:33,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:33,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:33,320 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:33,320 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 130 flow. Second operand 3 states and 152 transitions. [2023-11-29 05:28:33,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 66 transitions, 206 flow [2023-11-29 05:28:33,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 66 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:28:33,328 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 128 flow [2023-11-29 05:28:33,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2023-11-29 05:28:33,330 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -5 predicate places. [2023-11-29 05:28:33,330 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 128 flow [2023-11-29 05:28:33,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:33,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:28:33,331 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:28:33,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:28:33,332 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:28:33,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:28:33,332 INFO L85 PathProgramCache]: Analyzing trace with hash 405307688, now seen corresponding path program 1 times [2023-11-29 05:28:33,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:28:33,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085071045] [2023-11-29 05:28:33,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:28:33,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:28:33,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:28:33,415 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-29 05:28:33,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:28:33,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085071045] [2023-11-29 05:28:33,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085071045] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:28:33,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:28:33,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:28:33,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916667456] [2023-11-29 05:28:33,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:28:33,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:28:33,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:28:33,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:28:33,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:28:33,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 67 [2023-11-29 05:28:33,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:33,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:28:33,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 67 [2023-11-29 05:28:33,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:28:33,877 INFO L124 PetriNetUnfolderBase]: 1176/2196 cut-off events. [2023-11-29 05:28:33,878 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-29 05:28:33,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3993 conditions, 2196 events. 1176/2196 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16913 event pairs, 879 based on Foata normal form. 0/2015 useless extension candidates. Maximal degree in co-relation 3982. Up to 1276 conditions per place. [2023-11-29 05:28:33,896 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 30 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-11-29 05:28:33,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 65 transitions, 206 flow [2023-11-29 05:28:33,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:28:33,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:28:33,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2023-11-29 05:28:33,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2023-11-29 05:28:33,899 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 150 transitions. [2023-11-29 05:28:33,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 150 transitions. [2023-11-29 05:28:33,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:28:33,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 150 transitions. [2023-11-29 05:28:33,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:33,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:33,902 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:33,903 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 128 flow. Second operand 3 states and 150 transitions. [2023-11-29 05:28:33,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 65 transitions, 206 flow [2023-11-29 05:28:33,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 65 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:28:33,908 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-29 05:28:33,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2023-11-29 05:28:33,909 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -6 predicate places. [2023-11-29 05:28:33,910 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-29 05:28:33,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:33,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:28:33,910 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:28:33,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:28:33,911 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:28:33,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:28:33,911 INFO L85 PathProgramCache]: Analyzing trace with hash 405307689, now seen corresponding path program 1 times [2023-11-29 05:28:33,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:28:33,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354366661] [2023-11-29 05:28:33,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:28:33,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:28:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:28:33,995 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-29 05:28:33,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:28:33,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354366661] [2023-11-29 05:28:33,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354366661] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:28:33,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:28:33,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:28:33,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242008763] [2023-11-29 05:28:33,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:28:33,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:28:33,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:28:33,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:28:33,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:28:34,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 67 [2023-11-29 05:28:34,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:34,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:28:34,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 67 [2023-11-29 05:28:34,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:28:34,377 INFO L124 PetriNetUnfolderBase]: 1175/2194 cut-off events. [2023-11-29 05:28:34,377 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2023-11-29 05:28:34,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3989 conditions, 2194 events. 1175/2194 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16948 event pairs, 742 based on Foata normal form. 2/2016 useless extension candidates. Maximal degree in co-relation 3979. Up to 1273 conditions per place. [2023-11-29 05:28:34,400 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 29 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-29 05:28:34,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 64 transitions, 202 flow [2023-11-29 05:28:34,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:28:34,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:28:34,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2023-11-29 05:28:34,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7562189054726368 [2023-11-29 05:28:34,402 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 152 transitions. [2023-11-29 05:28:34,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 152 transitions. [2023-11-29 05:28:34,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:28:34,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 152 transitions. [2023-11-29 05:28:34,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:34,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:34,406 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:34,406 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 152 transitions. [2023-11-29 05:28:34,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 64 transitions, 202 flow [2023-11-29 05:28:34,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 64 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:28:34,410 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 124 flow [2023-11-29 05:28:34,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2023-11-29 05:28:34,412 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -7 predicate places. [2023-11-29 05:28:34,412 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 124 flow [2023-11-29 05:28:34,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:34,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:28:34,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:28:34,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 05:28:34,413 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:28:34,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:28:34,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1368685508, now seen corresponding path program 1 times [2023-11-29 05:28:34,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:28:34,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358901356] [2023-11-29 05:28:34,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:28:34,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:28:34,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:28:34,485 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-29 05:28:34,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:28:34,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358901356] [2023-11-29 05:28:34,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358901356] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:28:34,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:28:34,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:28:34,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922567580] [2023-11-29 05:28:34,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:28:34,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:28:34,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:28:34,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:28:34,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:28:34,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 67 [2023-11-29 05:28:34,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:34,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:28:34,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 67 [2023-11-29 05:28:34,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:28:34,975 INFO L124 PetriNetUnfolderBase]: 1179/2191 cut-off events. [2023-11-29 05:28:34,975 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2023-11-29 05:28:34,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3994 conditions, 2191 events. 1179/2191 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 17142 event pairs, 880 based on Foata normal form. 0/2022 useless extension candidates. Maximal degree in co-relation 3984. Up to 1272 conditions per place. [2023-11-29 05:28:34,997 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 30 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-29 05:28:34,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 63 transitions, 202 flow [2023-11-29 05:28:34,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:28:34,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:28:34,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2023-11-29 05:28:34,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2023-11-29 05:28:34,999 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 150 transitions. [2023-11-29 05:28:35,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 150 transitions. [2023-11-29 05:28:35,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:28:35,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 150 transitions. [2023-11-29 05:28:35,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:35,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:35,003 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:35,003 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 124 flow. Second operand 3 states and 150 transitions. [2023-11-29 05:28:35,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 63 transitions, 202 flow [2023-11-29 05:28:35,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 63 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:28:35,009 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 122 flow [2023-11-29 05:28:35,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2023-11-29 05:28:35,010 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -8 predicate places. [2023-11-29 05:28:35,010 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 122 flow [2023-11-29 05:28:35,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:35,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:28:35,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:28:35,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 05:28:35,011 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:28:35,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:28:35,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1368685509, now seen corresponding path program 1 times [2023-11-29 05:28:35,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:28:35,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325813546] [2023-11-29 05:28:35,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:28:35,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:28:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:28:35,115 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-29 05:28:35,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:28:35,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325813546] [2023-11-29 05:28:35,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325813546] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:28:35,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:28:35,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:28:35,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052269897] [2023-11-29 05:28:35,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:28:35,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:28:35,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:28:35,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:28:35,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:28:35,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 67 [2023-11-29 05:28:35,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:35,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:28:35,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 67 [2023-11-29 05:28:35,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:28:35,546 INFO L124 PetriNetUnfolderBase]: 1175/2186 cut-off events. [2023-11-29 05:28:35,547 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2023-11-29 05:28:35,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3983 conditions, 2186 events. 1175/2186 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16514 event pairs, 611 based on Foata normal form. 4/2020 useless extension candidates. Maximal degree in co-relation 3973. Up to 1264 conditions per place. [2023-11-29 05:28:35,569 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 29 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-29 05:28:35,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 62 transitions, 198 flow [2023-11-29 05:28:35,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:28:35,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:28:35,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2023-11-29 05:28:35,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7562189054726368 [2023-11-29 05:28:35,571 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 152 transitions. [2023-11-29 05:28:35,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 152 transitions. [2023-11-29 05:28:35,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:28:35,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 152 transitions. [2023-11-29 05:28:35,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:35,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:35,574 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:35,574 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 122 flow. Second operand 3 states and 152 transitions. [2023-11-29 05:28:35,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 62 transitions, 198 flow [2023-11-29 05:28:35,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 62 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:28:35,577 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 120 flow [2023-11-29 05:28:35,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2023-11-29 05:28:35,579 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -9 predicate places. [2023-11-29 05:28:35,579 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 120 flow [2023-11-29 05:28:35,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:35,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:28:35,579 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:28:35,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 05:28:35,580 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:28:35,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:28:35,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1909119574, now seen corresponding path program 1 times [2023-11-29 05:28:35,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:28:35,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032859839] [2023-11-29 05:28:35,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:28:35,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:28:35,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:28:35,650 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-29 05:28:35,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:28:35,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032859839] [2023-11-29 05:28:35,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032859839] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:28:35,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:28:35,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:28:35,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518154945] [2023-11-29 05:28:35,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:28:35,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:28:35,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:28:35,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:28:35,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:28:35,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 67 [2023-11-29 05:28:35,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:35,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:28:35,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 67 [2023-11-29 05:28:35,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:28:36,022 INFO L124 PetriNetUnfolderBase]: 1195/2176 cut-off events. [2023-11-29 05:28:36,022 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2023-11-29 05:28:36,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4005 conditions, 2176 events. 1195/2176 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 16464 event pairs, 777 based on Foata normal form. 0/2029 useless extension candidates. Maximal degree in co-relation 3995. Up to 1264 conditions per place. [2023-11-29 05:28:36,038 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 30 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-29 05:28:36,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 61 transitions, 198 flow [2023-11-29 05:28:36,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:28:36,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:28:36,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2023-11-29 05:28:36,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2023-11-29 05:28:36,040 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 150 transitions. [2023-11-29 05:28:36,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 150 transitions. [2023-11-29 05:28:36,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:28:36,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 150 transitions. [2023-11-29 05:28:36,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:36,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:36,043 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:36,043 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 120 flow. Second operand 3 states and 150 transitions. [2023-11-29 05:28:36,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 61 transitions, 198 flow [2023-11-29 05:28:36,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 61 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:28:36,047 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 118 flow [2023-11-29 05:28:36,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2023-11-29 05:28:36,048 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -10 predicate places. [2023-11-29 05:28:36,048 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 118 flow [2023-11-29 05:28:36,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:36,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:28:36,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:28:36,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 05:28:36,049 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:28:36,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:28:36,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1909119573, now seen corresponding path program 1 times [2023-11-29 05:28:36,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:28:36,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055693974] [2023-11-29 05:28:36,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:28:36,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:28:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:28:36,137 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-29 05:28:36,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:28:36,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055693974] [2023-11-29 05:28:36,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055693974] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:28:36,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:28:36,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:28:36,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281498725] [2023-11-29 05:28:36,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:28:36,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:28:36,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:28:36,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:28:36,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:28:36,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 67 [2023-11-29 05:28:36,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:36,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:28:36,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 67 [2023-11-29 05:28:36,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:28:36,470 INFO L124 PetriNetUnfolderBase]: 1175/2106 cut-off events. [2023-11-29 05:28:36,470 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2023-11-29 05:28:36,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3911 conditions, 2106 events. 1175/2106 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 14699 event pairs, 763 based on Foata normal form. 12/1997 useless extension candidates. Maximal degree in co-relation 3901. Up to 1232 conditions per place. [2023-11-29 05:28:36,484 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 29 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-29 05:28:36,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 60 transitions, 194 flow [2023-11-29 05:28:36,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:28:36,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:28:36,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2023-11-29 05:28:36,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7562189054726368 [2023-11-29 05:28:36,486 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 152 transitions. [2023-11-29 05:28:36,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 152 transitions. [2023-11-29 05:28:36,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:28:36,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 152 transitions. [2023-11-29 05:28:36,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:36,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:36,488 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:36,488 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 118 flow. Second operand 3 states and 152 transitions. [2023-11-29 05:28:36,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 60 transitions, 194 flow [2023-11-29 05:28:36,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 60 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:28:36,491 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 116 flow [2023-11-29 05:28:36,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2023-11-29 05:28:36,492 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -11 predicate places. [2023-11-29 05:28:36,492 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 116 flow [2023-11-29 05:28:36,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:36,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:28:36,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:28:36,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 05:28:36,493 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:28:36,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:28:36,494 INFO L85 PathProgramCache]: Analyzing trace with hash -623877669, now seen corresponding path program 1 times [2023-11-29 05:28:36,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:28:36,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331883218] [2023-11-29 05:28:36,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:28:36,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:28:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:28:36,622 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-29 05:28:36,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:28:36,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331883218] [2023-11-29 05:28:36,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331883218] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:28:36,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:28:36,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:28:36,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582499061] [2023-11-29 05:28:36,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:28:36,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:28:36,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:28:36,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:28:36,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:28:36,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 67 [2023-11-29 05:28:36,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:36,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:28:36,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 67 [2023-11-29 05:28:36,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:28:36,996 INFO L124 PetriNetUnfolderBase]: 931/1870 cut-off events. [2023-11-29 05:28:36,996 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-11-29 05:28:37,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3323 conditions, 1870 events. 931/1870 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 14167 event pairs, 199 based on Foata normal form. 0/1853 useless extension candidates. Maximal degree in co-relation 3313. Up to 1021 conditions per place. [2023-11-29 05:28:37,011 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 29 selfloop transitions, 2 changer transitions 2/62 dead transitions. [2023-11-29 05:28:37,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 62 transitions, 204 flow [2023-11-29 05:28:37,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:28:37,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:28:37,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2023-11-29 05:28:37,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7810945273631841 [2023-11-29 05:28:37,013 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 157 transitions. [2023-11-29 05:28:37,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 157 transitions. [2023-11-29 05:28:37,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:28:37,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 157 transitions. [2023-11-29 05:28:37,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:37,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:37,015 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:37,015 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 157 transitions. [2023-11-29 05:28:37,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 62 transitions, 204 flow [2023-11-29 05:28:37,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 62 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:28:37,018 INFO L231 Difference]: Finished difference. Result has 62 places, 50 transitions, 112 flow [2023-11-29 05:28:37,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=62, PETRI_TRANSITIONS=50} [2023-11-29 05:28:37,019 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -12 predicate places. [2023-11-29 05:28:37,019 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 112 flow [2023-11-29 05:28:37,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:37,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:28:37,020 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] [2023-11-29 05:28:37,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 05:28:37,020 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:28:37,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:28:37,021 INFO L85 PathProgramCache]: Analyzing trace with hash 28453398, now seen corresponding path program 1 times [2023-11-29 05:28:37,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:28:37,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083863490] [2023-11-29 05:28:37,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:28:37,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:28:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:28:38,033 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-29 05:28:38,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:28:38,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083863490] [2023-11-29 05:28:38,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083863490] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:28:38,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:28:38,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 05:28:38,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943505677] [2023-11-29 05:28:38,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:28:38,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 05:28:38,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:28:38,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 05:28:38,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:28:38,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 05:28:38,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 112 flow. Second operand has 11 states, 11 states have (on average 37.63636363636363) internal successors, (414), 11 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:38,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:28:38,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 05:28:38,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:28:39,147 INFO L124 PetriNetUnfolderBase]: 1032/1827 cut-off events. [2023-11-29 05:28:39,148 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2023-11-29 05:28:39,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3449 conditions, 1827 events. 1032/1827 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 12729 event pairs, 60 based on Foata normal form. 60/1869 useless extension candidates. Maximal degree in co-relation 3437. Up to 756 conditions per place. [2023-11-29 05:28:39,160 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 35 selfloop transitions, 5 changer transitions 10/74 dead transitions. [2023-11-29 05:28:39,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 74 transitions, 262 flow [2023-11-29 05:28:39,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:28:39,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 05:28:39,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 339 transitions. [2023-11-29 05:28:39,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6324626865671642 [2023-11-29 05:28:39,162 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 339 transitions. [2023-11-29 05:28:39,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 339 transitions. [2023-11-29 05:28:39,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:28:39,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 339 transitions. [2023-11-29 05:28:39,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 42.375) internal successors, (339), 8 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:39,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:39,167 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:39,167 INFO L175 Difference]: Start difference. First operand has 62 places, 50 transitions, 112 flow. Second operand 8 states and 339 transitions. [2023-11-29 05:28:39,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 74 transitions, 262 flow [2023-11-29 05:28:39,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 74 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:28:39,169 INFO L231 Difference]: Finished difference. Result has 65 places, 48 transitions, 114 flow [2023-11-29 05:28:39,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=114, PETRI_PLACES=65, PETRI_TRANSITIONS=48} [2023-11-29 05:28:39,170 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -9 predicate places. [2023-11-29 05:28:39,171 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 48 transitions, 114 flow [2023-11-29 05:28:39,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 37.63636363636363) internal successors, (414), 11 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:39,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:28:39,171 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] [2023-11-29 05:28:39,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 05:28:39,172 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:28:39,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:28:39,172 INFO L85 PathProgramCache]: Analyzing trace with hash 28454623, now seen corresponding path program 1 times [2023-11-29 05:28:39,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:28:39,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123820445] [2023-11-29 05:28:39,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:28:39,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:28:39,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:28:39,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-29 05:28:39,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:28:39,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123820445] [2023-11-29 05:28:39,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123820445] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:28:39,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:28:39,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:28:39,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234969539] [2023-11-29 05:28:39,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:28:39,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:28:39,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:28:39,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:28:39,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:28:39,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 67 [2023-11-29 05:28:39,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 48 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:39,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:28:39,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 67 [2023-11-29 05:28:39,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:28:41,275 INFO L124 PetriNetUnfolderBase]: 10607/16407 cut-off events. [2023-11-29 05:28:41,275 INFO L125 PetriNetUnfolderBase]: For 691/691 co-relation queries the response was YES. [2023-11-29 05:28:41,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31909 conditions, 16407 events. 10607/16407 cut-off events. For 691/691 co-relation queries the response was YES. Maximal size of possible extension queue 948. Compared 124015 event pairs, 2534 based on Foata normal form. 0/15903 useless extension candidates. Maximal degree in co-relation 31898. Up to 6451 conditions per place. [2023-11-29 05:28:41,348 INFO L140 encePairwiseOnDemand]: 56/67 looper letters, 42 selfloop transitions, 7 changer transitions 78/148 dead transitions. [2023-11-29 05:28:41,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 148 transitions, 594 flow [2023-11-29 05:28:41,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:28:41,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 05:28:41,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 435 transitions. [2023-11-29 05:28:41,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7213930348258707 [2023-11-29 05:28:41,352 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 435 transitions. [2023-11-29 05:28:41,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 435 transitions. [2023-11-29 05:28:41,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:28:41,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 435 transitions. [2023-11-29 05:28:41,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 48.333333333333336) internal successors, (435), 9 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:41,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 67.0) internal successors, (670), 10 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:41,357 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 67.0) internal successors, (670), 10 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:41,357 INFO L175 Difference]: Start difference. First operand has 65 places, 48 transitions, 114 flow. Second operand 9 states and 435 transitions. [2023-11-29 05:28:41,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 148 transitions, 594 flow [2023-11-29 05:28:41,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 148 transitions, 572 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 05:28:41,362 INFO L231 Difference]: Finished difference. Result has 74 places, 53 transitions, 202 flow [2023-11-29 05:28:41,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=202, PETRI_PLACES=74, PETRI_TRANSITIONS=53} [2023-11-29 05:28:41,363 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 0 predicate places. [2023-11-29 05:28:41,363 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 53 transitions, 202 flow [2023-11-29 05:28:41,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:41,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:28:41,364 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:28:41,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 05:28:41,364 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:28:41,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:28:41,365 INFO L85 PathProgramCache]: Analyzing trace with hash -875420002, now seen corresponding path program 1 times [2023-11-29 05:28:41,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:28:41,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566128739] [2023-11-29 05:28:41,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:28:41,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:28:41,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:28:41,590 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-29 05:28:41,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:28:41,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566128739] [2023-11-29 05:28:41,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566128739] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:28:41,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:28:41,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:28:41,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083751459] [2023-11-29 05:28:41,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:28:41,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:28:41,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:28:41,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:28:41,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:28:41,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 67 [2023-11-29 05:28:41,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 53 transitions, 202 flow. Second operand has 6 states, 6 states have (on average 36.5) internal successors, (219), 6 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:41,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:28:41,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 67 [2023-11-29 05:28:41,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:28:43,558 INFO L124 PetriNetUnfolderBase]: 7439/12158 cut-off events. [2023-11-29 05:28:43,558 INFO L125 PetriNetUnfolderBase]: For 17014/17122 co-relation queries the response was YES. [2023-11-29 05:28:43,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36304 conditions, 12158 events. 7439/12158 cut-off events. For 17014/17122 co-relation queries the response was YES. Maximal size of possible extension queue 681. Compared 92321 event pairs, 1387 based on Foata normal form. 330/12402 useless extension candidates. Maximal degree in co-relation 36285. Up to 4345 conditions per place. [2023-11-29 05:28:43,634 INFO L140 encePairwiseOnDemand]: 57/67 looper letters, 47 selfloop transitions, 8 changer transitions 68/144 dead transitions. [2023-11-29 05:28:43,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 144 transitions, 904 flow [2023-11-29 05:28:43,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:28:43,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 05:28:43,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 453 transitions. [2023-11-29 05:28:43,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6761194029850747 [2023-11-29 05:28:43,638 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 453 transitions. [2023-11-29 05:28:43,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 453 transitions. [2023-11-29 05:28:43,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:28:43,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 453 transitions. [2023-11-29 05:28:43,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 45.3) internal successors, (453), 10 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:43,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 67.0) internal successors, (737), 11 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:43,644 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 67.0) internal successors, (737), 11 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:43,644 INFO L175 Difference]: Start difference. First operand has 74 places, 53 transitions, 202 flow. Second operand 10 states and 453 transitions. [2023-11-29 05:28:43,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 144 transitions, 904 flow [2023-11-29 05:28:43,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 144 transitions, 778 flow, removed 32 selfloop flow, removed 4 redundant places. [2023-11-29 05:28:43,717 INFO L231 Difference]: Finished difference. Result has 81 places, 57 transitions, 258 flow [2023-11-29 05:28:43,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=258, PETRI_PLACES=81, PETRI_TRANSITIONS=57} [2023-11-29 05:28:43,718 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 7 predicate places. [2023-11-29 05:28:43,719 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 57 transitions, 258 flow [2023-11-29 05:28:43,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.5) internal successors, (219), 6 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:43,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:28:43,720 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:28:43,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 05:28:43,720 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:28:43,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:28:43,721 INFO L85 PathProgramCache]: Analyzing trace with hash 229486492, now seen corresponding path program 1 times [2023-11-29 05:28:43,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:28:43,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977317626] [2023-11-29 05:28:43,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:28:43,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:28:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:28:43,972 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-29 05:28:43,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:28:43,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977317626] [2023-11-29 05:28:43,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977317626] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:28:43,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:28:43,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:28:43,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647993698] [2023-11-29 05:28:43,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:28:43,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:28:43,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:28:43,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:28:43,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:28:43,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 67 [2023-11-29 05:28:43,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 57 transitions, 258 flow. Second operand has 6 states, 6 states have (on average 36.666666666666664) internal successors, (220), 6 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:43,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:28:43,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 67 [2023-11-29 05:28:43,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:28:45,648 INFO L124 PetriNetUnfolderBase]: 6636/11027 cut-off events. [2023-11-29 05:28:45,649 INFO L125 PetriNetUnfolderBase]: For 21282/21282 co-relation queries the response was YES. [2023-11-29 05:28:45,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34340 conditions, 11027 events. 6636/11027 cut-off events. For 21282/21282 co-relation queries the response was YES. Maximal size of possible extension queue 608. Compared 83527 event pairs, 970 based on Foata normal form. 238/11251 useless extension candidates. Maximal degree in co-relation 34314. Up to 5144 conditions per place. [2023-11-29 05:28:45,779 INFO L140 encePairwiseOnDemand]: 57/67 looper letters, 55 selfloop transitions, 16 changer transitions 56/148 dead transitions. [2023-11-29 05:28:45,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 148 transitions, 968 flow [2023-11-29 05:28:45,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:28:45,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 05:28:45,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 461 transitions. [2023-11-29 05:28:45,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6880597014925374 [2023-11-29 05:28:45,782 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 461 transitions. [2023-11-29 05:28:45,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 461 transitions. [2023-11-29 05:28:45,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:28:45,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 461 transitions. [2023-11-29 05:28:45,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 46.1) internal successors, (461), 10 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:45,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 67.0) internal successors, (737), 11 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:45,788 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 67.0) internal successors, (737), 11 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:45,788 INFO L175 Difference]: Start difference. First operand has 81 places, 57 transitions, 258 flow. Second operand 10 states and 461 transitions. [2023-11-29 05:28:45,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 148 transitions, 968 flow [2023-11-29 05:28:45,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 148 transitions, 917 flow, removed 23 selfloop flow, removed 5 redundant places. [2023-11-29 05:28:45,922 INFO L231 Difference]: Finished difference. Result has 87 places, 63 transitions, 368 flow [2023-11-29 05:28:45,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=368, PETRI_PLACES=87, PETRI_TRANSITIONS=63} [2023-11-29 05:28:45,922 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 13 predicate places. [2023-11-29 05:28:45,922 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 63 transitions, 368 flow [2023-11-29 05:28:45,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.666666666666664) internal successors, (220), 6 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:45,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:28:45,923 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:28:45,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 05:28:45,923 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:28:45,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:28:45,924 INFO L85 PathProgramCache]: Analyzing trace with hash -53033811, now seen corresponding path program 1 times [2023-11-29 05:28:45,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:28:45,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808473121] [2023-11-29 05:28:45,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:28:45,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:28:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:28:46,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:28:46,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:28:46,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808473121] [2023-11-29 05:28:46,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808473121] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:28:46,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:28:46,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:28:46,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034807571] [2023-11-29 05:28:46,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:28:46,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:28:46,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:28:46,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:28:46,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:28:46,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 05:28:46,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 63 transitions, 368 flow. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:46,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:28:46,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 05:28:46,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:28:49,098 INFO L124 PetriNetUnfolderBase]: 13844/21013 cut-off events. [2023-11-29 05:28:49,098 INFO L125 PetriNetUnfolderBase]: For 25031/28639 co-relation queries the response was YES. [2023-11-29 05:28:49,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54228 conditions, 21013 events. 13844/21013 cut-off events. For 25031/28639 co-relation queries the response was YES. Maximal size of possible extension queue 1186. Compared 155500 event pairs, 2597 based on Foata normal form. 923/20884 useless extension candidates. Maximal degree in co-relation 54197. Up to 11384 conditions per place. [2023-11-29 05:28:49,304 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 51 selfloop transitions, 6 changer transitions 0/93 dead transitions. [2023-11-29 05:28:49,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 93 transitions, 600 flow [2023-11-29 05:28:49,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:28:49,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 05:28:49,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 197 transitions. [2023-11-29 05:28:49,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7350746268656716 [2023-11-29 05:28:49,306 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 197 transitions. [2023-11-29 05:28:49,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 197 transitions. [2023-11-29 05:28:49,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:28:49,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 197 transitions. [2023-11-29 05:28:49,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 49.25) internal successors, (197), 4 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:49,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:49,309 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:49,309 INFO L175 Difference]: Start difference. First operand has 87 places, 63 transitions, 368 flow. Second operand 4 states and 197 transitions. [2023-11-29 05:28:49,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 93 transitions, 600 flow [2023-11-29 05:28:49,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 93 transitions, 548 flow, removed 26 selfloop flow, removed 10 redundant places. [2023-11-29 05:28:49,497 INFO L231 Difference]: Finished difference. Result has 76 places, 68 transitions, 370 flow [2023-11-29 05:28:49,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=370, PETRI_PLACES=76, PETRI_TRANSITIONS=68} [2023-11-29 05:28:49,498 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 2 predicate places. [2023-11-29 05:28:49,498 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 68 transitions, 370 flow [2023-11-29 05:28:49,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:49,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:28:49,499 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:28:49,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 05:28:49,499 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:28:49,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:28:49,499 INFO L85 PathProgramCache]: Analyzing trace with hash 787501427, now seen corresponding path program 1 times [2023-11-29 05:28:49,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:28:49,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345778698] [2023-11-29 05:28:49,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:28:49,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:28:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:28:49,721 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-29 05:28:49,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:28:49,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345778698] [2023-11-29 05:28:49,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345778698] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:28:49,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:28:49,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:28:49,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166852562] [2023-11-29 05:28:49,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:28:49,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:28:49,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:28:49,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:28:49,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:28:49,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-29 05:28:49,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 68 transitions, 370 flow. Second operand has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:49,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:28:49,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-29 05:28:49,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:28:53,004 INFO L124 PetriNetUnfolderBase]: 13498/22940 cut-off events. [2023-11-29 05:28:53,004 INFO L125 PetriNetUnfolderBase]: For 27520/28672 co-relation queries the response was YES. [2023-11-29 05:28:53,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63517 conditions, 22940 events. 13498/22940 cut-off events. For 27520/28672 co-relation queries the response was YES. Maximal size of possible extension queue 1273. Compared 199527 event pairs, 5015 based on Foata normal form. 372/20877 useless extension candidates. Maximal degree in co-relation 63492. Up to 8050 conditions per place. [2023-11-29 05:28:53,221 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 65 selfloop transitions, 13 changer transitions 0/113 dead transitions. [2023-11-29 05:28:53,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 113 transitions, 684 flow [2023-11-29 05:28:53,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:28:53,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:28:53,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 330 transitions. [2023-11-29 05:28:53,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7036247334754797 [2023-11-29 05:28:53,223 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 330 transitions. [2023-11-29 05:28:53,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 330 transitions. [2023-11-29 05:28:53,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:28:53,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 330 transitions. [2023-11-29 05:28:53,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 47.142857142857146) internal successors, (330), 7 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:53,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:53,227 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:53,227 INFO L175 Difference]: Start difference. First operand has 76 places, 68 transitions, 370 flow. Second operand 7 states and 330 transitions. [2023-11-29 05:28:53,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 113 transitions, 684 flow [2023-11-29 05:28:53,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 113 transitions, 682 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:28:53,339 INFO L231 Difference]: Finished difference. Result has 86 places, 73 transitions, 458 flow [2023-11-29 05:28:53,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=458, PETRI_PLACES=86, PETRI_TRANSITIONS=73} [2023-11-29 05:28:53,340 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 12 predicate places. [2023-11-29 05:28:53,340 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 73 transitions, 458 flow [2023-11-29 05:28:53,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:53,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:28:53,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:28:53,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 05:28:53,341 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:28:53,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:28:53,341 INFO L85 PathProgramCache]: Analyzing trace with hash -568038397, now seen corresponding path program 1 times [2023-11-29 05:28:53,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:28:53,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423504435] [2023-11-29 05:28:53,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:28:53,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:28:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:28:53,532 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-29 05:28:53,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:28:53,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423504435] [2023-11-29 05:28:53,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423504435] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:28:53,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:28:53,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:28:53,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358767104] [2023-11-29 05:28:53,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:28:53,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:28:53,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:28:53,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:28:53,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:28:53,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 05:28:53,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 73 transitions, 458 flow. Second operand has 5 states, 5 states have (on average 39.4) internal successors, (197), 5 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:53,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:28:53,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 05:28:53,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:28:56,815 INFO L124 PetriNetUnfolderBase]: 17646/26806 cut-off events. [2023-11-29 05:28:56,815 INFO L125 PetriNetUnfolderBase]: For 30137/35384 co-relation queries the response was YES. [2023-11-29 05:28:56,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75451 conditions, 26806 events. 17646/26806 cut-off events. For 30137/35384 co-relation queries the response was YES. Maximal size of possible extension queue 1397. Compared 201123 event pairs, 2195 based on Foata normal form. 1279/27035 useless extension candidates. Maximal degree in co-relation 75421. Up to 11633 conditions per place. [2023-11-29 05:28:57,175 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 66 selfloop transitions, 10 changer transitions 3/117 dead transitions. [2023-11-29 05:28:57,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 117 transitions, 796 flow [2023-11-29 05:28:57,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:28:57,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:28:57,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 250 transitions. [2023-11-29 05:28:57,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2023-11-29 05:28:57,177 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 250 transitions. [2023-11-29 05:28:57,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 250 transitions. [2023-11-29 05:28:57,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:28:57,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 250 transitions. [2023-11-29 05:28:57,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:57,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:57,179 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:57,179 INFO L175 Difference]: Start difference. First operand has 86 places, 73 transitions, 458 flow. Second operand 5 states and 250 transitions. [2023-11-29 05:28:57,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 117 transitions, 796 flow [2023-11-29 05:28:57,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 117 transitions, 780 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-11-29 05:28:57,361 INFO L231 Difference]: Finished difference. Result has 91 places, 75 transitions, 481 flow [2023-11-29 05:28:57,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=481, PETRI_PLACES=91, PETRI_TRANSITIONS=75} [2023-11-29 05:28:57,362 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 17 predicate places. [2023-11-29 05:28:57,362 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 75 transitions, 481 flow [2023-11-29 05:28:57,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.4) internal successors, (197), 5 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:57,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:28:57,362 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:28:57,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 05:28:57,362 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:28:57,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:28:57,363 INFO L85 PathProgramCache]: Analyzing trace with hash 205165778, now seen corresponding path program 1 times [2023-11-29 05:28:57,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:28:57,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941034276] [2023-11-29 05:28:57,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:28:57,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:28:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:28:57,624 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-29 05:28:57,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:28:57,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941034276] [2023-11-29 05:28:57,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941034276] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:28:57,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:28:57,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:28:57,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721073705] [2023-11-29 05:28:57,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:28:57,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:28:57,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:28:57,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:28:57,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:28:57,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 05:28:57,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 75 transitions, 481 flow. Second operand has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:57,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:28:57,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 05:28:57,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:29:00,630 INFO L124 PetriNetUnfolderBase]: 13062/19870 cut-off events. [2023-11-29 05:29:00,630 INFO L125 PetriNetUnfolderBase]: For 33675/42160 co-relation queries the response was YES. [2023-11-29 05:29:00,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63026 conditions, 19870 events. 13062/19870 cut-off events. For 33675/42160 co-relation queries the response was YES. Maximal size of possible extension queue 1136. Compared 143331 event pairs, 1133 based on Foata normal form. 992/20039 useless extension candidates. Maximal degree in co-relation 62993. Up to 6605 conditions per place. [2023-11-29 05:29:00,789 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 75 selfloop transitions, 14 changer transitions 2/129 dead transitions. [2023-11-29 05:29:00,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 129 transitions, 894 flow [2023-11-29 05:29:00,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:29:00,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:29:00,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 301 transitions. [2023-11-29 05:29:00,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7487562189054726 [2023-11-29 05:29:00,792 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 301 transitions. [2023-11-29 05:29:00,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 301 transitions. [2023-11-29 05:29:00,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:29:00,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 301 transitions. [2023-11-29 05:29:00,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 50.166666666666664) internal successors, (301), 6 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:00,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:00,795 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:00,795 INFO L175 Difference]: Start difference. First operand has 91 places, 75 transitions, 481 flow. Second operand 6 states and 301 transitions. [2023-11-29 05:29:00,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 129 transitions, 894 flow [2023-11-29 05:29:00,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 129 transitions, 866 flow, removed 7 selfloop flow, removed 5 redundant places. [2023-11-29 05:29:00,845 INFO L231 Difference]: Finished difference. Result has 91 places, 80 transitions, 539 flow [2023-11-29 05:29:00,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=539, PETRI_PLACES=91, PETRI_TRANSITIONS=80} [2023-11-29 05:29:00,846 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 17 predicate places. [2023-11-29 05:29:00,846 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 80 transitions, 539 flow [2023-11-29 05:29:00,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:00,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:29:00,847 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:29:00,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 05:29:00,847 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:29:00,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:29:00,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1787673847, now seen corresponding path program 1 times [2023-11-29 05:29:00,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:29:00,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023833842] [2023-11-29 05:29:00,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:29:00,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:29:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:01,141 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-29 05:29:01,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:29:01,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023833842] [2023-11-29 05:29:01,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023833842] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:29:01,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:29:01,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:29:01,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331845323] [2023-11-29 05:29:01,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:29:01,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:29:01,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:29:01,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:29:01,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:29:01,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-29 05:29:01,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 80 transitions, 539 flow. Second operand has 6 states, 6 states have (on average 36.666666666666664) internal successors, (220), 6 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:01,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:29:01,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-29 05:29:01,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:29:04,247 INFO L124 PetriNetUnfolderBase]: 14202/24140 cut-off events. [2023-11-29 05:29:04,247 INFO L125 PetriNetUnfolderBase]: For 62784/68644 co-relation queries the response was YES. [2023-11-29 05:29:04,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80674 conditions, 24140 events. 14202/24140 cut-off events. For 62784/68644 co-relation queries the response was YES. Maximal size of possible extension queue 1427. Compared 204969 event pairs, 3388 based on Foata normal form. 624/22936 useless extension candidates. Maximal degree in co-relation 80642. Up to 9197 conditions per place. [2023-11-29 05:29:04,451 INFO L140 encePairwiseOnDemand]: 56/67 looper letters, 76 selfloop transitions, 28 changer transitions 40/179 dead transitions. [2023-11-29 05:29:04,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 179 transitions, 1387 flow [2023-11-29 05:29:04,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:29:04,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 05:29:04,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 416 transitions. [2023-11-29 05:29:04,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6898839137645107 [2023-11-29 05:29:04,454 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 416 transitions. [2023-11-29 05:29:04,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 416 transitions. [2023-11-29 05:29:04,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:29:04,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 416 transitions. [2023-11-29 05:29:04,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 46.22222222222222) internal successors, (416), 9 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:04,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 67.0) internal successors, (670), 10 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:04,459 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 67.0) internal successors, (670), 10 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:04,459 INFO L175 Difference]: Start difference. First operand has 91 places, 80 transitions, 539 flow. Second operand 9 states and 416 transitions. [2023-11-29 05:29:04,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 179 transitions, 1387 flow [2023-11-29 05:29:04,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 179 transitions, 1356 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-11-29 05:29:04,776 INFO L231 Difference]: Finished difference. Result has 103 places, 92 transitions, 764 flow [2023-11-29 05:29:04,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=764, PETRI_PLACES=103, PETRI_TRANSITIONS=92} [2023-11-29 05:29:04,777 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 29 predicate places. [2023-11-29 05:29:04,777 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 92 transitions, 764 flow [2023-11-29 05:29:04,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.666666666666664) internal successors, (220), 6 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:04,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:29:04,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:29:04,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 05:29:04,778 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:29:04,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:29:04,778 INFO L85 PathProgramCache]: Analyzing trace with hash 996195157, now seen corresponding path program 2 times [2023-11-29 05:29:04,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:29:04,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661895031] [2023-11-29 05:29:04,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:29:04,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:29:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:05,130 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-29 05:29:05,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:29:05,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661895031] [2023-11-29 05:29:05,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661895031] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:29:05,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:29:05,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:29:05,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296153327] [2023-11-29 05:29:05,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:29:05,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:29:05,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:29:05,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:29:05,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:29:05,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-29 05:29:05,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 92 transitions, 764 flow. Second operand has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:05,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:29:05,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-29 05:29:05,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:29:09,755 INFO L124 PetriNetUnfolderBase]: 16659/28343 cut-off events. [2023-11-29 05:29:09,755 INFO L125 PetriNetUnfolderBase]: For 103586/108408 co-relation queries the response was YES. [2023-11-29 05:29:09,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100305 conditions, 28343 events. 16659/28343 cut-off events. For 103586/108408 co-relation queries the response was YES. Maximal size of possible extension queue 1859. Compared 250951 event pairs, 4443 based on Foata normal form. 678/26304 useless extension candidates. Maximal degree in co-relation 100266. Up to 9869 conditions per place. [2023-11-29 05:29:10,003 INFO L140 encePairwiseOnDemand]: 56/67 looper letters, 93 selfloop transitions, 25 changer transitions 25/178 dead transitions. [2023-11-29 05:29:10,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 178 transitions, 1600 flow [2023-11-29 05:29:10,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:29:10,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 05:29:10,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 384 transitions. [2023-11-29 05:29:10,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7164179104477612 [2023-11-29 05:29:10,005 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 384 transitions. [2023-11-29 05:29:10,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 384 transitions. [2023-11-29 05:29:10,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:29:10,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 384 transitions. [2023-11-29 05:29:10,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 48.0) internal successors, (384), 8 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:10,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:10,009 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:10,009 INFO L175 Difference]: Start difference. First operand has 103 places, 92 transitions, 764 flow. Second operand 8 states and 384 transitions. [2023-11-29 05:29:10,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 178 transitions, 1600 flow [2023-11-29 05:29:10,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 178 transitions, 1508 flow, removed 46 selfloop flow, removed 6 redundant places. [2023-11-29 05:29:10,683 INFO L231 Difference]: Finished difference. Result has 103 places, 94 transitions, 870 flow [2023-11-29 05:29:10,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=870, PETRI_PLACES=103, PETRI_TRANSITIONS=94} [2023-11-29 05:29:10,684 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 29 predicate places. [2023-11-29 05:29:10,684 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 94 transitions, 870 flow [2023-11-29 05:29:10,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:10,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:29:10,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:29:10,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 05:29:10,685 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:29:10,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:29:10,685 INFO L85 PathProgramCache]: Analyzing trace with hash 758131295, now seen corresponding path program 3 times [2023-11-29 05:29:10,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:29:10,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264202310] [2023-11-29 05:29:10,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:29:10,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:29:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:11,024 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-29 05:29:11,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:29:11,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264202310] [2023-11-29 05:29:11,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264202310] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:29:11,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:29:11,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:29:11,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126514088] [2023-11-29 05:29:11,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:29:11,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:29:11,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:29:11,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:29:11,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:29:11,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 05:29:11,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 94 transitions, 870 flow. Second operand has 7 states, 7 states have (on average 38.857142857142854) internal successors, (272), 7 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:11,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:29:11,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 05:29:11,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:29:14,884 INFO L124 PetriNetUnfolderBase]: 18889/28619 cut-off events. [2023-11-29 05:29:14,884 INFO L125 PetriNetUnfolderBase]: For 78777/94488 co-relation queries the response was YES. [2023-11-29 05:29:15,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96847 conditions, 28619 events. 18889/28619 cut-off events. For 78777/94488 co-relation queries the response was YES. Maximal size of possible extension queue 1927. Compared 221114 event pairs, 1471 based on Foata normal form. 1195/28720 useless extension candidates. Maximal degree in co-relation 96807. Up to 10154 conditions per place. [2023-11-29 05:29:15,050 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 62 selfloop transitions, 18 changer transitions 10/142 dead transitions. [2023-11-29 05:29:15,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 142 transitions, 1269 flow [2023-11-29 05:29:15,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:29:15,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:29:15,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 336 transitions. [2023-11-29 05:29:15,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7164179104477612 [2023-11-29 05:29:15,052 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 336 transitions. [2023-11-29 05:29:15,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 336 transitions. [2023-11-29 05:29:15,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:29:15,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 336 transitions. [2023-11-29 05:29:15,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 48.0) internal successors, (336), 7 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:15,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:15,055 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:15,055 INFO L175 Difference]: Start difference. First operand has 103 places, 94 transitions, 870 flow. Second operand 7 states and 336 transitions. [2023-11-29 05:29:15,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 142 transitions, 1269 flow [2023-11-29 05:29:15,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 142 transitions, 1193 flow, removed 20 selfloop flow, removed 6 redundant places. [2023-11-29 05:29:15,483 INFO L231 Difference]: Finished difference. Result has 103 places, 94 transitions, 861 flow [2023-11-29 05:29:15,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=861, PETRI_PLACES=103, PETRI_TRANSITIONS=94} [2023-11-29 05:29:15,484 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 29 predicate places. [2023-11-29 05:29:15,484 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 94 transitions, 861 flow [2023-11-29 05:29:15,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 38.857142857142854) internal successors, (272), 7 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:15,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:29:15,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:29:15,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 05:29:15,485 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:29:15,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:29:15,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1200697620, now seen corresponding path program 1 times [2023-11-29 05:29:15,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:29:15,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275380140] [2023-11-29 05:29:15,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:29:15,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:29:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:15,796 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-29 05:29:15,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:29:15,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275380140] [2023-11-29 05:29:15,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275380140] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:29:15,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:29:15,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:29:15,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175168660] [2023-11-29 05:29:15,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:29:15,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:29:15,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:29:15,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:29:15,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:29:15,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-29 05:29:15,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 94 transitions, 861 flow. Second operand has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:15,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:29:15,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-29 05:29:15,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:29:20,002 INFO L124 PetriNetUnfolderBase]: 19034/33850 cut-off events. [2023-11-29 05:29:20,002 INFO L125 PetriNetUnfolderBase]: For 135308/143060 co-relation queries the response was YES. [2023-11-29 05:29:20,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120192 conditions, 33850 events. 19034/33850 cut-off events. For 135308/143060 co-relation queries the response was YES. Maximal size of possible extension queue 2702. Compared 333604 event pairs, 5350 based on Foata normal form. 533/30554 useless extension candidates. Maximal degree in co-relation 120154. Up to 11107 conditions per place. [2023-11-29 05:29:20,234 INFO L140 encePairwiseOnDemand]: 56/67 looper letters, 34 selfloop transitions, 5 changer transitions 104/180 dead transitions. [2023-11-29 05:29:20,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 180 transitions, 1759 flow [2023-11-29 05:29:20,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:29:20,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 05:29:20,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 366 transitions. [2023-11-29 05:29:20,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6828358208955224 [2023-11-29 05:29:20,235 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 366 transitions. [2023-11-29 05:29:20,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 366 transitions. [2023-11-29 05:29:20,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:29:20,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 366 transitions. [2023-11-29 05:29:20,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 45.75) internal successors, (366), 8 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:20,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:20,238 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:20,238 INFO L175 Difference]: Start difference. First operand has 103 places, 94 transitions, 861 flow. Second operand 8 states and 366 transitions. [2023-11-29 05:29:20,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 180 transitions, 1759 flow [2023-11-29 05:29:22,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 180 transitions, 1640 flow, removed 48 selfloop flow, removed 6 redundant places. [2023-11-29 05:29:22,657 INFO L231 Difference]: Finished difference. Result has 108 places, 65 transitions, 384 flow [2023-11-29 05:29:22,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=384, PETRI_PLACES=108, PETRI_TRANSITIONS=65} [2023-11-29 05:29:22,658 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 34 predicate places. [2023-11-29 05:29:22,658 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 65 transitions, 384 flow [2023-11-29 05:29:22,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:22,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:29:22,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:29:22,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 05:29:22,660 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:29:22,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:29:22,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1689818122, now seen corresponding path program 2 times [2023-11-29 05:29:22,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:29:22,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149084144] [2023-11-29 05:29:22,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:29:22,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:29:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:23,377 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-29 05:29:23,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:29:23,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149084144] [2023-11-29 05:29:23,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149084144] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:29:23,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:29:23,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:29:23,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853895138] [2023-11-29 05:29:23,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:29:23,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:29:23,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:29:23,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:29:23,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:29:23,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 67 [2023-11-29 05:29:23,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 65 transitions, 384 flow. Second operand has 8 states, 8 states have (on average 41.125) internal successors, (329), 8 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:23,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:29:23,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 67 [2023-11-29 05:29:23,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:29:24,055 INFO L124 PetriNetUnfolderBase]: 2041/3972 cut-off events. [2023-11-29 05:29:24,055 INFO L125 PetriNetUnfolderBase]: For 5513/5939 co-relation queries the response was YES. [2023-11-29 05:29:24,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10902 conditions, 3972 events. 2041/3972 cut-off events. For 5513/5939 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 30562 event pairs, 463 based on Foata normal form. 42/3426 useless extension candidates. Maximal degree in co-relation 10862. Up to 1053 conditions per place. [2023-11-29 05:29:24,082 INFO L140 encePairwiseOnDemand]: 59/67 looper letters, 31 selfloop transitions, 5 changer transitions 17/96 dead transitions. [2023-11-29 05:29:24,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 96 transitions, 582 flow [2023-11-29 05:29:24,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:29:24,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 05:29:24,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 404 transitions. [2023-11-29 05:29:24,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6699834162520729 [2023-11-29 05:29:24,084 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 404 transitions. [2023-11-29 05:29:24,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 404 transitions. [2023-11-29 05:29:24,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:29:24,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 404 transitions. [2023-11-29 05:29:24,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 44.888888888888886) internal successors, (404), 9 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:24,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 67.0) internal successors, (670), 10 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:24,087 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 67.0) internal successors, (670), 10 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:24,088 INFO L175 Difference]: Start difference. First operand has 108 places, 65 transitions, 384 flow. Second operand 9 states and 404 transitions. [2023-11-29 05:29:24,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 96 transitions, 582 flow [2023-11-29 05:29:24,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 96 transitions, 496 flow, removed 18 selfloop flow, removed 22 redundant places. [2023-11-29 05:29:24,126 INFO L231 Difference]: Finished difference. Result has 94 places, 65 transitions, 333 flow [2023-11-29 05:29:24,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=333, PETRI_PLACES=94, PETRI_TRANSITIONS=65} [2023-11-29 05:29:24,127 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 20 predicate places. [2023-11-29 05:29:24,127 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 65 transitions, 333 flow [2023-11-29 05:29:24,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 41.125) internal successors, (329), 8 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:24,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:29:24,127 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:29:24,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 05:29:24,128 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:29:24,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:29:24,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1210533800, now seen corresponding path program 3 times [2023-11-29 05:29:24,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:29:24,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283569672] [2023-11-29 05:29:24,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:29:24,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:29:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:29:24,181 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:29:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:29:24,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:29:24,261 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 05:29:24,262 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-29 05:29:24,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-29 05:29:24,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-29 05:29:24,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-29 05:29:24,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-29 05:29:24,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-29 05:29:24,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-29 05:29:24,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-29 05:29:24,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-29 05:29:24,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-29 05:29:24,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-29 05:29:24,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-29 05:29:24,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-29 05:29:24,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-29 05:29:24,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-29 05:29:24,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-29 05:29:24,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 05:29:24,267 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:29:24,274 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 05:29:24,274 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:29:24,357 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 05:29:24,360 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 05:29:24,361 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 05:29:24,363 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 05:29:24,380 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 05:29:24,381 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 05:29:24,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:29:24 BasicIcfg [2023-11-29 05:29:24,396 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:29:24,396 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:29:24,396 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:29:24,396 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:29:24,397 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:28:31" (3/4) ... [2023-11-29 05:29:24,399 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 05:29:24,400 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:29:24,401 INFO L158 Benchmark]: Toolchain (without parser) took 54559.75ms. Allocated memory was 144.7MB in the beginning and 5.9GB in the end (delta: 5.8GB). Free memory was 106.7MB in the beginning and 4.6GB in the end (delta: -4.5GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2023-11-29 05:29:24,401 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 144.7MB. Free memory is still 113.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:29:24,401 INFO L158 Benchmark]: CACSL2BoogieTranslator took 566.11ms. Allocated memory is still 144.7MB. Free memory was 106.7MB in the beginning and 82.8MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 05:29:24,402 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.14ms. Allocated memory is still 144.7MB. Free memory was 82.8MB in the beginning and 80.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:29:24,402 INFO L158 Benchmark]: Boogie Preprocessor took 69.49ms. Allocated memory is still 144.7MB. Free memory was 80.6MB in the beginning and 77.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:29:24,402 INFO L158 Benchmark]: RCFGBuilder took 837.84ms. Allocated memory was 144.7MB in the beginning and 178.3MB in the end (delta: 33.6MB). Free memory was 76.6MB in the beginning and 124.4MB in the end (delta: -47.9MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. [2023-11-29 05:29:24,403 INFO L158 Benchmark]: TraceAbstraction took 53016.18ms. Allocated memory was 178.3MB in the beginning and 5.9GB in the end (delta: 5.7GB). Free memory was 123.4MB in the beginning and 4.6GB in the end (delta: -4.5GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2023-11-29 05:29:24,403 INFO L158 Benchmark]: Witness Printer took 3.90ms. Allocated memory is still 5.9GB. Free memory was 4.6GB in the beginning and 4.6GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:29:24,405 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 144.7MB. Free memory is still 113.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 566.11ms. Allocated memory is still 144.7MB. Free memory was 106.7MB in the beginning and 82.8MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.14ms. Allocated memory is still 144.7MB. Free memory was 82.8MB in the beginning and 80.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.49ms. Allocated memory is still 144.7MB. Free memory was 80.6MB in the beginning and 77.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 837.84ms. Allocated memory was 144.7MB in the beginning and 178.3MB in the end (delta: 33.6MB). Free memory was 76.6MB in the beginning and 124.4MB in the end (delta: -47.9MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. * TraceAbstraction took 53016.18ms. Allocated memory was 178.3MB in the beginning and 5.9GB in the end (delta: 5.7GB). Free memory was 123.4MB in the beginning and 4.6GB in the end (delta: -4.5GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 3.90ms. Allocated memory is still 5.9GB. Free memory was 4.6GB in the beginning and 4.6GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L856] 0 pthread_t t1029; [L857] FCALL, FORK 0 pthread_create(&t1029, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1029={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L858] 0 pthread_t t1030; [L859] FCALL, FORK 0 pthread_create(&t1030, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1029={5:0}, t1030={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L860] 0 pthread_t t1031; [L861] FCALL, FORK 0 pthread_create(&t1031, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1029={5:0}, t1030={6:0}, t1031={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L862] 0 pthread_t t1032; [L863] FCALL, FORK 0 pthread_create(&t1032, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1029={5:0}, t1030={6:0}, t1031={7:0}, t1032={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L825] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L784] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L792] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L793] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L794] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L795] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L797] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 __unbuffered_p2_EAX = z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L834] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L835] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L836] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L837] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L838] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1029={5:0}, t1030={6:0}, t1031={7:0}, t1032={3:0}, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1029={5:0}, t1030={6:0}, t1031={7:0}, t1032={3:0}, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L876] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1029={5:0}, t1030={6:0}, t1031={7:0}, t1032={3:0}, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L878] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix039.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 101 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 52.8s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 46.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1368 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1158 mSDsluCounter, 426 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 302 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3413 IncrementalHoareTripleChecker+Invalid, 3487 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 124 mSDtfsCounter, 3413 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=870occurred in iteration=19, InterpolantAutomatonStates: 127, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 519 NumberOfCodeBlocks, 519 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 454 ConstructedInterpolants, 0 QuantifiedInterpolants, 2960 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 05:29:24,430 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix039.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4df22382a468f75ea1bc6624bacd8789c0b9b9f8aa1bc2866cf2715dcbc507bc --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:29:27,011 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:29:27,092 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 05:29:27,109 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:29:27,110 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:29:27,143 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:29:27,143 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:29:27,144 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:29:27,145 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:29:27,146 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:29:27,146 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:29:27,147 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:29:27,148 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:29:27,149 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:29:27,150 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:29:27,150 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:29:27,151 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:29:27,152 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:29:27,153 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:29:27,153 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:29:27,154 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 05:29:27,155 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 05:29:27,155 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 05:29:27,156 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:29:27,156 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:29:27,157 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 05:29:27,157 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 05:29:27,158 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 05:29:27,158 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:29:27,159 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:29:27,159 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:29:27,160 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:29:27,160 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:29:27,161 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:29:27,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:29:27,161 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:29:27,162 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:29:27,162 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 05:29:27,162 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 05:29:27,162 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:29:27,163 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:29:27,163 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:29:27,163 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:29:27,164 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 05:29:27,164 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_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/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_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4df22382a468f75ea1bc6624bacd8789c0b9b9f8aa1bc2866cf2715dcbc507bc [2023-11-29 05:29:27,516 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:29:27,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:29:27,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:29:27,545 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:29:27,545 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:29:27,547 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix039.opt.i [2023-11-29 05:29:30,687 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:29:30,994 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:29:30,995 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/sv-benchmarks/c/pthread-wmm/mix039.opt.i [2023-11-29 05:29:31,015 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/data/e23658e43/f2f01a138c574c34bf3d28db54603103/FLAGe23f7f1b7 [2023-11-29 05:29:31,033 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/data/e23658e43/f2f01a138c574c34bf3d28db54603103 [2023-11-29 05:29:31,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:29:31,039 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:29:31,041 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:29:31,041 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:29:31,047 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:29:31,048 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:29:31" (1/1) ... [2023-11-29 05:29:31,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ec1028e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:29:31, skipping insertion in model container [2023-11-29 05:29:31,050 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:29:31" (1/1) ... [2023-11-29 05:29:31,115 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:29:31,593 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:29:31,612 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:29:31,689 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:29:31,735 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:29:31,735 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:29:31,745 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:29:31,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:29:31 WrapperNode [2023-11-29 05:29:31,745 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:29:31,747 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:29:31,747 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:29:31,747 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:29:31,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:29:31" (1/1) ... [2023-11-29 05:29:31,781 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:29:31" (1/1) ... [2023-11-29 05:29:31,813 INFO L138 Inliner]: procedures = 180, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 158 [2023-11-29 05:29:31,814 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:29:31,815 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:29:31,815 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:29:31,815 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:29:31,829 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:29:31" (1/1) ... [2023-11-29 05:29:31,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:29:31" (1/1) ... [2023-11-29 05:29:31,834 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:29:31" (1/1) ... [2023-11-29 05:29:31,856 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2023-11-29 05:29:31,856 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:29:31" (1/1) ... [2023-11-29 05:29:31,857 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:29:31" (1/1) ... [2023-11-29 05:29:31,870 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:29:31" (1/1) ... [2023-11-29 05:29:31,872 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:29:31" (1/1) ... [2023-11-29 05:29:31,876 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:29:31" (1/1) ... [2023-11-29 05:29:31,879 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:29:31" (1/1) ... [2023-11-29 05:29:31,885 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:29:31,886 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:29:31,887 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:29:31,887 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:29:31,888 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:29:31" (1/1) ... [2023-11-29 05:29:31,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:29:31,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:29:31,923 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:29:31,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:29:31,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 05:29:31,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:29:31,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:29:31,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:29:31,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 05:29:31,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 05:29:31,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 05:29:31,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 05:29:31,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-11-29 05:29:31,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 05:29:31,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 05:29:31,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 05:29:31,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 05:29:31,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-11-29 05:29:31,977 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 05:29:31,977 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 05:29:31,978 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 05:29:31,978 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 05:29:31,978 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 05:29:31,978 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 05:29:31,979 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-29 05:29:31,979 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-29 05:29:31,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 05:29:31,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:29:31,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:29:31,982 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 05:29:32,186 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:29:32,189 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:29:32,614 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:29:32,836 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:29:32,836 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 05:29:32,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:29:32 BoogieIcfgContainer [2023-11-29 05:29:32,837 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:29:32,840 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:29:32,840 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:29:32,844 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:29:32,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:29:31" (1/3) ... [2023-11-29 05:29:32,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c7853d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:29:32, skipping insertion in model container [2023-11-29 05:29:32,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:29:31" (2/3) ... [2023-11-29 05:29:32,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c7853d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:29:32, skipping insertion in model container [2023-11-29 05:29:32,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:29:32" (3/3) ... [2023-11-29 05:29:32,847 INFO L112 eAbstractionObserver]: Analyzing ICFG mix039.opt.i [2023-11-29 05:29:32,878 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:29:32,878 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-29 05:29:32,879 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 05:29:32,960 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 05:29:33,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 67 transitions, 150 flow [2023-11-29 05:29:33,055 INFO L124 PetriNetUnfolderBase]: 2/63 cut-off events. [2023-11-29 05:29:33,055 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:29:33,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 63 events. 2/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 131 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2023-11-29 05:29:33,061 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 67 transitions, 150 flow [2023-11-29 05:29:33,066 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 63 transitions, 138 flow [2023-11-29 05:29:33,079 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:29:33,087 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;@7a8ecb65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:29:33,087 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-29 05:29:33,092 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 05:29:33,092 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 05:29:33,092 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:29:33,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:29:33,093 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 05:29:33,094 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:29:33,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:29:33,101 INFO L85 PathProgramCache]: Analyzing trace with hash 13655, now seen corresponding path program 1 times [2023-11-29 05:29:33,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:29:33,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1466359157] [2023-11-29 05:29:33,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:29:33,117 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:29:33,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:29:33,119 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:29:33,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 05:29:33,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:33,312 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:29:33,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:29:33,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 05:29:33,429 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-29 05:29:33,429 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:29:33,430 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:29:33,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1466359157] [2023-11-29 05:29:33,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1466359157] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:29:33,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:29:33,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:29:33,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37648130] [2023-11-29 05:29:33,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:29:33,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:29:33,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:29:33,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:29:33,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:29:33,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 67 [2023-11-29 05:29:33,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 63 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:33,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:29:33,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 67 [2023-11-29 05:29:33,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:29:34,214 INFO L124 PetriNetUnfolderBase]: 1175/2199 cut-off events. [2023-11-29 05:29:34,214 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-29 05:29:34,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3936 conditions, 2199 events. 1175/2199 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 17110 event pairs, 879 based on Foata normal form. 120/2134 useless extension candidates. Maximal degree in co-relation 3921. Up to 1277 conditions per place. [2023-11-29 05:29:34,251 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 30 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-11-29 05:29:34,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 67 transitions, 210 flow [2023-11-29 05:29:34,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:29:34,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:29:34,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2023-11-29 05:29:34,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7562189054726368 [2023-11-29 05:29:34,269 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 152 transitions. [2023-11-29 05:29:34,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 152 transitions. [2023-11-29 05:29:34,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:29:34,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 152 transitions. [2023-11-29 05:29:34,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:34,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:34,283 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:34,285 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 138 flow. Second operand 3 states and 152 transitions. [2023-11-29 05:29:34,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 67 transitions, 210 flow [2023-11-29 05:29:34,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 67 transitions, 206 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 05:29:34,295 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 130 flow [2023-11-29 05:29:34,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2023-11-29 05:29:34,302 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -4 predicate places. [2023-11-29 05:29:34,302 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 130 flow [2023-11-29 05:29:34,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:34,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:29:34,303 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 05:29:34,307 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:29:34,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:29:34,504 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:29:34,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:29:34,505 INFO L85 PathProgramCache]: Analyzing trace with hash 13656, now seen corresponding path program 1 times [2023-11-29 05:29:34,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:29:34,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1953308615] [2023-11-29 05:29:34,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:29:34,506 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:29:34,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:29:34,507 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:29:34,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 05:29:34,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:34,627 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:29:34,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:29:34,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:29:34,653 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-29 05:29:34,653 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:29:34,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:29:34,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1953308615] [2023-11-29 05:29:34,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1953308615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:29:34,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:29:34,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:29:34,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543811919] [2023-11-29 05:29:34,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:29:34,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:29:34,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:29:34,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:29:34,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:29:34,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 67 [2023-11-29 05:29:34,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:34,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:29:34,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 67 [2023-11-29 05:29:34,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:29:35,284 INFO L124 PetriNetUnfolderBase]: 1175/2198 cut-off events. [2023-11-29 05:29:35,285 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-29 05:29:35,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3992 conditions, 2198 events. 1175/2198 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16970 event pairs, 879 based on Foata normal form. 1/2014 useless extension candidates. Maximal degree in co-relation 3981. Up to 1276 conditions per place. [2023-11-29 05:29:35,319 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 29 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-11-29 05:29:35,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 66 transitions, 206 flow [2023-11-29 05:29:35,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:29:35,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:29:35,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2023-11-29 05:29:35,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7562189054726368 [2023-11-29 05:29:35,324 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 152 transitions. [2023-11-29 05:29:35,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 152 transitions. [2023-11-29 05:29:35,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:29:35,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 152 transitions. [2023-11-29 05:29:35,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:35,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:35,329 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:35,329 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 130 flow. Second operand 3 states and 152 transitions. [2023-11-29 05:29:35,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 66 transitions, 206 flow [2023-11-29 05:29:35,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 66 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:29:35,337 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 128 flow [2023-11-29 05:29:35,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2023-11-29 05:29:35,338 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -5 predicate places. [2023-11-29 05:29:35,338 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 128 flow [2023-11-29 05:29:35,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:35,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:29:35,339 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:29:35,342 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 05:29:35,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:29:35,540 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:29:35,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:29:35,541 INFO L85 PathProgramCache]: Analyzing trace with hash 407216298, now seen corresponding path program 1 times [2023-11-29 05:29:35,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:29:35,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [673002485] [2023-11-29 05:29:35,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:29:35,543 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:29:35,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:29:35,545 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:29:35,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 05:29:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:35,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:29:35,659 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:29:35,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 05:29:35,673 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-29 05:29:35,673 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:29:35,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:29:35,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [673002485] [2023-11-29 05:29:35,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [673002485] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:29:35,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:29:35,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:29:35,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687378655] [2023-11-29 05:29:35,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:29:35,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:29:35,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:29:35,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:29:35,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:29:35,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 67 [2023-11-29 05:29:35,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:35,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:29:35,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 67 [2023-11-29 05:29:35,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:29:36,235 INFO L124 PetriNetUnfolderBase]: 1176/2196 cut-off events. [2023-11-29 05:29:36,236 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-29 05:29:36,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3993 conditions, 2196 events. 1176/2196 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16913 event pairs, 879 based on Foata normal form. 0/2015 useless extension candidates. Maximal degree in co-relation 3982. Up to 1276 conditions per place. [2023-11-29 05:29:36,266 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 30 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-11-29 05:29:36,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 65 transitions, 206 flow [2023-11-29 05:29:36,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:29:36,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:29:36,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2023-11-29 05:29:36,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2023-11-29 05:29:36,269 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 150 transitions. [2023-11-29 05:29:36,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 150 transitions. [2023-11-29 05:29:36,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:29:36,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 150 transitions. [2023-11-29 05:29:36,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:36,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:36,273 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:36,273 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 128 flow. Second operand 3 states and 150 transitions. [2023-11-29 05:29:36,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 65 transitions, 206 flow [2023-11-29 05:29:36,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 65 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:29:36,279 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-29 05:29:36,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2023-11-29 05:29:36,281 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -6 predicate places. [2023-11-29 05:29:36,281 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-29 05:29:36,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:36,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:29:36,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:29:36,285 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 05:29:36,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:29:36,483 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:29:36,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:29:36,483 INFO L85 PathProgramCache]: Analyzing trace with hash 407216299, now seen corresponding path program 1 times [2023-11-29 05:29:36,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:29:36,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1638139636] [2023-11-29 05:29:36,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:29:36,484 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:29:36,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:29:36,485 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:29:36,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 05:29:36,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:36,586 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:29:36,587 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:29:36,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:29:36,609 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-29 05:29:36,610 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:29:36,610 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:29:36,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1638139636] [2023-11-29 05:29:36,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1638139636] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:29:36,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:29:36,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:29:36,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288783146] [2023-11-29 05:29:36,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:29:36,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:29:36,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:29:36,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:29:36,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:29:36,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 67 [2023-11-29 05:29:36,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:36,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:29:36,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 67 [2023-11-29 05:29:36,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:29:37,092 INFO L124 PetriNetUnfolderBase]: 1175/2194 cut-off events. [2023-11-29 05:29:37,093 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2023-11-29 05:29:37,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3989 conditions, 2194 events. 1175/2194 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16948 event pairs, 742 based on Foata normal form. 2/2016 useless extension candidates. Maximal degree in co-relation 3979. Up to 1273 conditions per place. [2023-11-29 05:29:37,118 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 29 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-29 05:29:37,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 64 transitions, 202 flow [2023-11-29 05:29:37,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:29:37,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:29:37,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2023-11-29 05:29:37,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7562189054726368 [2023-11-29 05:29:37,121 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 152 transitions. [2023-11-29 05:29:37,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 152 transitions. [2023-11-29 05:29:37,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:29:37,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 152 transitions. [2023-11-29 05:29:37,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:37,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:37,125 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:37,126 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 152 transitions. [2023-11-29 05:29:37,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 64 transitions, 202 flow [2023-11-29 05:29:37,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 64 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:29:37,130 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 124 flow [2023-11-29 05:29:37,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2023-11-29 05:29:37,132 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -7 predicate places. [2023-11-29 05:29:37,132 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 124 flow [2023-11-29 05:29:37,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:37,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:29:37,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:29:37,135 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 05:29:37,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:29:37,334 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:29:37,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:29:37,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1901454140, now seen corresponding path program 1 times [2023-11-29 05:29:37,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:29:37,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1032578443] [2023-11-29 05:29:37,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:29:37,335 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:29:37,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:29:37,337 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:29:37,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 05:29:37,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:37,453 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:29:37,454 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:29:37,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 05:29:37,468 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-29 05:29:37,468 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:29:37,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:29:37,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1032578443] [2023-11-29 05:29:37,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1032578443] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:29:37,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:29:37,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:29:37,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541053778] [2023-11-29 05:29:37,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:29:37,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:29:37,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:29:37,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:29:37,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:29:37,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 67 [2023-11-29 05:29:37,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:37,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:29:37,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 67 [2023-11-29 05:29:37,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:29:37,901 INFO L124 PetriNetUnfolderBase]: 1179/2194 cut-off events. [2023-11-29 05:29:37,901 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2023-11-29 05:29:37,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3997 conditions, 2194 events. 1179/2194 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16641 event pairs, 611 based on Foata normal form. 0/2022 useless extension candidates. Maximal degree in co-relation 3987. Up to 1272 conditions per place. [2023-11-29 05:29:37,925 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 30 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-29 05:29:37,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 63 transitions, 202 flow [2023-11-29 05:29:37,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:29:37,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:29:37,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2023-11-29 05:29:37,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2023-11-29 05:29:37,926 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 150 transitions. [2023-11-29 05:29:37,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 150 transitions. [2023-11-29 05:29:37,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:29:37,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 150 transitions. [2023-11-29 05:29:37,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:37,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:37,929 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:37,929 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 124 flow. Second operand 3 states and 150 transitions. [2023-11-29 05:29:37,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 63 transitions, 202 flow [2023-11-29 05:29:37,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 63 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:29:37,933 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 122 flow [2023-11-29 05:29:37,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2023-11-29 05:29:37,934 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -8 predicate places. [2023-11-29 05:29:37,935 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 122 flow [2023-11-29 05:29:37,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:37,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:29:37,935 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:29:37,938 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-29 05:29:38,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:29:38,138 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:29:38,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:29:38,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1901454139, now seen corresponding path program 1 times [2023-11-29 05:29:38,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:29:38,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [726776225] [2023-11-29 05:29:38,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:29:38,139 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:29:38,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:29:38,140 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:29:38,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 05:29:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:38,256 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:29:38,258 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:29:38,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:29:38,282 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-29 05:29:38,282 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:29:38,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:29:38,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [726776225] [2023-11-29 05:29:38,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [726776225] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:29:38,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:29:38,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:29:38,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617697912] [2023-11-29 05:29:38,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:29:38,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:29:38,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:29:38,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:29:38,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:29:38,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 67 [2023-11-29 05:29:38,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:38,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:29:38,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 67 [2023-11-29 05:29:38,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:29:38,766 INFO L124 PetriNetUnfolderBase]: 1175/2183 cut-off events. [2023-11-29 05:29:38,767 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2023-11-29 05:29:38,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3980 conditions, 2183 events. 1175/2183 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 17045 event pairs, 876 based on Foata normal form. 4/2019 useless extension candidates. Maximal degree in co-relation 3970. Up to 1264 conditions per place. [2023-11-29 05:29:38,793 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 29 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-29 05:29:38,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 62 transitions, 198 flow [2023-11-29 05:29:38,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:29:38,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:29:38,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2023-11-29 05:29:38,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7562189054726368 [2023-11-29 05:29:38,795 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 152 transitions. [2023-11-29 05:29:38,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 152 transitions. [2023-11-29 05:29:38,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:29:38,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 152 transitions. [2023-11-29 05:29:38,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:38,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:38,798 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:38,798 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 122 flow. Second operand 3 states and 152 transitions. [2023-11-29 05:29:38,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 62 transitions, 198 flow [2023-11-29 05:29:38,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 62 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:29:38,804 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 120 flow [2023-11-29 05:29:38,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2023-11-29 05:29:38,805 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -9 predicate places. [2023-11-29 05:29:38,805 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 120 flow [2023-11-29 05:29:38,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:38,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:29:38,806 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:29:38,809 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 05:29:39,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:29:39,007 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:29:39,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:29:39,008 INFO L85 PathProgramCache]: Analyzing trace with hash 103804012, now seen corresponding path program 1 times [2023-11-29 05:29:39,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:29:39,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1620885838] [2023-11-29 05:29:39,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:29:39,009 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:29:39,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:29:39,010 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:29:39,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 05:29:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:39,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:29:39,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:29:39,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 05:29:39,156 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-29 05:29:39,157 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:29:39,157 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:29:39,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1620885838] [2023-11-29 05:29:39,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1620885838] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:29:39,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:29:39,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:29:39,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149345717] [2023-11-29 05:29:39,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:29:39,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:29:39,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:29:39,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:29:39,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:29:39,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 67 [2023-11-29 05:29:39,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:39,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:29:39,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 67 [2023-11-29 05:29:39,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:29:39,507 INFO L124 PetriNetUnfolderBase]: 1195/2194 cut-off events. [2023-11-29 05:29:39,507 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2023-11-29 05:29:39,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4023 conditions, 2194 events. 1195/2194 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 16590 event pairs, 459 based on Foata normal form. 0/2049 useless extension candidates. Maximal degree in co-relation 4013. Up to 1264 conditions per place. [2023-11-29 05:29:39,527 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 30 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-29 05:29:39,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 61 transitions, 198 flow [2023-11-29 05:29:39,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:29:39,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:29:39,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2023-11-29 05:29:39,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2023-11-29 05:29:39,529 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 150 transitions. [2023-11-29 05:29:39,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 150 transitions. [2023-11-29 05:29:39,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:29:39,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 150 transitions. [2023-11-29 05:29:39,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:39,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:39,531 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:39,531 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 120 flow. Second operand 3 states and 150 transitions. [2023-11-29 05:29:39,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 61 transitions, 198 flow [2023-11-29 05:29:39,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 61 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:29:39,534 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 118 flow [2023-11-29 05:29:39,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2023-11-29 05:29:39,535 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -10 predicate places. [2023-11-29 05:29:39,535 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 118 flow [2023-11-29 05:29:39,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:39,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:29:39,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:29:39,538 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 05:29:39,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:29:39,736 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:29:39,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:29:39,737 INFO L85 PathProgramCache]: Analyzing trace with hash 103804013, now seen corresponding path program 1 times [2023-11-29 05:29:39,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:29:39,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1239859572] [2023-11-29 05:29:39,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:29:39,738 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:29:39,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:29:39,739 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:29:39,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 05:29:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:39,861 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:29:39,862 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:29:39,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:29:39,885 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-29 05:29:39,885 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:29:39,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:29:39,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1239859572] [2023-11-29 05:29:39,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1239859572] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:29:39,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:29:39,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:29:39,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370399454] [2023-11-29 05:29:39,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:29:39,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:29:39,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:29:39,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:29:39,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:29:39,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 67 [2023-11-29 05:29:39,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:39,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:29:39,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 67 [2023-11-29 05:29:39,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:29:40,356 INFO L124 PetriNetUnfolderBase]: 1175/2162 cut-off events. [2023-11-29 05:29:40,357 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2023-11-29 05:29:40,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3967 conditions, 2162 events. 1175/2162 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16310 event pairs, 459 based on Foata normal form. 12/2035 useless extension candidates. Maximal degree in co-relation 3957. Up to 1232 conditions per place. [2023-11-29 05:29:40,381 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 29 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-29 05:29:40,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 60 transitions, 194 flow [2023-11-29 05:29:40,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:29:40,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:29:40,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2023-11-29 05:29:40,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7562189054726368 [2023-11-29 05:29:40,384 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 152 transitions. [2023-11-29 05:29:40,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 152 transitions. [2023-11-29 05:29:40,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:29:40,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 152 transitions. [2023-11-29 05:29:40,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:40,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:40,386 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:40,386 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 118 flow. Second operand 3 states and 152 transitions. [2023-11-29 05:29:40,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 60 transitions, 194 flow [2023-11-29 05:29:40,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 60 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:29:40,389 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 116 flow [2023-11-29 05:29:40,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2023-11-29 05:29:40,391 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -11 predicate places. [2023-11-29 05:29:40,391 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 116 flow [2023-11-29 05:29:40,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:40,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:29:40,392 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:29:40,398 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-29 05:29:40,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:29:40,595 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:29:40,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:29:40,596 INFO L85 PathProgramCache]: Analyzing trace with hash 49288091, now seen corresponding path program 1 times [2023-11-29 05:29:40,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:29:40,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [180672639] [2023-11-29 05:29:40,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:29:40,596 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:29:40,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:29:40,598 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:29:40,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 05:29:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:40,707 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:29:40,709 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:29:40,742 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-29 05:29:40,743 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:29:40,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:29:40,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [180672639] [2023-11-29 05:29:40,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [180672639] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:29:40,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:29:40,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:29:40,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513522443] [2023-11-29 05:29:40,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:29:40,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:29:40,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:29:40,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:29:40,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:29:40,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 67 [2023-11-29 05:29:40,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:40,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:29:40,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 67 [2023-11-29 05:29:40,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:29:41,036 INFO L124 PetriNetUnfolderBase]: 931/1870 cut-off events. [2023-11-29 05:29:41,037 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-11-29 05:29:41,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3323 conditions, 1870 events. 931/1870 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 14075 event pairs, 199 based on Foata normal form. 0/1853 useless extension candidates. Maximal degree in co-relation 3313. Up to 1021 conditions per place. [2023-11-29 05:29:41,048 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 29 selfloop transitions, 2 changer transitions 2/62 dead transitions. [2023-11-29 05:29:41,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 62 transitions, 204 flow [2023-11-29 05:29:41,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:29:41,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:29:41,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2023-11-29 05:29:41,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7810945273631841 [2023-11-29 05:29:41,049 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 157 transitions. [2023-11-29 05:29:41,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 157 transitions. [2023-11-29 05:29:41,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:29:41,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 157 transitions. [2023-11-29 05:29:41,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:41,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:41,051 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:41,051 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 157 transitions. [2023-11-29 05:29:41,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 62 transitions, 204 flow [2023-11-29 05:29:41,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 62 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:29:41,053 INFO L231 Difference]: Finished difference. Result has 62 places, 50 transitions, 112 flow [2023-11-29 05:29:41,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=62, PETRI_TRANSITIONS=50} [2023-11-29 05:29:41,054 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -12 predicate places. [2023-11-29 05:29:41,054 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 112 flow [2023-11-29 05:29:41,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:41,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:29:41,055 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] [2023-11-29 05:29:41,058 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-29 05:29:41,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:29:41,255 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:29:41,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:29:41,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1324238744, now seen corresponding path program 1 times [2023-11-29 05:29:41,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:29:41,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [565756795] [2023-11-29 05:29:41,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:29:41,257 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:29:41,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:29:41,258 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:29:41,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 05:29:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:41,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:29:41,397 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:29:41,440 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-29 05:29:41,441 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:29:41,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:29:41,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [565756795] [2023-11-29 05:29:41,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [565756795] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:29:41,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:29:41,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:29:41,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419893667] [2023-11-29 05:29:41,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:29:41,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:29:41,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:29:41,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:29:41,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:29:41,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 05:29:41,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:41,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:29:41,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 05:29:41,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:29:42,184 INFO L124 PetriNetUnfolderBase]: 4352/6927 cut-off events. [2023-11-29 05:29:42,184 INFO L125 PetriNetUnfolderBase]: For 312/312 co-relation queries the response was YES. [2023-11-29 05:29:42,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13374 conditions, 6927 events. 4352/6927 cut-off events. For 312/312 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 49731 event pairs, 536 based on Foata normal form. 180/7094 useless extension candidates. Maximal degree in co-relation 13363. Up to 4015 conditions per place. [2023-11-29 05:29:42,231 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 45 selfloop transitions, 6 changer transitions 1/76 dead transitions. [2023-11-29 05:29:42,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 76 transitions, 278 flow [2023-11-29 05:29:42,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:29:42,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 05:29:42,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 198 transitions. [2023-11-29 05:29:42,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7388059701492538 [2023-11-29 05:29:42,233 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 198 transitions. [2023-11-29 05:29:42,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 198 transitions. [2023-11-29 05:29:42,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:29:42,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 198 transitions. [2023-11-29 05:29:42,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 49.5) internal successors, (198), 4 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:42,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:42,236 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:42,236 INFO L175 Difference]: Start difference. First operand has 62 places, 50 transitions, 112 flow. Second operand 4 states and 198 transitions. [2023-11-29 05:29:42,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 76 transitions, 278 flow [2023-11-29 05:29:42,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 76 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:29:42,238 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 150 flow [2023-11-29 05:29:42,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2023-11-29 05:29:42,239 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -10 predicate places. [2023-11-29 05:29:42,240 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 150 flow [2023-11-29 05:29:42,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:42,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:29:42,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:29:42,244 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-29 05:29:42,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:29:42,442 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:29:42,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:29:42,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1323852369, now seen corresponding path program 1 times [2023-11-29 05:29:42,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:29:42,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [200819380] [2023-11-29 05:29:42,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:29:42,444 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:29:42,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:29:42,445 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:29:42,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 05:29:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:42,609 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:29:42,611 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:29:42,669 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-29 05:29:42,670 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:29:42,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:29:42,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [200819380] [2023-11-29 05:29:42,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [200819380] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:29:42,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:29:42,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:29:42,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871772868] [2023-11-29 05:29:42,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:29:42,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:29:42,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:29:42,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:29:42,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:29:42,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 05:29:42,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 150 flow. Second operand has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:42,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:29:42,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 05:29:42,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:29:43,414 INFO L124 PetriNetUnfolderBase]: 3648/5843 cut-off events. [2023-11-29 05:29:43,414 INFO L125 PetriNetUnfolderBase]: For 1511/1511 co-relation queries the response was YES. [2023-11-29 05:29:43,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13106 conditions, 5843 events. 3648/5843 cut-off events. For 1511/1511 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 40667 event pairs, 192 based on Foata normal form. 174/6006 useless extension candidates. Maximal degree in co-relation 13093. Up to 3097 conditions per place. [2023-11-29 05:29:43,445 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 57 selfloop transitions, 10 changer transitions 1/92 dead transitions. [2023-11-29 05:29:43,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 92 transitions, 391 flow [2023-11-29 05:29:43,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:29:43,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:29:43,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 250 transitions. [2023-11-29 05:29:43,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2023-11-29 05:29:43,448 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 250 transitions. [2023-11-29 05:29:43,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 250 transitions. [2023-11-29 05:29:43,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:29:43,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 250 transitions. [2023-11-29 05:29:43,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:43,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:43,451 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:43,451 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 150 flow. Second operand 5 states and 250 transitions. [2023-11-29 05:29:43,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 92 transitions, 391 flow [2023-11-29 05:29:43,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 92 transitions, 380 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 05:29:43,454 INFO L231 Difference]: Finished difference. Result has 68 places, 58 transitions, 202 flow [2023-11-29 05:29:43,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=202, PETRI_PLACES=68, PETRI_TRANSITIONS=58} [2023-11-29 05:29:43,455 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -6 predicate places. [2023-11-29 05:29:43,455 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 58 transitions, 202 flow [2023-11-29 05:29:43,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:43,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:29:43,456 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:29:43,459 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-29 05:29:43,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:29:43,656 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:29:43,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:29:43,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1489142850, now seen corresponding path program 1 times [2023-11-29 05:29:43,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:29:43,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1500412273] [2023-11-29 05:29:43,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:29:43,658 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:29:43,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:29:43,659 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:29:43,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-29 05:29:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:43,780 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:29:43,782 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:29:43,849 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-29 05:29:43,849 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:29:43,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:29:43,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1500412273] [2023-11-29 05:29:43,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1500412273] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:29:43,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:29:43,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:29:43,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631482763] [2023-11-29 05:29:43,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:29:43,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:29:43,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:29:43,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:29:43,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:29:43,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 05:29:43,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 58 transitions, 202 flow. Second operand has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:43,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:29:43,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 05:29:43,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:29:44,536 INFO L124 PetriNetUnfolderBase]: 2373/3786 cut-off events. [2023-11-29 05:29:44,536 INFO L125 PetriNetUnfolderBase]: For 2868/2868 co-relation queries the response was YES. [2023-11-29 05:29:44,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9596 conditions, 3786 events. 2373/3786 cut-off events. For 2868/2868 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 23105 event pairs, 69 based on Foata normal form. 140/3915 useless extension candidates. Maximal degree in co-relation 9581. Up to 1465 conditions per place. [2023-11-29 05:29:44,558 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 67 selfloop transitions, 14 changer transitions 1/106 dead transitions. [2023-11-29 05:29:44,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 106 transitions, 510 flow [2023-11-29 05:29:44,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:29:44,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:29:44,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 300 transitions. [2023-11-29 05:29:44,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2023-11-29 05:29:44,560 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 300 transitions. [2023-11-29 05:29:44,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 300 transitions. [2023-11-29 05:29:44,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:29:44,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 300 transitions. [2023-11-29 05:29:44,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:44,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:44,565 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:44,565 INFO L175 Difference]: Start difference. First operand has 68 places, 58 transitions, 202 flow. Second operand 6 states and 300 transitions. [2023-11-29 05:29:44,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 106 transitions, 510 flow [2023-11-29 05:29:44,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 106 transitions, 480 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 05:29:44,574 INFO L231 Difference]: Finished difference. Result has 71 places, 62 transitions, 252 flow [2023-11-29 05:29:44,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=252, PETRI_PLACES=71, PETRI_TRANSITIONS=62} [2023-11-29 05:29:44,576 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -3 predicate places. [2023-11-29 05:29:44,576 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 62 transitions, 252 flow [2023-11-29 05:29:44,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:44,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:29:44,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:29:44,580 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-11-29 05:29:44,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:29:44,780 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:29:44,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:29:44,780 INFO L85 PathProgramCache]: Analyzing trace with hash 904763049, now seen corresponding path program 1 times [2023-11-29 05:29:44,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:29:44,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672580193] [2023-11-29 05:29:44,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:29:44,781 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:29:44,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:29:44,782 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:29:44,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 05:29:44,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:44,943 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:29:44,945 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:29:45,047 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-29 05:29:45,047 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:29:45,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:29:45,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672580193] [2023-11-29 05:29:45,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672580193] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:29:45,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:29:45,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:29:45,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548929646] [2023-11-29 05:29:45,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:29:45,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:29:45,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:29:45,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:29:45,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:29:45,060 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 05:29:45,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 252 flow. Second operand has 7 states, 7 states have (on average 38.57142857142857) internal successors, (270), 7 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:45,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:29:45,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 05:29:45,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:29:45,628 INFO L124 PetriNetUnfolderBase]: 1385/2114 cut-off events. [2023-11-29 05:29:45,628 INFO L125 PetriNetUnfolderBase]: For 3118/3118 co-relation queries the response was YES. [2023-11-29 05:29:45,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6173 conditions, 2114 events. 1385/2114 cut-off events. For 3118/3118 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 10487 event pairs, 39 based on Foata normal form. 72/2175 useless extension candidates. Maximal degree in co-relation 6157. Up to 668 conditions per place. [2023-11-29 05:29:45,641 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 61 selfloop transitions, 18 changer transitions 1/104 dead transitions. [2023-11-29 05:29:45,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 104 transitions, 512 flow [2023-11-29 05:29:45,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:29:45,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:29:45,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 334 transitions. [2023-11-29 05:29:45,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7121535181236673 [2023-11-29 05:29:45,644 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 334 transitions. [2023-11-29 05:29:45,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 334 transitions. [2023-11-29 05:29:45,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:29:45,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 334 transitions. [2023-11-29 05:29:45,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 47.714285714285715) internal successors, (334), 7 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:45,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:45,648 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:45,648 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 252 flow. Second operand 7 states and 334 transitions. [2023-11-29 05:29:45,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 104 transitions, 512 flow [2023-11-29 05:29:45,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 104 transitions, 466 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-29 05:29:45,668 INFO L231 Difference]: Finished difference. Result has 74 places, 62 transitions, 262 flow [2023-11-29 05:29:45,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=262, PETRI_PLACES=74, PETRI_TRANSITIONS=62} [2023-11-29 05:29:45,669 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 0 predicate places. [2023-11-29 05:29:45,669 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 62 transitions, 262 flow [2023-11-29 05:29:45,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 38.57142857142857) internal successors, (270), 7 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:45,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:29:45,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:29:45,673 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-29 05:29:45,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:29:45,870 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:29:45,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:29:45,871 INFO L85 PathProgramCache]: Analyzing trace with hash 145833051, now seen corresponding path program 1 times [2023-11-29 05:29:45,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:29:45,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1307452984] [2023-11-29 05:29:45,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:29:45,872 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:29:45,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:29:45,873 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:29:45,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-29 05:29:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:46,120 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 05:29:46,124 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:29:47,260 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t1032~0#1.base_41| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t1031~0#1.base_39| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t1029~0#1.base_49| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t1030~0#1.base_45| (_ BitVec 32))) (let ((.cse1 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1029~0#1.base_49| (_ bv1 1)))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t1030~0#1.base_45| (_ bv1 1)))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1029~0#1.base_49|)) (= (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1029~0#1.base_49| (_ bv0 1)) |v_ULTIMATE.start_main_~#t1030~0#1.base_45| (_ bv0 1)) |v_ULTIMATE.start_main_~#t1031~0#1.base_39| (_ bv0 1)) |v_ULTIMATE.start_main_~#t1032~0#1.base_41| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_~#t1031~0#1.base_39|)) (= (_ bv0 1) (select (store .cse0 |v_ULTIMATE.start_main_~#t1031~0#1.base_39| (_ bv1 1)) |v_ULTIMATE.start_main_~#t1032~0#1.base_41|)) (= (_ bv0 1) (select .cse1 |v_ULTIMATE.start_main_~#t1030~0#1.base_45|)))))) is different from true [2023-11-29 05:29:47,261 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-29 05:29:47,261 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:29:47,261 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:29:47,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1307452984] [2023-11-29 05:29:47,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1307452984] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:29:47,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:29:47,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:29:47,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079774942] [2023-11-29 05:29:47,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:29:47,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:29:47,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:29:47,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:29:47,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2023-11-29 05:29:47,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 67 [2023-11-29 05:29:47,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 62 transitions, 262 flow. Second operand has 7 states, 7 states have (on average 31.0) internal successors, (217), 7 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:47,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:29:47,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 67 [2023-11-29 05:29:47,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:29:47,834 INFO L124 PetriNetUnfolderBase]: 674/1295 cut-off events. [2023-11-29 05:29:47,835 INFO L125 PetriNetUnfolderBase]: For 513/540 co-relation queries the response was YES. [2023-11-29 05:29:47,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2822 conditions, 1295 events. 674/1295 cut-off events. For 513/540 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7451 event pairs, 272 based on Foata normal form. 16/1183 useless extension candidates. Maximal degree in co-relation 2804. Up to 814 conditions per place. [2023-11-29 05:29:47,844 INFO L140 encePairwiseOnDemand]: 57/67 looper letters, 32 selfloop transitions, 9 changer transitions 0/77 dead transitions. [2023-11-29 05:29:47,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 77 transitions, 374 flow [2023-11-29 05:29:47,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:29:47,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:29:47,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 238 transitions. [2023-11-29 05:29:47,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5074626865671642 [2023-11-29 05:29:47,846 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 238 transitions. [2023-11-29 05:29:47,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 238 transitions. [2023-11-29 05:29:47,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:29:47,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 238 transitions. [2023-11-29 05:29:47,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:47,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:47,849 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:47,849 INFO L175 Difference]: Start difference. First operand has 74 places, 62 transitions, 262 flow. Second operand 7 states and 238 transitions. [2023-11-29 05:29:47,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 77 transitions, 374 flow [2023-11-29 05:29:47,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 77 transitions, 278 flow, removed 17 selfloop flow, removed 10 redundant places. [2023-11-29 05:29:47,853 INFO L231 Difference]: Finished difference. Result has 71 places, 66 transitions, 207 flow [2023-11-29 05:29:47,853 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=207, PETRI_PLACES=71, PETRI_TRANSITIONS=66} [2023-11-29 05:29:47,854 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -3 predicate places. [2023-11-29 05:29:47,854 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 66 transitions, 207 flow [2023-11-29 05:29:47,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 31.0) internal successors, (217), 7 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:47,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:29:47,855 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:29:47,858 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-29 05:29:48,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:29:48,055 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:29:48,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:29:48,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1591568056, now seen corresponding path program 1 times [2023-11-29 05:29:48,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:29:48,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1669875323] [2023-11-29 05:29:48,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:29:48,056 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:29:48,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:29:48,058 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:29:48,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-29 05:29:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:48,241 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:29:48,244 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:29:48,348 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-29 05:29:48,349 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:29:48,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:29:48,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1669875323] [2023-11-29 05:29:48,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1669875323] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:29:48,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:29:48,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:29:48,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696009230] [2023-11-29 05:29:48,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:29:48,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:29:48,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:29:48,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:29:48,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:29:48,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 67 [2023-11-29 05:29:48,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 66 transitions, 207 flow. Second operand has 6 states, 6 states have (on average 41.166666666666664) internal successors, (247), 6 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:48,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:29:48,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 67 [2023-11-29 05:29:48,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:29:48,960 INFO L124 PetriNetUnfolderBase]: 1999/3581 cut-off events. [2023-11-29 05:29:48,960 INFO L125 PetriNetUnfolderBase]: For 1074/1470 co-relation queries the response was YES. [2023-11-29 05:29:48,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8449 conditions, 3581 events. 1999/3581 cut-off events. For 1074/1470 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 23175 event pairs, 567 based on Foata normal form. 16/3337 useless extension candidates. Maximal degree in co-relation 8436. Up to 1423 conditions per place. [2023-11-29 05:29:48,982 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 64 selfloop transitions, 5 changer transitions 0/107 dead transitions. [2023-11-29 05:29:48,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 107 transitions, 488 flow [2023-11-29 05:29:48,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:29:48,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:29:48,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 290 transitions. [2023-11-29 05:29:48,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7213930348258707 [2023-11-29 05:29:48,984 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 290 transitions. [2023-11-29 05:29:48,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 290 transitions. [2023-11-29 05:29:48,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:29:48,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 290 transitions. [2023-11-29 05:29:48,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 48.333333333333336) internal successors, (290), 6 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:48,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:48,988 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:48,988 INFO L175 Difference]: Start difference. First operand has 71 places, 66 transitions, 207 flow. Second operand 6 states and 290 transitions. [2023-11-29 05:29:48,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 107 transitions, 488 flow [2023-11-29 05:29:48,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 107 transitions, 462 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 05:29:48,992 INFO L231 Difference]: Finished difference. Result has 75 places, 70 transitions, 233 flow [2023-11-29 05:29:48,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=233, PETRI_PLACES=75, PETRI_TRANSITIONS=70} [2023-11-29 05:29:48,993 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 1 predicate places. [2023-11-29 05:29:48,993 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 70 transitions, 233 flow [2023-11-29 05:29:48,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.166666666666664) internal successors, (247), 6 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:48,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:29:48,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:29:48,997 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-11-29 05:29:49,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:29:49,195 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:29:49,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:29:49,195 INFO L85 PathProgramCache]: Analyzing trace with hash -903134826, now seen corresponding path program 2 times [2023-11-29 05:29:49,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:29:49,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [531277561] [2023-11-29 05:29:49,196 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:29:49,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:29:49,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:29:49,197 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:29:49,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-29 05:29:49,368 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 05:29:49,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:29:49,375 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:29:49,378 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:29:49,474 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-29 05:29:49,474 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:29:49,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:29:49,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [531277561] [2023-11-29 05:29:49,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [531277561] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:29:49,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:29:49,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:29:49,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978501249] [2023-11-29 05:29:49,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:29:49,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:29:49,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:29:49,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:29:49,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:29:49,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 67 [2023-11-29 05:29:49,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 70 transitions, 233 flow. Second operand has 6 states, 6 states have (on average 41.166666666666664) internal successors, (247), 6 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:49,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:29:49,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 67 [2023-11-29 05:29:49,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:29:50,273 INFO L124 PetriNetUnfolderBase]: 2776/4833 cut-off events. [2023-11-29 05:29:50,273 INFO L125 PetriNetUnfolderBase]: For 1856/2662 co-relation queries the response was YES. [2023-11-29 05:29:50,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12148 conditions, 4833 events. 2776/4833 cut-off events. For 1856/2662 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 32255 event pairs, 801 based on Foata normal form. 16/4446 useless extension candidates. Maximal degree in co-relation 12132. Up to 2295 conditions per place. [2023-11-29 05:29:50,305 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 64 selfloop transitions, 8 changer transitions 0/111 dead transitions. [2023-11-29 05:29:50,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 111 transitions, 525 flow [2023-11-29 05:29:50,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:29:50,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:29:50,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 287 transitions. [2023-11-29 05:29:50,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7139303482587065 [2023-11-29 05:29:50,307 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 287 transitions. [2023-11-29 05:29:50,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 287 transitions. [2023-11-29 05:29:50,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:29:50,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 287 transitions. [2023-11-29 05:29:50,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 47.833333333333336) internal successors, (287), 6 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:50,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:50,311 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:50,311 INFO L175 Difference]: Start difference. First operand has 75 places, 70 transitions, 233 flow. Second operand 6 states and 287 transitions. [2023-11-29 05:29:50,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 111 transitions, 525 flow [2023-11-29 05:29:50,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 111 transitions, 524 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:29:50,321 INFO L231 Difference]: Finished difference. Result has 83 places, 77 transitions, 315 flow [2023-11-29 05:29:50,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=315, PETRI_PLACES=83, PETRI_TRANSITIONS=77} [2023-11-29 05:29:50,322 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 9 predicate places. [2023-11-29 05:29:50,322 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 77 transitions, 315 flow [2023-11-29 05:29:50,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.166666666666664) internal successors, (247), 6 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:50,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:29:50,322 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:29:50,325 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-11-29 05:29:50,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:29:50,523 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:29:50,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:29:50,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1147813466, now seen corresponding path program 3 times [2023-11-29 05:29:50,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:29:50,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1463847293] [2023-11-29 05:29:50,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 05:29:50,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:29:50,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:29:50,525 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:29:50,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-11-29 05:29:50,673 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-29 05:29:50,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:29:50,679 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:29:50,680 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:29:50,716 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-29 05:29:50,716 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:29:50,717 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:29:50,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1463847293] [2023-11-29 05:29:50,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1463847293] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:29:50,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:29:50,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:29:50,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231351658] [2023-11-29 05:29:50,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:29:50,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:29:50,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:29:50,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:29:50,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:29:50,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 67 [2023-11-29 05:29:50,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 77 transitions, 315 flow. Second operand has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:50,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:29:50,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 67 [2023-11-29 05:29:50,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:29:51,875 INFO L124 PetriNetUnfolderBase]: 5922/10162 cut-off events. [2023-11-29 05:29:51,875 INFO L125 PetriNetUnfolderBase]: For 5237/5492 co-relation queries the response was YES. [2023-11-29 05:29:51,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25952 conditions, 10162 events. 5922/10162 cut-off events. For 5237/5492 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 74511 event pairs, 2330 based on Foata normal form. 16/9312 useless extension candidates. Maximal degree in co-relation 25932. Up to 4739 conditions per place. [2023-11-29 05:29:52,007 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 62 selfloop transitions, 14 changer transitions 0/116 dead transitions. [2023-11-29 05:29:52,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 116 transitions, 661 flow [2023-11-29 05:29:52,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:29:52,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:29:52,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 241 transitions. [2023-11-29 05:29:52,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7194029850746269 [2023-11-29 05:29:52,009 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 241 transitions. [2023-11-29 05:29:52,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 241 transitions. [2023-11-29 05:29:52,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:29:52,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 241 transitions. [2023-11-29 05:29:52,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 48.2) internal successors, (241), 5 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:52,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:52,011 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:52,011 INFO L175 Difference]: Start difference. First operand has 83 places, 77 transitions, 315 flow. Second operand 5 states and 241 transitions. [2023-11-29 05:29:52,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 116 transitions, 661 flow [2023-11-29 05:29:52,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 116 transitions, 660 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:29:52,029 INFO L231 Difference]: Finished difference. Result has 89 places, 90 transitions, 502 flow [2023-11-29 05:29:52,029 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=502, PETRI_PLACES=89, PETRI_TRANSITIONS=90} [2023-11-29 05:29:52,030 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 15 predicate places. [2023-11-29 05:29:52,030 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 90 transitions, 502 flow [2023-11-29 05:29:52,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:52,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:29:52,030 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:29:52,034 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-11-29 05:29:52,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:29:52,231 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:29:52,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:29:52,231 INFO L85 PathProgramCache]: Analyzing trace with hash 621802532, now seen corresponding path program 4 times [2023-11-29 05:29:52,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:29:52,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1616445416] [2023-11-29 05:29:52,232 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 05:29:52,232 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:29:52,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:29:52,233 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:29:52,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-11-29 05:29:52,383 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 05:29:52,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:29:52,389 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 05:29:52,391 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:29:52,636 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-29 05:29:52,636 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:29:52,637 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:29:52,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1616445416] [2023-11-29 05:29:52,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1616445416] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:29:52,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:29:52,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:29:52,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167840633] [2023-11-29 05:29:52,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:29:52,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:29:52,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:29:52,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:29:52,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:29:52,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 67 [2023-11-29 05:29:52,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 90 transitions, 502 flow. Second operand has 8 states, 8 states have (on average 42.125) internal successors, (337), 8 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:52,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:29:52,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 67 [2023-11-29 05:29:52,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:29:54,428 INFO L124 PetriNetUnfolderBase]: 7595/13671 cut-off events. [2023-11-29 05:29:54,429 INFO L125 PetriNetUnfolderBase]: For 12496/12807 co-relation queries the response was YES. [2023-11-29 05:29:54,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37241 conditions, 13671 events. 7595/13671 cut-off events. For 12496/12807 co-relation queries the response was YES. Maximal size of possible extension queue 751. Compared 110382 event pairs, 1634 based on Foata normal form. 16/12815 useless extension candidates. Maximal degree in co-relation 37218. Up to 7123 conditions per place. [2023-11-29 05:29:54,531 INFO L140 encePairwiseOnDemand]: 58/67 looper letters, 75 selfloop transitions, 30 changer transitions 0/148 dead transitions. [2023-11-29 05:29:54,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 148 transitions, 1114 flow [2023-11-29 05:29:54,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:29:54,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 05:29:54,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 416 transitions. [2023-11-29 05:29:54,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6898839137645107 [2023-11-29 05:29:54,534 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 416 transitions. [2023-11-29 05:29:54,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 416 transitions. [2023-11-29 05:29:54,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:29:54,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 416 transitions. [2023-11-29 05:29:54,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 46.22222222222222) internal successors, (416), 9 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:54,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 67.0) internal successors, (670), 10 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:54,537 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 67.0) internal successors, (670), 10 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:54,537 INFO L175 Difference]: Start difference. First operand has 89 places, 90 transitions, 502 flow. Second operand 9 states and 416 transitions. [2023-11-29 05:29:54,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 148 transitions, 1114 flow [2023-11-29 05:29:54,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 148 transitions, 1112 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:29:54,662 INFO L231 Difference]: Finished difference. Result has 100 places, 116 transitions, 948 flow [2023-11-29 05:29:54,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=948, PETRI_PLACES=100, PETRI_TRANSITIONS=116} [2023-11-29 05:29:54,663 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 26 predicate places. [2023-11-29 05:29:54,663 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 116 transitions, 948 flow [2023-11-29 05:29:54,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 42.125) internal successors, (337), 8 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:29:54,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:29:54,663 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:29:54,667 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-11-29 05:29:54,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:29:54,864 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:29:54,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:29:54,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1826676738, now seen corresponding path program 5 times [2023-11-29 05:29:54,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:29:54,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2081685138] [2023-11-29 05:29:54,865 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 05:29:54,865 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:29:54,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:29:54,866 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:29:54,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-11-29 05:29:55,015 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 05:29:55,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 05:29:55,016 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:29:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:29:55,194 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-29 05:29:55,194 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 05:29:55,196 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-29 05:29:55,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-29 05:29:55,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-29 05:29:55,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-29 05:29:55,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-29 05:29:55,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-29 05:29:55,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-29 05:29:55,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-29 05:29:55,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-29 05:29:55,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-29 05:29:55,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-29 05:29:55,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-29 05:29:55,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-29 05:29:55,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-29 05:29:55,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-29 05:29:55,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-29 05:29:55,205 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2023-11-29 05:29:55,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:29:55,406 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:29:55,410 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 05:29:55,410 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:29:55,477 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 05:29:55,479 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 05:29:55,480 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 05:29:55,482 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 05:29:55,500 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 05:29:55,501 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 05:29:55,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:29:55 BasicIcfg [2023-11-29 05:29:55,515 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:29:55,515 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:29:55,515 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:29:55,516 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:29:55,516 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:29:32" (3/4) ... [2023-11-29 05:29:55,518 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 05:29:55,519 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:29:55,520 INFO L158 Benchmark]: Toolchain (without parser) took 24481.10ms. Allocated memory was 81.8MB in the beginning and 616.6MB in the end (delta: 534.8MB). Free memory was 57.7MB in the beginning and 212.5MB in the end (delta: -154.8MB). Peak memory consumption was 379.5MB. Max. memory is 16.1GB. [2023-11-29 05:29:55,520 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 58.7MB. Free memory is still 35.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:29:55,520 INFO L158 Benchmark]: CACSL2BoogieTranslator took 705.11ms. Allocated memory is still 81.8MB. Free memory was 57.5MB in the beginning and 52.0MB in the end (delta: 5.5MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2023-11-29 05:29:55,520 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.64ms. Allocated memory is still 81.8MB. Free memory was 52.0MB in the beginning and 49.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:29:55,521 INFO L158 Benchmark]: Boogie Preprocessor took 70.48ms. Allocated memory is still 81.8MB. Free memory was 49.3MB in the beginning and 45.5MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:29:55,521 INFO L158 Benchmark]: RCFGBuilder took 950.90ms. Allocated memory is still 81.8MB. Free memory was 45.5MB in the beginning and 32.1MB in the end (delta: 13.3MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2023-11-29 05:29:55,521 INFO L158 Benchmark]: TraceAbstraction took 22674.82ms. Allocated memory was 81.8MB in the beginning and 616.6MB in the end (delta: 534.8MB). Free memory was 31.7MB in the beginning and 212.5MB in the end (delta: -180.8MB). Peak memory consumption was 353.7MB. Max. memory is 16.1GB. [2023-11-29 05:29:55,521 INFO L158 Benchmark]: Witness Printer took 3.74ms. Allocated memory is still 616.6MB. Free memory is still 212.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:29:55,523 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 58.7MB. Free memory is still 35.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 705.11ms. Allocated memory is still 81.8MB. Free memory was 57.5MB in the beginning and 52.0MB in the end (delta: 5.5MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.64ms. Allocated memory is still 81.8MB. Free memory was 52.0MB in the beginning and 49.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.48ms. Allocated memory is still 81.8MB. Free memory was 49.3MB in the beginning and 45.5MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 950.90ms. Allocated memory is still 81.8MB. Free memory was 45.5MB in the beginning and 32.1MB in the end (delta: 13.3MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * TraceAbstraction took 22674.82ms. Allocated memory was 81.8MB in the beginning and 616.6MB in the end (delta: 534.8MB). Free memory was 31.7MB in the beginning and 212.5MB in the end (delta: -180.8MB). Peak memory consumption was 353.7MB. Max. memory is 16.1GB. * Witness Printer took 3.74ms. Allocated memory is still 616.6MB. Free memory is still 212.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L856] 0 pthread_t t1029; [L857] FCALL, FORK 0 pthread_create(&t1029, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1029={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L858] 0 pthread_t t1030; [L859] FCALL, FORK 0 pthread_create(&t1030, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1029={5:0}, t1030={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L860] 0 pthread_t t1031; [L861] FCALL, FORK 0 pthread_create(&t1031, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1029={5:0}, t1030={7:0}, t1031={-2147483645:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L862] 0 pthread_t t1032; [L863] FCALL, FORK 0 pthread_create(&t1032, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1029={5:0}, t1030={7:0}, t1031={-2147483645:0}, t1032={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L825] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L769] 2 x = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L784] 3 y = 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L792] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L793] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L794] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L795] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L797] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 __unbuffered_p2_EAX = z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L834] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L835] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L836] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L837] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L838] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1029={5:0}, t1030={7:0}, t1031={-2147483645:0}, t1032={15:0}, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1029={5:0}, t1030={7:0}, t1031={-2147483645:0}, t1032={15:0}, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L876] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1029={5:0}, t1030={7:0}, t1031={-2147483645:0}, t1032={15:0}, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L878] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix039.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 101 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 22.4s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 852 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 688 mSDsluCounter, 100 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 71 IncrementalHoareTripleChecker+Unchecked, 66 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2119 IncrementalHoareTripleChecker+Invalid, 2235 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 34 mSDtfsCounter, 2119 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 399 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=948occurred in iteration=18, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 438 NumberOfCodeBlocks, 438 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 377 ConstructedInterpolants, 1 QuantifiedInterpolants, 2987 SizeOfPredicates, 18 NumberOfNonLiveVariables, 2518 ConjunctsInSsa, 97 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 05:29:55,545 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_397e04b6-25f0-44ba-977a-3ab86b3553b4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample